Abstract
A lot of methods have been proposed – and sometimes implemented – for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of these methods in practice, since in most cases no or only a few execution times have been published. We try to improve this unsatisfactory situation by presenting a set of benchmark formulas. Note that we do not just list formulas, but give a method that allows us to compare different provers today and in the future. As a starting point we give the results we obtained when we applied this benchmark method to the Logics Workbench (LWB). We hope that the discussion of postulates concerning ATP benchmark helps to obtain improved benchmark methods for other logics, too.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Catach, L.: Tableaux: A general theorem prover for modal logics, J. Automated Reasoning 7 (1991), 489-510.
de Swart, H. (ed.): Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX’ 98, LNAI 1397, Springer, 1998.
Demri, S.: Uniform and non uniform strategies for tableaux calculi for modal logics, J. Appl. Non-Classical Logics 5(1) (1995), 77-96.
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.
Halpern, J. and Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief, Artif. Intell. 54 (1992), 319-379.
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.
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.
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.
Pelletier, F.: Seventy-five problems for testing automatic theorem provers, J. Automated Reasoning 2 (1986), 191-216.
Selman, B., Levesque, H. and Mitchell, D.: A new method for solving hard satisfiability problems, in Proceedings 10th AAAI, 1992, pp. 47-59.
Sutcliffe, G., Suttner, S. and Yemenis, T.: The TPTP problem library, in A. Bundy (ed.), CADE 12, LNCS 814, 1994, pp. 252-266.
Rights and permissions
About this article
Cite this article
Balsiger, P., Heuerding, A. & Schwendimann, S. A Benchmark Method for the Propositional Modal Logics K, KT, S4. Journal of Automated Reasoning 24, 297–317 (2000). https://doi.org/10.1023/A:1006249507577
Issue Date:
DOI: https://doi.org/10.1023/A:1006249507577