The complexity of logic-based abduction
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
ACM Transactions on Database Systems (TODS)
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Proceedings of the 1999 international conference on Logic programming
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Pushing Goal Derivation in DLP Computations
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae
AI*IA '97 Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Enhancing disjunctive logic programming systems by SAT checkers
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)
Improvements to the evaluation of quantified boolean formulae
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On look-ahead heuristics in disjunctive logic programming
Annals of Mathematics and Artificial Intelligence
Experimenting with look-back heuristics for hard ASP programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
Experiments with reduction finding
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
Recent research on answer set programming (ASP) systems, has mainly focused on solving NP problems more efficiently. Yet, disjunctive logic programs allow for expressing every problem in the complexity classes and . These classes are widely believed to be strictly larger than NP, and several important AI problems, like conformant and conditional planning, diagnosis and more are located in this class. In this paper we focus on improving the evaluation of -hard ASP programs. To this end, we define a new heuristic hDS and implement it in the (disjunctive) ASP system DLV. The definition of hDS is geared towards the peculiarites of hard programs, while it maintains the benign behaviour of the well-assessed heuristic of DLV for NP problems. We have conducted extensive experiments with the new heuristic. hDS significantly outperforms the previous heuristic of DLV on hard 2QBF problems. We also compare the DLV system (with hDS) to the QBF solvers SSolve, Quantor, Semprop, and yQuaffle, which performed best in the QBF evaluation of 2004. The results of the comparison indicate that ASP systems currently seem to be the best choice for solving /-complete problems.