{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:47Z","timestamp":1725487667231},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540660866"},{"type":"electronic","value":"9783540487548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48754-9_2","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:20:56Z","timestamp":1184602856000},"page":"14-18","source":"Crossref","is-referenced-by-count":7,"title":["Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Massacci","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"P. Balsinger & A. Heuerding. Comparison of theorem provers for modal logics. In Proc. of TABLEAUX-98, LNAI 1397, p. 25\u201327, Springer Verlag 1998.","DOI":"10.1007\/3-540-69778-0_4"},{"key":"2_CR2","unstructured":"M. Cadoli, A. Giovanardi, & M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. of AAAI-98, 1998."},{"key":"2_CR3","unstructured":"F. Donini, M. Lenzerini, D. Nardi, & A. Schaerf. Reasoning in description logics. In Foundation of Knowledge Representation, p. 191\u2013236. CSLI-Publications, 1996."},{"key":"2_CR4","first-page":"365","volume":"1","author":"M. Fitting","year":"1993","unstructured":"M. Fitting. Basic modal logic. In Handbook of Logic in AI and Logic Programming, vol. 1, p. 365\u2013448. Oxford Univ. Press, 1993.","journal-title":"Handbook of Logic in AI and Logic Programming"},{"issue":"3","key":"2_CR5","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"P. Fleming","year":"1986","unstructured":"P. Fleming & J. Wallace. How not to lie with statistics: the correct way to sum marize benchmark results. CACM, 29(3):218\u2013221, 1986.","journal-title":"CACM"},{"key":"2_CR6","unstructured":"E. Giunchiglia, F. Giunchiglia, R. Sebastiani, & A. Tacchella. More evaluation of decision procedures for modal logics. In Proc. of KR-96, p. 626\u2013635. 1998."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013597. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61511-3_115"},{"issue":"2","key":"2_CR8","first-page":"361","volume":"75","author":"J. Halpern","year":"1995","unstructured":"J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. AH, 75(2):361\u2013372, 1995.","journal-title":"AH"},{"key":"2_CR9","first-page":"319","volume":"54","author":"J. Y. Halpern","year":"1992","unstructured":"J. Y. Halpern & Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. AIJ, 54:319\u2013379, 1992.","journal-title":"AIJ"},{"key":"2_CR10","unstructured":"U. Hustadt & R. Schmidt. On evaluating decision procedure for modal logic. In Proc. of IJCAI-97, p. 202\u2013207, 1997."},{"key":"2_CR11","unstructured":"D. Johnson. A theoretician\u2019s guide to the experimental analysis of algorithms. Invited talk at AAAI-96. See http:\/\/www.research.att.com\/~dsj , Aug. 1996."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"D. Johnson & M. Trick, editors. Cliques, Coloring, Satisfiability: the second DIMACS implementation challenge, vol. 26 of AMS Series in Discr. Math. and Theor. Comp. Sci.. Am. Math. Soc., 1996.","DOI":"10.1090\/dimacs\/026"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"D. Johnson. A catalog of complexity classes. In Handbook of Theoretical Computer Science, p. 67\u2013162. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"R. Ladner. The computational complexity of provability in systems of modal propositional logic. SIAM JoC, 6(3):467\u2013480, 1977.","journal-title":"SIAM JoC"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"J. Orlin. The complexity of dynamic languages and dynamic optimization prob lems. In Proc. of STOC-81, p. 218\u2013227, 1981.","DOI":"10.1145\/800076.802475"},{"key":"2_CR16","unstructured":"W. Press, B. Flannery, S. Teukolsky, & W. Vetterling. Numerical Recipes in C: The Art of Scientific Computing. Cambridge Univ. Press, 1990."},{"issue":"1\u20132","key":"2_CR17","first-page":"17","volume":"81","author":"B. Selman","year":"1996","unstructured":"B. Selman, D. Mitchell, & H. Levesque. Generating hard satisfiability problems. AIJ, 81(1\u20132):17\u201329, 1996.","journal-title":"AIJ"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1006006930186","volume":"21","author":"C. Suttner","year":"1998","unstructured":"C. Suttner & G. Sutcliffe. The CADE-14 ATP system competition. JAR, 21(1):99\u2013134, 1998.","journal-title":"JAR"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48754-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T10:33:09Z","timestamp":1683973989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48754-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540660866","9783540487548"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48754-9_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}