Disjunctive Answer Set Programming via Satisfiability (2005)
Using SAT solvers as inference engines in answer set programming systems showed to be a promising approach in building efficient systems. Nowadays SAT based answer set programming systems successfully work with nondisjunctive programs. This paper proposes a way to use SAT solvers for finding answer sets for disjunctive logic programs. We implement two different ways of SAT solver invocation used in nondisjunctive answer set programming. The algorithms are based on the definition of completion for disjunctive programs and the extension of loop formula to the disjunctive case. We propose the necessary modifications to the algorithms known for nondisjunctive programs in order to adapt them to the disjunctive case and demonstrate their implementation based on system Cmodels.
View:
PDF
Citation:
In 3rd Intl. Workshop on Answer Set Programming: Advances in Theory and Implementation 2005.
Bibtex:

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