Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
A machine program for theorem-proving
Communications of the ACM
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Solving Optimization Problems with DLL
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Advanced conflict-driven disjunctive answer set solving
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Stable Model Checking (MC) in Answer Set Programming systems is, in general, a co-NP task for disjunctive programs. Thus, implementing an efficient strategy is very important for the performance of ASP systems. In DLV, MC is carried out by exploiting the SAT solver SATZ, and the result of this operation also returns (in case the check fails) an "unfounded set", as by-product, which is also used for pruning the search space during answer set computation. In this paper we report on the integration of a "modern" SAT solver, MINISAT, in DLV. The integration poses not only technological issues, but also challenges w.r.t. the "quality" of the returned unfounded set and w.r.t. the interplay with the existing DLV techniques.