A benchmark method for the propositional modal logics K, KT, S4

Journal of Automated Reasoning

Volumn 24, Issue 3, 2000, Pages 297-317

  Balsiger, Peter ^a   Heuerding, Alain ^a   Schwendimann, Stefan ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Benchmark; Formula; Logic; Lwb; Modal; Propositional; Workbench

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; DATABASE SYSTEMS; DECISION THEORY; FORMAL LOGIC; WORLD WIDE WEB;

FORMULA; LOGICS WORKBENCH; PROPOSITIONAL MODAL LOGICS;

THEOREM PROVING;

EID: 0034174058     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1006249507577     Document Type: Article

References (12)

1. Balsiger, P. and Heuerding, A.: Comparison of theorem provers for modal logics - introduction and summary, in H. de Swart (ed.), TABLEAUX '98, LNAI 1397, 1998, pp. 25-26.
2. Catach, L.: Tableaux: A general theorem prover for modal logics, J. Automated Reasoning 7 (1991), 489-510.
3. de Swart, H. (ed.): Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX '98, LNAI 1397, Springer, 1998.
4. Demri, S.: Uniform and non uniform strategies for tableaux calculi for modal logics, J. Appl. Non-Classical Logics 5(1) (1995), 77-96.
5. Giunchiglia, F. and Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures - the case study of modal K, in CADE 96, LNCS, 1996.
6. Halpern, J. and Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief, Artif. Intell. 54 (1992), 319-379.
7. Heuerding, A., Jäger, G., Schwendimann, S. and Seyfried, M.: Propositional logics on the computer, in P. Baumgartner, R. Hähnle, and J. Posegga (eds.), Tableaux 95, LNCS 918, 1995, pp. 310-323.
8. Heuerding, A. and Schwendimann, S.: On the modal logic K plus theories, in H. Kleine Büning (eds.), CSL 95, LNCS 1092, 1996, pp. 308-319.
9. Heuerding, A., Seyfried, M. and Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics, in P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi (eds.), Tableaux 96, LNCS 1071, 1996, pp. 210-225.
10. Pelletier, F.: Seventy-five problems for testing automatic theorem provers, J. Automated Reasoning 2 (1986), 191-216.
11. Selman, B., Levesque, H. and Mitchell, D.: A new method for solving hard satisfiability problems, in Proceedings 10th AAAI, 1992, pp. 47-59.
12. Sutcliffe, G., Suttner, S. and Yemenis, T.: The TPTP problem library, in A. Bundy (ed.), CADE 12, LNCS 814, 1994, pp. 252-266.