How to Optimize Proof-Search in Modal Logics: New Methods of Proving Redundancy Criteria for Sequent Calculi

ACM Transactions on Computational Logic

Volumn 2, Issue 2, 2001, Pages 182-215

  Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Description logics; Experimentation; inverse method; modal logic; proof search; theorem proving; Theory

Indexed keywords

EID: 1642540462     PISSN: 15293785     EISSN: 1557945x     Source Type: Journal    
DOI: 10.1145/371316.371511     Document Type: Article

References (39)

1. Baader, F. and Hollunder, B. 1991. A terminological knowledge representation system with complete inference algorithms. In PDK'91, H. Boley and M. Richter, Eds. Lecture Notes in Artificial Intelligence, vol. 567. Springer Verlag, 67-86.
2. Bachmair, L. and Ganzinger, H. 2000. Resolution Theorem Proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier Science and MIT Press. To appear.
3. Balsiger, P., Heuerding, A., and Schwendimann, S. 1998. Logics Workbench 1.0. In Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABleaux'98, H. de Swart, Ed. Lecture Notes in Artificial Intelligence, vol. 1397. Springer Verlag, oisterwijk, The Netherlands, 35.
4. Calvanese, D., De Giacomo, G., Lenzerini, M., and Nardi, D. 2000. Reasoning in expressive description logics. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier Science and MIT Press. To appear.
5. CATACH, L. 1991. Tableaux: a general theorem prover for modal logics. Journal of Automated Reasoning 7, 4, 489-510.
6. Degtyarev, A. and Voronkov, A. 1996. Equality elimination for the tableau method. In Design and Implementation of Symbolic Computation Systems. International Symposium, DISCO'96, J. Calmet and C. Limongelli, Eds. Lecture Notesin Computer Science, vol. 1128. Springer Verlag, Karlsruhe, Germany, 46-60.
7. Fitting, M. 1983. Proof methods for modal and intuitionistic logics. Synthese Library, vol. 169. Reidel Publ. Comp.
8. Gentzen, G. 1934. Untersuchungen uber das logische SchlieBen. Mathematical Zeitschrift 39, 176-210, 405-431. Translated as [Gentzen 1969].
9. Gentzen, G. 1969. Investigations into logical deduction. In The Collected Papers of Gerhard Gentzen, M. Szabo, Ed. North Holland, Amsterdam, 68-131. Originally appeared as [Gentzen 1934].
10. Giunchiglia, E., Giunchiglia, F., and Tacchella, A. 1999. SAT-based decision procedures for classical modal logics. Journal of Automated Reasoning. To appear in the Special Issues: Satisfiability at the start of the year 2000 (SAT 2000).
11. Giunchiglia, E., Giunchiglia, F., Sebastiani, R., and Tacchella, A. 1998. More evaluation of decision procedures for modal logics. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference(KR'98), A. Cohn, L. Schubert, and S. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 626-635.
12. Giunchiglia, F. and Sebastiani, R. 1996A. Building decision procedures for modal logics from propositional decision procedures: Case study of modal K. In CADE-13, M. McRobbie and J. Slaney, Eds. Lecture Notes in Artificial Intelligence, vol. 1104. Springer Verlag, 583-597.
13. Giunchiglia, F. and Sebastiani, R. 1996b. A SAT-based decision procedure for ALC in KR'96. 304-314.
14. Goble, L. 1974. Gentzen systems for modal logic. Notre Dame J. of Formal Logic 15, 455-461.
15. Haarslev, V., Moller, R., and Turhan, A.-Y. 1998. Implementing an Alcrp(D) Abox reasoner-progress report. In Proc. DL-98 International Description Logic Workshop. Trento, Italy.
16. Horrocks, I. 1997. Optimizing tableaux decision procedures for modal logic. Ph.D. thesis, University of Manchester.
17. Horrocks, I. 1998. Using an expressive description logic: FaCT or fiction. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference (KR'98), A. Cohn, L. Schubert, and S. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 636-647.
18. Horrocks, I. and Patel-Schneider, P. 1998. FaCT and DLP. In Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, Tableaux'98, H. de Swart, Ed. Lecture Notes in Artificial Intelligence, vol. 1397. Springer Verlag, Oisterwijk, The Netherlands, 27-30.
19. Horrocks, I., Patel-Schneider, P., and Sebastiani, R. 2000. An analysis of empirical testing for modal decision procedures. Logic Journal of the IGPL 8, 3, 293-323.
20. Hustadt, U. and Schmidt, R. 1997. On evaluating decision procedures for modal logic. In 1JCA1-97. Vol. 1. 202-207.
21. Maslov, S. 1971. Proof-search strategies for methods of the resolution. In Machine Intelligence, B. Meltzer and D. Michie, Eds. Vol. 6. American Elsevier, 77-90.
22. Mints, G. 1993. Resolution calculus for the first order linear logic. Journal of Logic, Language and Information 2, 58-93.
23. Mints, G. 1994. Resolution strategies for the intuitionistic logic. In Constraint Programming. NATO ASI Series F. Springer Verlag, 289-311.
24. Mints, G., DEgtyarev, A., and Voronkov, A. 2000. The inverse method. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier Science and MIT Press. To appear.
25. Mints, G., Orevkov, V., and Tammet, T. 1996. Transfer of sequent calculus strategies to resolution for S4. In Proof Theory of Modal Logic. Studies in Pure and Applied Logic. Kluwer Academic Publishers.
26. Niewenhuis, R. and Rubio, A. 2000. Paramodulation-based theorem proving. In Handbook of Automated Reasoning, A. Robinson and A. Voronkov, Eds. Elsevier Science and MIT Press. To appear.
27. Patel-Schneider, P. 1998. DLP system description. In Collected Papers from the International.
28. Description Logic Workshop (DL98), E. Franconi, G. Giacomo, R. MacGregor, W. Nutt, C. Welty, and F. Sebastiani, Eds. CEUR-WS, vol. 11. 87-89.
29. Schmidt, R. 1998. Resolution is a decision procedure for many propositional modal logics. In Advances in Modal Logic, 1, M. Kracht, M. de Rijke, H. Wansing, and M. Zakharyaschev, Eds. Lecture Notes, vol. 87. CSLI Publications, Stanford, 189-208.
30. Tacchella, A. 1999. *SAT system description. In Proceedings of the 1999 International Description Logic Workshop (DL'99), P. Lambrix, A. Borgida, M. Lenzerini, R. Moller, and P. Patel-Schneider, Eds. CEUR-WS, vol. 22. 142-144.
31. Tammet, T. 1994. Proof strategies in linear logic. Journal of Automated Reasoning 12, 3, 273-304.
32. Tammet, T. 1996. A resolution theorem prover for intuitionistic logic. In CADE-13, M. McRobbie and J. Slaney, Eds.Lecture Notes in Artificial Intelligence, vol. 1104. 2-16.
33. Voronkov, A. 1985. A proof search method (in Russian). Vychislitelnye Sistemy 107, 109-123.
34. Voronkov, A. 1990. A proof-search method for the first order logic. In COLOG'88, P. Martin-Lof and G. Mintz, Eds. Lecture Notes in Computer Science, vol. 417. Springer Verlag, 327-340.
35. Voronkov, A. 1992. Theorem proving in non-standard logics based on the inverse method. In 11th International Conference on Automated Deduction, D. Kapur, Ed. Lecture Notes in Artificial Intelligence, vol. 607. Springer Verlag, 648-662.
36. Voronkov, A. 1999. KH: A theorem prover for k. In Automated Deduction CADE-16. 16th International Conference on Automated Deduction, H. Ganzinger, Ed. Lecture Notes in Artificial Intelligence, vol. 1632. Springer Verlag, Trento, Italy, 383-387.
37. Voronkov, A. 2000. How to decide K using X. In Principles of Knowledge Representation and Reasoning (KR'2000), A. Cohn, F. Giunchiglia, and B. Selman, Eds. 198-209.
38. Wallen, L. 1990. Automated Deduction in Nonclassical Logics. The MIT Press.
39. Weidenbach, C., Gaede, B., and Rock, G. 1996. Spass & Flotter. Version 0.42. In Cade-13, M. McRobbie and J. Slaney, Eds. Lecture Notes in Artificial Intelligence, vol. 1104. Springer Verlag, 141-145.