Backjumping for quantified Boolean logic satisfiability

Artificial Intelligence

Volumn 145, Issue 1-2, 2003, Pages 99-120

  Giunchiglia, Enrico ^a   Narizzano, Massimo ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Automated reasoning; Quantified Boolean Logic; Satisfiability testing

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; DECISION MAKING; HEURISTIC METHODS;

QUANTIFIED BOOLEAN FORMULAS (QBF);

ARTIFICIAL INTELLIGENCE;

EID: 0037380443     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00373-9     Document Type: Article

References (23)

1. Giunchiglia E., Narizzano M., Tacchella A. Backjumping for quantified boolean logic satisfiability. Nebel B. Proc. IJCAI-01, Seattle, WA. 2001;275-281 Morgan Kaufmann, San Francisco, CA.
2. Kleine-Büning H., Karpinski M., Flögel A. Resolution for quantified boolean formulas. Inform. and Comput. 117:(1):1995;12-18.
3. Cadoli M., Giovanardi A., Schaerf M. An algorithm to evaluate quantified boolean formulae. Proc. AAAI-98/IAAI-98, Madison, WI. 1998;262-267 AAAI Press, Menlo Park, CA.
4. Cadoli M., Schaerf M., Giovanardi A., Giovanardi M. An algorithm to evaluate quantified boolean formulae and its experimental evaluation. J. Automat. Reason. 28:2002;101-142.
5. Rintanen J. Improvements to the evaluation of quantified boolean formulae. Thomas D. Proc. IJCAI-99, Stockholm, Sweden, Vol. 2. 1999;1192-1197 Morgan Kaufmann, San Francisco, CA.
6. Egly U., Eiter T., Tompits H., Woltran S. Solving advanced reasoning tasks using quantified boolean formulas. Proc. AAAI-00/IAAI-00, Austin, TX. 2000;417-422 AAAI Press, Menlo Park, CA.
7. Feldmann R., Monien B., Schamberger S. A distributed algorithm to evaluate quantified boolean formulae. Proc. AAAI-00/IAAI-00, Austin, TX. 2000;285-290 AAAI Press, Menlo Park, CA.
8. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:(7):1962;394-397.
9. Prosser P. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence. 9:(3):1993;268-299.
10. Bayardo R.J. Jr., Schrag R.C. Using CSP look-back techniques to solve real-world SAT instances. Proc. AAAI-97/IAAI-97, Providence, RI. 1997;203-208 AAAI Press, Menlo Park, CA.
11. Giunchiglia E., Maratea M., Tacchella A., Zambonin D. Evaluating search heuristics and optimization techniques in propositional satisfiability. Proc. International Joint Conference on Automated Reasoning (IJCAR'2001). Lecture Notes in Artificial Intelligence. 2083:2001;347-363 Springer, Berlin.
12. Giunchiglia E., Narizzano M., Tacchella A. QUBE: A system for deciding quantified boolean formulas satisfiability. Proc. International Joint Conference on Automated Reasoning (IJCAR'2001). Lecture Notes in Artificial Intelligence. 2083:2001;364-369 Springer, Berlin. QUBE is available at http://www.mrg.dist.unige.it/star/qube.
13. M. Buro, H. Buning, Report on a SAT competition, Technical Report 110, University of Paderborn, Germany, November, 1992.
14. Böhm M., Speckenmeyer E. A fast parallel SAT-solver - Efficient workload balancing. Ann. Math. Artificial Intelligence. 17:1996;381-400.
15. J.W. Freeman, Improvements to propositional satisfiability search algorithms, Ph.D. Thesis, University of Pennsylvania, Philadelphia, PA, 1995.
16. Gent I., Walsh T. Beyond NP: The QSAT phase transition. Proc. AAAI-99/IAAI-99, Orlando, FL. 1999;648-653 AAAI/MIT Press, Menlo Park, CA.
17. Rintanen J. Constructing conditional plans by a theorem prover. J. Artificial Intelligence Res. 10:1999;323-352.
18. Abdelwaheb A., Basin D. Bounded model construction for monadic second-order logics. Proc. 12th International Conference on Computer-Aided Verification (CAV'00), Chicago, IL. Lecture Notes in Computer Science. 1855:2000;99-113 Springer, Berlin.
19. Prosser P. Domain filtering can degrade intelligent backjumping search. Proc. IJCAI-93, Chambéry, France. 1993;262-267.
20. Giunchiglia E., Narizzano M., Tacchella A. Learning for quantified boolean logic satisfiability. Proc. AAAI-02, Edmonton, AB. 2002;649-654.
21. Giunchiglia E., Narizzano M., Tacchella A. An analysis of backjumping and trivial truth in quantified boolean formulas satisfiability. Proc. AI*IA 2001: Advances in Artificial Intelligence (AI*IA'2001). Lecture Notes in Artificial Intelligence. 2175:2001;111-122 Springer, Berlin.
22. Kondrak G., van Beek P. A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence. 89 (1-2):1989;365-387.
23. Chen X., van Beek P. Conflict-directed backjumping revisited. J. Artificial Intelligence Res. 14:2001;53-81.