An analysis of backjumping and trivial truth in quantified boolean formulas satisfiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2175, Issue , 2001, Pages 111-122

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

^a UNIVERSITY OF GENOA   (Italy)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; PHILOSOPHICAL ASPECTS;

OPTIMIZATION TECHNIQUES; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; REAL-WORLD TESTS; SATISFIABILITY; SEARCH TREES;

BOOLEAN FUNCTIONS;

EID: 0001711687     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45411-x_13     Document Type: Conference Paper

References (12)

1. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified Boolean formulae. In Proc. of AAAI, 1998.
2. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
3. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. In Proc. of IJCAI, 2001. To appear.
4. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: a system for Deciding Quantified Boolean Formulas Satisfiability. In Proc. of IJCAR, 2001.
5. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulae. In Proc. of AAAI, 2000.
6. Ian Gent and Toby Walsh. Beyond NP: the QSAT phase transition. In Proc. of AAAI, pages 648–653, 1999.
7. J. T. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. of IJCAI, pages 1192–1197, 1999.
8. H. Kleine-Büning and M. Karpinski and A. Flögel. Resolution for quantified Boolean formulas. Information and Computation, 117(1):12–18, 1995.
9. D. A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293–304, 1986.
10. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. In Proc. of IJCAR, LNCS. Springer Verlag, 2001. To appear.
11. M. Buro and H. Kleine-Büning. Report on a SAT competition. Technical Report 110, University of Paderborn, November 1992.
12. D. S. Moore and G. P. McCabe. Introduction to the Practice of Statistics. W. H. Freeman and Co., 1993.