Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

TPLP
2008

favoriteEmaildiscussreport

118views more TPLP 2008»

Logic programming with satisfiability

13 years 4 months ago

Logic programming with satisfiability

Download www.cs.bgu.ac.il

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 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.

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Real-time Traffic

Logic Programming | MiniSat Satisfiability | Satisfiability | TPLP 2008 |

claim paper

Related Content

» Reducts of Propositional Theories Satisfiability Relations and Generalizations of Semantic...

» Answer Set Programming Based on Propositional Satisfiability

» Functional Vector Generation for HDL Models Using Linear Programming and 3Satisfiability

» Stable models and difference logic

» The complexity of satisfiability for fragments of hybrid logic Part I

» A Causal Logic of Logic Programming

» Parameterized Modal Satisfiability

» Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

» Partial Instantiation Methods for Inference in FirstOrder Logic

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2008
Where	TPLP
Authors	Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Comments (0)