Quantcast

Logic Programming with Satisfiability

Research paper by Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Indexed on: 12 Feb '07Published on: 12 Feb '07Published in: Computer Science - Programming Languages



Abstract

This paper presents a Prolog interface to the MiniSat satisfiability solver. Logic program- ming 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 which we propose here as a logic programming pearl. To illustrate logic programming with SAT solving we give an example Prolog program which solves instances of Partial MAXSAT.