Design and results of the tableaux-99 non-classical (modal) systems comparison

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

Volumn 1617, Issue , 1999, Pages 14-18

  Massacci, Fabio ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ATP SYSTEMS; SYSTEM COMPARISONS; SYSTEMS COMPARISON;

ARTIFICIAL INTELLIGENCE;

EID: 22644449261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48754-9_2     Document Type: Conference Paper

References (18)

1. P. Balsinger & A. Heuerding. Comparison of theorem provers for modal logics. In Proc. of TABLEA UX-98, LNAI 1397, p. 25-27, Springer Verlag 1998.
2. M. Cadoli, A. Giovanardi, & M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. of AAAI-98, 1998.
3. F. Donini, M. Lenzerini, D. Nardi, & A. Schaerf. Reasoning in description logics. In Foundation of Knowledge Representation, p. 191-236. CSLI-Publications, 1996.
4. M. Fitting. Basic modal logic. In Handbook of Logic in AI and Logic Programming, vol. 1, p. 365-448. Oxford Univ. Press, 1993.
5. P. Fleming & J. Wallace. How not to lie with statistics: the correct way to summarize benchmark results. CACM, 29(3):218-221, 1986.
6. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, & A. Tacchella. More evaluation of decision procedures for modal logics. In Proc. of KR-96, p. 626-635. 1998.
7. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal k. In Proc. of CADE-96, LNAI 1104, p. 583-597. Springer-Verlag, 1996.
8. J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. AIJ, 75(2):361-372, 1995.
9. J. Y. Halpern & Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. AIJ, 54:319-379, 1992.
10. U. Hustadt & R. Schmidt. On evaluating decision procedure for modal logic. In Proc. of IJCAI-97, p. 202-207, 1997.
11. D. Johnson. A theoretician’s guide to the experimental analysis of algorithms. Invited talk at AAAI-96. See http://hww.research.att.com/~dsj, Aug. 1996.
12. D. Johnson & M. Trick, editors. Cliques, Coloring, Satisfiability: the second DI- MACS implementation challenge, vol. 26 of AMS Series in Discr. Math, and Theor. Comp. Sci.. Am. Math. Soc., 1996.
13. D. Johnson. A catalog of complexity classes. In Handbook of Theoretical Computer Science, p. 67-162. Elsevier Science, 1990.
14. R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM JoC, 6(3):467-480, 1977.
15. J. Orlin. The complexity of dynamic languages and dynamic optimization problems. In Proc. of STOC-81, p. 218-227, 1981.
16. W. Press, B. Flannery, S. Teukolsky, & W. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge Univ. Press, 1990.
17. B. Selman, D. Mitchell, & H. Levesque. Generating hard satisfiability problems. AIJ, 81(1-2):17-29, 1996.
18. C. Suttner & G. Sutcliffe. The CADE-14 ATP system competition. JAR, 21(1):99-134, 1998.