BDD-based decision procedures for the modal logic K*

Journal of Applied Non-Classical Logics

Volumn 16, Issue 1-2, 2006, Pages 169-207

  Pan, Guoqiang ^a   Sattler, Ulrike ^b   Vardi, Moshe Y ^a  

^a Rice University   (United States)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Binary decision diagram; Modal logic

Indexed keywords

EID: 35448976856     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.16.169-207     Document Type: Article

References (58)

1. [And 98] Andersen H., "An Introduction To Binary Decision Diagrams", Report, 1998, Department Of Information Technology, Technical University Of Denmark.
2. [Are 00] Areces C., Gennari R., Heguiabehere J., De Rijke M., "Tree-Based Heuristics In Modal Theorem Proving", Proc. Of The 14Th Eur. Conf. On Artif. Int., 2000, P. 199-203.
3. [Baa 01] Baader F., Tobies S., "The Inverse Method Implements The Automata Approach For Modal Satisfiability", Proc. 1St Int. Joint Conf. Automated Reasoning, Vol. 2083 Of Lncs, Springer-Verlag, 2001, P. 92-106. (Pubitemid 33291417)
4. [Bee 94] Beer I., Ben-David S., Geist D., Gewirtzman R., Yoeli M., "Methodology And System For Practical Formal Verification Of Reactive Hardware", Proc. 6Th Conf. On Cav, Vol. 818 Of Lncs, Stanford, June 1994, P. 182-193.
5. [Bie 99] Biere A., Cimatti A., Clarke E., Zhu Y., "Symbolic Model Checking Without Bdds", Tools And Algorithms For The Analysis And Construction Of Systems, Vol. 1579 Of Lecture Notes In Computer Science, Springer-Verlag, 1999.
6. [Bie 04] Biere A., "Resolve And Expand", Proc. 7Th Int. Conf. On Theory And Applications Of Satisfiability Testing (Sat 2004), 2004, P. 238-246.
7. [Bla 01] Blackburn P., De Rijke M., Venema Y., Modal Logic, Camb. Univ. Press, 2001.
8. [Boc 82] Bochmann G. V., "Hardware Specification With Temporal Logic: An Example", Ieee Transactions On Computers, Vol. C-31, 1982, P. 223-231.
9. [Bra 94] Brafman R., Latombe J.-C., Moses Y., Shoham Y., "Knowledge As A Tool In Motion Planning Under Uncertainty", Fagin R., Ed., Theoretical Aspects Of Reasoning About Knowledge: Proc. Fifth Conference, P. 208-224, Morgan Kaufmann, San Francisco, Calif., 1994.
10. [Bry 86] Bryant R., "Graph-Based Algorithms For Boolean Function Manipulation", Ieee Trans. On Comp., Vol. Vol. C-35, Num. 8, 1986, P. 677-691. (Pubitemid 16629996)
11. [Bun 95] Buning H., Karpinski M., Flogel A., "Resolution For Quantified Boolean Formulas", Inf. And Comp., Vol. 117(1), 1995, P. 12-18.
12. [Bur 88] Burrows M., Abadi M., Needham R., "Authentication: A Practical Study In Belief And Action", Proc. 2Nd Conference On Theoretical Aspects Of Reasoning About Knowledge, 1988, P. 325-342.
13. [Bur 91] Burch J. R., Clarke E. M., Long D. E., "Symbolicmodel Checking With Partitioned Transition Relations", Vlsi 91, Proc. Ifip Tc10/Wg 10.5 International Conference On Very Large Scale Integration, Edinburgh, Scotland, 20-22 August, 1991, 1991, P. 49-58.
14. [Bur 92] Burch J., Clarke E., Mcmillan K., Dill D., Hwang L., "Symbolic Model Checking: 1020 States And Beyond", Information And Computation, Vol. 98, Num. 2, 1992, P. 142-170.
15. [Cad 99] Cadoli M., Schaerf M., Giovanardi A., Giovanardi M., "An Algorithm To Evaluate Quantified Boolean Formulae And Its Experimental Evaluation", Report, 1999, Dipartmento Di Imformatica E Sistemistica, Universita De Roma.
16. [Cas 82] Castilho J. M. V., Casanova M. A., Furtado A. L., "A Temporal Framework For Database Specification", Proc. 8Th Int. Conf. On Very Large Data Bases, 1982, P. 280-291.
17. [Cim 00] Cimatti A., Clarke E., Giunchiglia F., Roveri M., "Nusmv: A New Symbolic Model Checker", Int. J. On Software Tools For Tech. Transfer, Vol. 2, Num. 4, 2000, P. 410-425.
18. [Cla 86] Clarke E., Emerson E., Sistla A., "Automatic Verification Of Finite-State Concurrent Systems Using Temporal Logic Specifications", Acm Transactions On Programming Languages And Systems, Vol. 8, Num. 2, 1986, P. 244-263. (Pubitemid 16633197)
19. [Coa 00] Coarfa C., Demopoulos D., San Miguel Aguirre A., Subramanian D., Vardi M., "Random 3-Sat: The Plot Thickens", Proc. Of The Int. Conf. On Constraint Prog. (Cp 2000), 2000, P. 143-159.
20. [Dav 60] Davis S., Putnam M., "A Computing Procedure For Quantification Theory", J. Acm, Vol. 7, 1960, P. 201-215.
21. [Dav 62] Davis M., Logemann G., Loveland D., "A Machine Program For Theorem Proving", Journal Of The Acm, Vol. 5, 1962, P. 394-397.
22. [Ete 00] Etessami K., Holzmann G., "Optimizing Bü;Chi Automata", Concur 2000-Concurrency Theory, 11Th Int. Conf., 2000, P. 153-167.
23. [Gei 94] Geist D., Beer H., "Efficient Model Checking By Automated Ordering Of Transition Relation Partitions", Proc. 6Th Int. Conf. On Computer Aided Verification (Cav 1994), 1994, P. 299-310.
24. [Gen 99] Gent I., Walsh T., "Beyond Np: The Qsat Phase Transition", Aaai: 16Th National Conference On Artificial Intelligence, Aaai /Mit Press, 1999, P. 648-653.
25. [Giu 00] Giunchiglia F., Sebastiani R., "Building Decision Procedures For Modal Logics From Propositional Decision Procedure-The Case Study Of Modal K(M)", Inf. And Comp., Vol. 162, 2000, P. 158-178.
26. [Giu 01] Giunchiglia E., Narizzano M., Tacchella A., "Qube, A System For Deciding Quantified Boolean Formulae Satisfiability", Automated Reasoning, First Int. Joint Conf., Ijcar 2001, 2001, P. 364-369. (Pubitemid 33291436)
27. [Haa 01] Haarslev V., Mö;Ller R., "High Performance Reasoning With Very Large Knowledge Bases: A Practical Case Study", Nebel B., Ed., Proceedings Of The Seventeenth International Joint Conference On Artificial Intelligence (Ijcai-01), Vol. 1847, Morgan Kaufmann, Los Altos, 2001.
28. [Hal 90] Halpern J. Y., Moses Y., "Knowledge And Common Knowledge In A Distributed Environment", Journal Of The Acm, Vol. 37, Num. 3, 1990, P. 549-587, A Preliminary Version Appeared In Proc. 3Rd Acm Symposium On Principles Of Distributed Computing, 1984. (Pubitemid 20723069)
29. [Hal 92] Halpern J., Moses Y., "A Guide To Completeness And Complexity Formodal Logics Of Knowledge And Belief", Artificial Intelligence, Vol. 54, 1992, P. 319-379.
30. [Heu 96] Heuerding A., Schwendimann S., "A Benchmark Method For The Propositional Modal Logics K, Kt, S4", Report, 1996, Universitä;T Bern, Switzerland.
31. [Hor 00] Horrocks I., Sattler U., Tobies S., "Practical Reasoning For Very Expressive Description Logics", Logic Journal Of The Igpl, Vol. 8, Num. 3, 2000, P. 239-264.
32. [Hus 00] Hustadt U., Schmidt R., "Mspass: Modal Reasoning By Translation And First Order Resolution", Automated Reasoning With Analytic Tableaux And Related Methods, Int. Conf., Tableaux 2000, 2000, P. 67-71.
33. [Kam 98A] Kamhi G., Fix L., "Adaptive Variable Reordering For Symbolic Model Checking", International Conference On Computer-Aided Design (Iccad 1998), 1998, P. 359-365.
34. [Kam 98B] Kamhi G., Fix L., Binyamini Z., "Symbolic Model Checking Visualization", Formal Methods In Computer-Aided Design, Second International Conference Fmcad'98, Vol. 1522 Of Lncs, Springer-Verlag, November 1998, P. 290-303. (Pubitemid 128161786)
35. [Lad 77] Ladner R., "The Computational Complexity Of Provability In Systems Of Modal Propositional Logic", Siam J. Comput., Vol. 6, Num. 3, 1977, P. 467-480.
36. [Let 02] Letz R., "Lemma And Model Caching In Decision Procedures For Quantified Boolean Formulas", Tableaux 2002, 2002, P. 160-175.
37. [Lip 77] Lipski W., "On The Logic Of Incomplete Information", Proc. 6Th International Symposium On Mathematical Foundations Of Computer Science, Lecture Notes In Computer Science, Vol. 53, P. 374-381, Springer-Verlag, Berlin/New York, 1977.
38. [Mas 00] Massacci F., Donini F., "Design And Results Of Tancs-2000", Automated Reasoning With Analytic Tableaux And Related Methods, Int. Conf., Tableaux 2000, 2000, P. 52-56.
39. [Mcc 69] Mccarthy J., Hayes P. J., "Some Philosophical Problems From The Standpoint Of Artificial Intelligence", Michie D., Ed.,Machine Intelligence 4, P. 463-502, Edinburgh University Press, Edinburgh, 1969.
40. [Pan 04] Pan G., Vardi M. Y., "Symbolic Decision Procedures For Qbf", Proceedings Of 10Th Int. Conf. On Principles And Practice Of Constraint Programming (Cp 2004), 2004, P. 453-467.
41. [Pat 99] Patel-Schneider P., Horrocks I., "Dlp And Fact", Automated Reasoning With Analytic Tableaux And Related Methods, Int. Conf., Tableaux '99, 1999, P. 19-23.
42. [Pat 01] Patel-Schneider P., Sebastiani R., "A New System And Methodology For Generating Random Modal Formulae", Automated Reasoning, First Int. Joint Conf., Ijcar 2001, 2001, P. 464-468. (Pubitemid 33291449)
43. [Pnu 77] Pnueli A., "The Temporal Logic Of Programs", Proc. 18Th Ieee Symp. On Foundation Of Computer Science, 1977, P. 46-57.
44. [Pra 76] Pratt V. R., "Semantical Considerations On Floyd-Hoare Logic", Proc. 17Th Ieee Symp. On Foundations Of Computer Science, 1976, P. 109-121.
45. [Pra 80] Pratt V., "A Near-Optimal Method For Reasoning About Action", Journal Of Computer And System Sciences, Vol. 20, Num. 2, 1980, P. 231-254.
46. [Ran 95] Ranjan R., Aziz A., Brayton R., Plessier B., Pixley C., "Efficient Bdd Algorithms For Fsm Synthesis And Verification", Proc. Of Ieee/Acm Int. Workshop On Logic Synthesis, 1995.
47. [Rei 83] Reif J. H., Sistla A. P., "A Multiprocessor Network Logic With Temporal And Spatial Modalities", Proc. 12Th International Colloq. On Automata, Languages, And Programming, Lecture Notes In Computer Science, Vol. 104, P. 629-639, Springer-Verlag, Berlin/New York, 1983.
48. [Rin 99] Rintanen J., "Constructing Conditional Plans By A Theorem-Prover", J. Of A. I. Res., Vol. 10, 1999, P. 323-352. (Pubitemid 30573906)
49. [Rud 93] Rudell R., "Dynamic Variable Ordering For Ordered Binary Decision Diagrams", International Conference On Computer-Aided Design (Iccad 1993), 1993, P. 42-47.
50. [San 01] San Miguel Aguirre A., Vardi M., "Random 3-Sat And Bdds: The Plot Thickens Further", Principles And Practice Of Constraint Programming-Cp 2001, 7Th Int. Conf., 2001, P. 121-136. (Pubitemid 33371071)
51. [Sel 96] Selman B., Mitchell D. G., Levesque H. J., "Generating Hard Satisfiability Problems", Artificial Intelligence, Vol. 81, Num. 1-2, 1996, P. 17-29. (Pubitemid 126349547)
52. [Som 98] Somenzi F., "Cudd: Cu Decision Diagram Package", http://Vlsi.Colorado.Edu/?Fabio/Cudd/, 1998.
53. [Som 00] Somenzi F., Bloem R., "Efficient Bü;Chi Automata From Ltl Formulae", Computer Aided Verification, 12Th Int. Conf., Cav 2000, 2000, P. 247-263.
54. [Sto 77] Stockmeyer L., "The Polynomial-Time Hierarchy", Theo. Comp. Sci., Vol. 3, 1977, P. 1-22.
55. [Tac 99] Tacchella A., " Sat System Description", Proceedings Of The Intl. Workshop Description Logics 1999, Ceur Workshop Proceedings, 1999.
56. [Tan 93] Tani S., Hamaguchi K., Yajima S., "The Complexity Of The Optimal Variable Ordering Problems Of Shared Binary Decision Diagrams", Algorithms And Computation, 4Th International Symposium, Isaac '93, 1993, P. 389-398.
57. [Var 97] Vardi M., "What Makes Modal Logic So Robustly Decidable?", Immerman N., Kolaitis P., Eds., Descriptive Complexity And Finite Models, P. 149-183, Ams, 1997.
58. [Vor 01] Voronkov A., "How To Optimize Proof-Search In Modal Logics: New Methods Of Proving Redundancy Criteria For Sequent Calculi", Comp. Logic, Vol. 2, Num. 2, 2001, P. 182-215.