Logic Programming with Satisfiability
<|reference_start|>Logic Programming with Satisfiability: 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.<|reference_end|>
@article{codish2007logic,
    title={Logic Programming with Satisfiability},
    author={Michael Codish, Vitaly Lagoon, and Peter J. Stuckey},
    journal={Theory and Practice of Logic Programming: 8(1):121-128, 2008},
    year={2007},
    archivePrefix={arXiv},
    eprint={cs/0702072},
    primaryClass={cs.PL cs.AI}
}