Answer Set Programming based on Propositional Satisfiability (2006)
Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced in the past. All these reductions either are limited to a subclass of logic programs, or introduce new variables, or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASP-SAT, that (i) deals with any (non disjunctive) logic program, (ii) works on a propositional formula without additional variables (except for those possibly introduced by the clause form transformation), and (iii) is guaranteed to work in polynomial space. From a theoretical perspective, we prove soundness and completeness of ASP-SAT. From a practical perspective, we have (i) implemented ASP-SAT in Cmodels, (ii) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (iii) conducted an extensive comparative analysis involving also other state-of-the-art answer set solvers. The experimental analysis shows that our solver is competitive with the other solvers we considered, and that the reasoning strategies that work best on ?small but hard? problems are ineffective on ?big but easy? problems and vice versa.
View:
PDF
Citation:
Journal of Automated Reasoning, Vol. 36 (2006), pp. 345-377.
Bibtex:

Yuliya Lierler Ph.D. Alumni ylierler [at] unomaha edu