GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
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
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
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
Bounded Model Construction for Monadic Second-Order Logics
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
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
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
SAT-based planning in complex domains: concurrency, constraints and nondeterminism
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Answer set programming with clause learning
Answer set programming with clause learning
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A backjumping technique for disjunctive logic programming
AI Communications
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A model for generating random quantified boolean formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
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 relation among answer set solvers
Annals of Mathematics and Artificial Intelligence
A 25-year perspective on logic programming
The disjunctive datalog system DLV
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
Hi-index | 0.00 |
DLV is the state-of-the-art system for evaluating disjunctive answer set programs. As in most Answer Set Programming (ASP) systems, its implementation is divided in a grounding part and a propositional model-finding part. In this paper, we focus on the latter, which relies on an algorithm using backtracking search. Recently, DLV has been enhanced with backjumping techniques, which also involve a reason calculus, recording causes for the truth or falsity of atoms during the search. This reason calculus allows for looking back in the search process for identifying areas in the search space in which no answer set will be found. We can also define heuristics which make use of the information about reasons, preferring literals that were the reasons of more inconsistent branches of the search tree. This heuristics thus use information gathered earlier in the computation, and are therefore referred to as look-back heuristics. In this paper, we formulate suitable look-back heuristics and focus on the experimental evaluation of the look-back techniques that we have implemented in DLV, obtaining the system DLV^L^B. We have conducted a thorough experimental analysis considering both randomly-generated and structured instances of the 2QBF problem, the canonical problem for the complexity classes @S"2^P and @P"2^P. Any problem in these classes can be expressed uniformly using ASP and can therefore be solved by DLV. We have also evaluated the same benchmark using ''native'' QBF solvers, which were among the best solvers in recent QBF Evaluations. The comparison shows that DLV endowed with look-back techniques is competitive with the best available QBF solvers on such instances.