Embedding memoization to the semantic tree search for deciding QBFs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3339, Issue , 2004, Pages 681-693

  GhasemZadeh, Mohammad ^a   Klotz, Volker ^a   Meinel, Christoph ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

DPLL; QSAT; Quantified Boolean Formula (QBF); Satisfiability; Zero Suppressed Binary Decision Diagram (ZDD)

Indexed keywords

BOOLEAN ALGEBRA; DECISION THEORY; FORMAL LOGIC; PROBLEM SOLVING; SEARCH ENGINES; SEMANTICS; TREES (MATHEMATICS);

DPLL; QUANTIFIED BOOLEAN FORMULA (QBF); SATISFIABILITY (QSAT); ZERO-SUPPRESSED BINARY DECISION DIAGRAM (ZDD);

EMBEDDED SYSTEMS;

EID: 22944444198     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30549-1_59     Document Type: Conference Paper

References (21)

1. Olaf Achröer and Ingo Wegener. The Theory of Zero-Suppressed BDDs and the Number of Knight's Tours. Formal Methods in System Design, 13(3), November 1998.
2. Fadi A. Aloul, Maher N. Mneimneh, and Karem A. Sakallah. ZBDD-Based Backtrack Search SAT Solver. In International Workshop on Logic and Synthesis (IWLS), pages 131-136, New Orleans, Louisiana, 2002.
3. www.bdd-portal.org. http://www.bdd-portal.org/.
4. Jochen Bern, Christoph Meinel, and Anna Slobodová. OBDD-Based Boolean manipulation in CAD beyound current limits. In Proceedings 32nd ACM/IEEE Design Automation Conference, pages 408-413, San Francisco, CA, 1995.
5. Randal E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
6. Randal E. Bryant and Christoph Meinel. Ordererd Binary Decision Diagrams in Electronic Design Automation, chapter 11. Kluwer Academic Publishers, 2002.
7. Marco Cadoli, Marco Schaerf, Andrea Giovanardi, and Massimo Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation. Journal of Automated Reasoning, 28(2):101-142, 2002.
8. Philippe Chatalic and Laurent Simon. Multi-Resolution on Compressed Sets of Cluases. In Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00), 2000.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communication of the ACM, 5:394-397, 1962.
10. Karem A. Sakallah Fadi A. Aloul, Maher N. Mneimneh. Backtrack Search Using ZBDDs. In International Workshop on Logic and Synthesis (IWLS), page 5. University of Michigan, June 2001.
11. Rainer Feldmann, Burkhard Monien, and Stefan Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulae. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), 2000.
12. Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. In Proceedings of the International Joint Conference on Automated Reasoning, pages 364-369, 2001.
13. Reinhold Letz. Efficient Decision Procedures for Quantified Boolean Formulas. Vorlesung WS 2002/2003 TU Muenchen: Logikbasierte Entscheidungsverfahren.
14. Reinhold Letz. Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In Proceedings of TABLEAUX 2002, pages 160-175. Springer Berlin, 2002.
15. C. Meinel M. GhasemZadeh, V. Klotz. FZQSAT: A QSAT Solver for QBFs in Prenex NNF (A Useful Tool for Circuit Verification). In International Workshop on Logic and Synthesis (IWLS), pages 135-142. California, USA, June 2004.
16. Christoph Meinel and Thorsten Theobald. Algorithms and Data Structures in VLSI Design. Springer, 1998.
17. S. Minato. Zero-suppressed BDDs for set Manipulation in Combinatorial Problems. In proceedings of the 30th ACM/IEEE Design Automation Conference, 1993.
18. Alan Mishchenko. An Introduction to Zero-Suppressed Binary Decision Diagrams. http://www.ee.pdx.edu/alanmi/research/dd/zddtut.pdf, June 2001.
19. QBFLIB - Quantified Boolean Formulas Satisfiability Library. http://www.mrg.dist.unige.it/qube/qbflib/.
20. Jussi Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 1192-1197, 1999.
21. Ingo Wegener. Branching Programs and Binary Decision Diagrams - Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications, 2000.