Abstract
This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic programming with satisfiability combines the strengths of the two paradigms: logic programming for encoding search problems into satisfiability on the one hand and efficient SAT solving on the other. This synergy between these two exposes a programming paradigm that we propose here as a logic programming pearl. To illustrate logic programming with SAT solving, we give an example Prolog program that solves instances of Partial MAXSAT.
| Original language | English |
|---|---|
| Pages (from-to) | 121-128 |
| Number of pages | 8 |
| Journal | Theory and Practice of Logic Programming |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2008 |
Keywords
- Boolean satisfiability
- Propositional logic
- SAT solvers
ASJC Scopus subject areas
- Theoretical Computer Science
- Software
- Hardware and Architecture
- Computational Theory and Mathematics
- Artificial Intelligence