Optimizing a BDD-based modal solver

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

Volumn 2741, Issue , 2003, Pages 75-89

  Pan, Guoqiang ^a   Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; THEOREM PROVING; ALGORITHMS; BENCHMARKING; COMPUTER SCIENCE; MODAL ANALYSIS; OPTIMIZATION;

MODAL LOGIC; OPTIMIZED SOLVERS; SATISFIABILITY SOLVERS; SEARCH-BASED; VARIABLE ORDER; BDD PACKAGE; BDD-BASED MODAL SOLVERS; TRANSLATION-BASED SOLVERS; VARIABLE ORDERING;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY;

EID: 1642581004     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_7     Document Type: Conference Paper

References (37)

1. C. Areces, R. Gennari, J. Heguiabehere and M. de Rijke. Tree-based heuristics in modal theorem proving. In Proc. of the ECAI’2000, 2000.
2. F. Baader and S. Tobies. The inverse method implements the automata approach for modal satisfiability. In Proc. of IJCAR’01, volume 2083 of LNAI, pages 92-106.
3. P. Blackburn, M. de Rijke, and Y. Venema. Modal logic. Camb. Univ. Press, 2001.
4. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. on Comp., Vol. C-35(8):677-691, August 1986.
5. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Technical report, Dipartmento di Imformatica e Sistemistica, Universita de Roma, 1999.
6. C. Coarfa, D. D. Demopoulos, A. San Miguel Aguirre, D. Subramanian, and M. Y. Vardi. Random 3-SAT: The plot thickens. In Proc. of the Int. Conf. on Constraint Prog., 2000.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5:394-397, 1962.
8. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In CONCUR 2000, pages 153-167, 2000.
9. I. Gent and T. Walsh. Beyond NP: The QSAT phase transition. In AAAI: 16th National Conference on Artificial Intelligence. AAAI/MIT Press, 1999.
10. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedure-the case study of modal K(m). Inf. and Comp., 162:158-178, 2000.
11. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik. Partition-based decision heuristics for image computation using SAT and BDDs. In ICCAD, pages 286-292, 2001.
12. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
13. A. Heuerding and S. Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Technical report, Universität Bern, Switzerland, 1996.
14. U. Hustadt and R. Schmidt. MSPASS: modal reasoning by translation and first order resolution. In Proc. of TABLEAUX 2000, pages 67-71, 2000.
15. G. Kamhi and L. Fix. Adaptive variable reordering for symbolic model checking. In ICCAD 1998, pages 359-365, 1998.
16. R. E. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput., 6(3):467-480, 1977.
17. R. Letz. Lemma and model caching in decision procedures for quantified Boolean formulas. In TABLEAUX 2002, volume 2381 of LNAI, pages 160-175, 2002.
18. F. Massacci and F. M. Donini. Design and results of TANCS-2000. In Proc. of TABLEAUX 2000, pages 52-56, 2000.
19. H. J. Ohlbach, A. Nonnengart, M. de Rijke, and D. M. Gabbay. Encoding two-valued nonclassical logics in classical logic. In Handbook of Automated Reasoning. Elsevier, 1999.
20. G. Pan. BDD-based decision procedures for modal logic K, Master’s Thesis, Rice University, 2002.
21. G. Pan, U. Sattler, and M. Y. Vardi. BDD-based decision procedures for K. In Proc. of CADE 2002, volume 2392 of LNAI, pages 16-30, 2002.
22. P. F. Patel-Schneider and I. Horrocks. DLP and FaCT. In Analytic Tableaux and Related Methods, pages 19-23, 1999.
23. P. F. Patel-Schneider and R. Sebastiani. Anewsystem and methodology for generating random modal formulae. In IJCAR 2001, pages 464-468, 2001.
24. V. R. Pratt. A near-optimal method for reasoning about action. Journal of Computer and System Sciences, 20(2):231-254, 1980.
25. J. Rintanen. Constructing conditional plans by a theorem-prover. J. of A. I. Res., 10:323-352, 1999.
26. R. Rudell. Dynamic variable ordering for ordered binary decision diagrams. In ICCAD’93, pages 42-47, 1993.
27. A. San Miguel Aguirre and M. Y. Vardi. Random 3-SAT and BDDs: The plot thickens further. In CP01, 2001.
28. R. A. Schmidt. Optimised Modal Translation and Resolution. PhD thesis, Universität des Saarlandes, Saarbrücken, Germany, 1997.
29. B. Selman, D. G. Mitchell, and H. J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996.
30. F. Somenzi and R. Bloem. Efficient Büchi automata from LTL formulae. In CAV 2000, pages 247-263, 2000.
31. L. J. Stockmeyer. The polynomial-time hierarchy. Theo. Comp. Sci., 3:1-22, 1977.
32. G. Sutcliffe and C. Suttner. Evaluating general purpose automated theorem proving systems. Artificial intelligence, 131:39-54, 2001.
33. A. Tacchella. *SAT system description. In Collected Papers from (DL’99). CEUR, 1999.
34. S. Tani, K. Hamaguchi, and S. Yajima. The complexity of the optimal variable ordering problems of shared binary decision diagrams. In ISAAC, 1993.
35. J. van Benthem. Modal Logic and Classical Logic. Bibliopolis, 1983.
36. M. Y. Vardi. What makes modal logic so robustly decidable? In N. Immerman and Ph. G. Kolaitis, editors, Descriptive Complexity and Finite Models, pages 149-183. AMS, 1997.
37. A. Voronkov. How to optimize proof-search in modal logics: new methods of proving redundancy criteria for sequent calculi. Comp. Logic, 2(2):182-215, 2001.