Logic Programming with Satisfiability
编程语言
2010-09-03 v1 人工智能
摘要
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.
引用
@article{arxiv.cs/0702072,
title = {Logic Programming with Satisfiability},
author = {Michael Codish and Vitaly Lagoon and Peter J. Stuckey},
journal= {arXiv preprint arXiv:cs/0702072},
year = {2010}
}
备注
8 pages, 3 figures, 1 table