Heuristics for hard ASP programs

Authors:
Wolfgang Faber;Nicola Leone;Francesco Ricca
Affiliations:
Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy
Venue:
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Year:
2005

Citing 10
Cited 2

Disjunctive datalog

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
Answer set planning

Proceedings of the 1999 international conference on Logic programming
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
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
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
Enhancing disjunctive logic programming systems by SAT checkers

Artificial Intelligence
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
Experimenting with heuristics for answer set programming

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Resolve and expand

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

The DLV Project: A Tour from Theory and Research to Applications and Market

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the complexity of answer set programming with aggregates

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a new heuristic hDS for ASP, and implement it in the (disjunctive) ASP system DLV. The new heuristic improves the evaluation of Σ2P/Π2P - hard ASP programs while maintaining the benign behaviour of the well-assessed heuristic of DLV on NP problems. We experiment with the new heuristic on QBFs. hDS significantly outperforms the heuristic of DLV on hard 2QBF problems. We compare also the DLV system (with the new heuristic hDS) to three prominent QBF solvers. The results of the comparison, performed on instances used in the last QBF competition, indicate that ASP systems can be faster than QBF systems on Σ2P/Π2P-hard problems.