Skip to main content
×
Home
    • Aa
    • Aa

Logic programming with satisfiability

  • MICHAEL CODISH (a1), VITALY LAGOON (a2) and PETER J. STUCKEY (a3)
Abstract
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.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

T. Arts and J. Giesl 2000. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 (1–2), 133178.

N. Dershowitz 1982. Orderings for term-rewriting systems. Theoretical Computer Science 17, 279301.

D. Plaisted and S. Greenbaum 1986. A structure preserving clause form translation. Journal of Symbolic Computation 2, 293304.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords: