Logic programming with satisfiability

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Research output: Contribution to journalArticlepeer-review

29 Scopus citations


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 languageEnglish
Pages (from-to)121-128
Number of pages8
JournalTheory and Practice of Logic Programming
Issue number1
StatePublished - 1 Jan 2008


  • Boolean satisfiability
  • Propositional logic
  • SAT solvers

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'Logic programming with satisfiability'. Together they form a unique fingerprint.

Cite this