Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae

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

Volumn 2250, Issue , 2001, Pages 362-376

  Rintanen, Jussi ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BOOLEAN ALGEBRA; FORMAL LOGIC;

EXPONENTIAL BEHAVIORS; EXPONENTIAL TIME; ITS EFFICIENCIES; PROPAGATION ALGORITHM; PROPOSITIONAL FORMULAS; PROPOSITIONAL LOGIC; QUANTIFIED BOOLEAN FORMULAS; UNIT RESOLUTIONS;

BOOLEAN FUNCTIONS;

EID: 84937404140     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45653-8_25     Document Type: Conference Paper

References (22)

1. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A linear time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, 8(3):121-123, 1979.
2. Erratum in 14(4):195, June 1982.
3. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
4. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified Boolean formulae. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and the Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 262-267. AAAI Press, July 1998.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
6. Rainer Feldmann, Burkhard Monien, and Stefan Schamberger. A distributed algorithm to evaluate quantified Boolean formulae. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000) and the Twelfth Conference on Innovative Applications of Artificial Intelligence (IAAI-2000), pages 285-290. AAAI Press, 2000.
7. Ian Gent and Toby Walsh. Beyond NP: the QSAT phase transition. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) and the Eleventh Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 648-653. AAAI Press/The MIT Press, 1999.
8. Matthew L. Ginsberg and Andrew J. Parkes. Satisfiability algorithms and finite quantification. In Anthony G. Cohn, Fausto Giunchiglia, and Bart Selman, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Seventh International Conference (KR2000), pages 690-701. Morgan Kaufmann Publishers, 2000.
9. ∗AI 2001: Advances in Artificial Intelligence. 7th Congress of the Italian Association for Artificial Intelligence, Proceedings, number 2175 in Lecture Notes in Computer Science, pages 111-122. Springer-Verlag, 2001.
10. Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pages 1194-1201, Menlo Park, California, August 1996. AAAI Press.
11. Hans Kleine Büning, Marek Karpinski, and Andreas Flögel. Resolution for quantified Boolean formulas. Information and Computation, 117:12-18, 1995.
12. Reinhold Letz. Advances in decision procedures for quantified Boolean formulas. working notes of the IJCAR 2001 workshop on Theory and Applications of Quantified Boolean Formulas, 2001.
13. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 366-371, Nagoya, Japan, August 1997.
14. Michael L. Littman. Initial experiments in stochastic satisfiability. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) and the Eleventh Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 667-672. AAAI Press/The MIT Press, 1999.
15. Antonio Lozano and José L. Balcázar. The complexity of graph problems for succinctly represented graphs. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG'89, number 411 in Lecture Notes in Computer Science, pages 277-286, Castle Rolduc, The Netherlands, 1990. Springer-Verlag.
16. Christos H. Papadimitriou and Mihalis Yannakakis. A note on succinct representations of graphs. Information and Control, 71:181-185, 1986.
17. David A. Plaisted, Armin Biere, and Yunshan Zhu. A satisfiability procedure for quantified Boolean formulae, 2001. unpublished.
18. Patrick Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
19. Jussi Rintanen. A planning algorithm not based on directional search. In A. G. Cohn, L. K. Schubert, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), pages 617-624. Morgan Kaufmann Publishers, June 1998.
20. Jussi Rintanen. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research, 10:323-352, 1999.
21. Jussi Rintanen. Improvements to the evaluation of quantified Boolean formulae. In Thomas Dean, editor, Proceedings of the 16th International Joint Conference on Artificial Intelligence, pages 1192-1197. Morgan Kaufmann Publishers, August 1999.
22. Roberto Sebastiani. Personal communication, Breckenridge, Colorado, April 2000.