QuBE: A system for deciding quantified boolean formulas satisfiability

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

Volumn 2083 LNAI, Issue , 2001, Pages 364-369

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

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867751993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_27     Document Type: Conference Paper

References (13)

1. Jussi Rintanen. Constructing conditional plans by a theorem prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
2. U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving advanced reasoning tasks using quantified boolean formulas. In Proc. AAAI, 2000.
3. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293-304, 1986.
4. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 2000. To appear. Reprinted in [13].
5. Jussi T. Rintanen. Improvements to the evaluation of quantified boolean formulae. In Dean Thomas, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol2), pages 1192-1197, S.F., July 31-August 6 1999. Morgan Kaufmann Publishers.
6. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified boolean formulae. In Proc. AAAI, 2000.
7. Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Backjumping for quantified boolean logic satisfiability. In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI'2001), 2001.
8. M. Böhm and E Speckenmeyer. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence, 17:381-400, 1996.
9. Robert G. Jeroslow and Jinchang Wang. Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence, 1:167-187, 1990.
10. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366-371, San Francisco, August 23-29 1997. Morgan Kaufmann Publishers.
11. Kleine-Büning, H. and Karpinski, M. and Flögel, A. Resolution for quantified boolean formulas. Information and computation, 117(1):12-18, 1995.
12. Ian Gent and Toby Walsh. Beyond NP: the QSAT phase transition. In Proc. AAAI, pages 648-653, 1999.
13. Ian P. Gent, Hans Van Maaren, and Toby Walsh, editors. SAT2000. Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.