{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:54:31Z","timestamp":1794336871833,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540629207","type":"print"},{"value":"9783540690467","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0027407","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T01:34:36Z","timestamp":1132623276000},"page":"91-106","source":"Crossref","is-referenced-by-count":17,"title":["Free variable tableaux for propositional modal logics"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Beckert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"B. Beckert and R. Gor\u00e9. Free variable tableaux for propositional modal logics. Interner Bericht 41\/96, Universit\u00e4t Karlsruhe, Fakult\u00e4t f\u00fcr Informatik, 1996.","DOI":"10.1007\/BFb0027407"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"B. Beckert, R. H\u00e4hnle, P. Oel, and M. Sulzmann. The tableau-based theorem prover 3 T A P, version 4.0. In Proc. CADE-13, LNCS 1104. Springer, 1996.","DOI":"10.1007\/3-540-61511-3_95"},{"issue":"3","key":"7_CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00881804","volume":"15","author":"B. Beckert","year":"1995","unstructured":"B. Beckert and J. Posegga. leanT A P: Lean tableau-based deduction. Journal of Automated Reasoning, 15(3):339\u2013358, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR4","volume-title":"Handbook of Philosophical Logic, volume 3","author":"E. Bencivenga","year":"1986","unstructured":"E. Bencivenga. Free logic. In D. Gabbay and F. G\u00fcnthner, editors, Handbook of Philosophical Logic, volume 3. Kluwer, Dordrecht, 1986."},{"key":"7_CR5","unstructured":"M. D'Agostino, D. Gabbay, and A. Russo. Grafting modalities onto substructural implication systems. Studia. Logica, 1996. To appear."},{"key":"7_CR6","volume-title":"volume 169 of Synthese Library","author":"M. Fitting","year":"1983","unstructured":"M. Fitting. Proof Methods for Modal and Intuitionistic Logics, volume 169 of Synthese Library. D. Reidel, Dordrecht, Holland, 1983."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"M. Fitting. First-Order Logic and Automated Theorem Proving. Springer, second edition, 1996.","DOI":"10.1007\/978-1-4612-2360-3"},{"key":"7_CR8","unstructured":"M. Fitting. Leantap revisited. Draft Manuscript, Jan. 1996."},{"key":"7_CR9","unstructured":"A. Frisch and R. Scherl. A general framework for modal deduction. In J. Allen, R. Fikes, and E. Sandewall, editors, Proc. 2nd Conference on Principles of Knowledge Representation and Reasoning. Morgan-Kaufmann, 1991."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"D. Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.","DOI":"10.1093\/oso\/9780198538332.001.0001"},{"key":"7_CR11","volume-title":"Handbook of Tableau Methods","author":"R. Gor\u00e9","year":"1997","unstructured":"R. Gor\u00e9. Tableau methods for modal and temporal logics. In M. D'Agostino, D. Gabbay, R. H\u00e4hnle, and J. Posegga, editors, Handbook of Tableau Methods, chapter 7. Kluwer, Dordrecht, 1997. To appear."},{"key":"7_CR12","volume-title":"Short Papers: TABLEAUX'96, number 154-96","author":"G. Governatori","year":"1996","unstructured":"G. Governatori. A reduplication and loop checking free proof system for S4. In Short Papers: TABLEAUX'96, number 154-96 in RI-DSI, Via Comelico 39, 20135 Milan, Italy, 1996. Department of Computer Science, University of Milan."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"A. Heuerding, M. Seyfried, and H. Zimmermann. Efficient loop-check for backward proof search in some non-classical logics. In P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi, editors, Proc. TABLEAUX'96, LNCS 1071. Springer, 1996.","DOI":"10.1007\/3-540-61208-4_14"},{"key":"7_CR14","unstructured":"P. Jackson and H. Reichgelt. A general proof method for first-order modal logic. In 9th Int. Joint Conference on Artificial Intelligence, pages 942\u2013944, 1987."},{"key":"7_CR15","volume-title":"Stockholm Studies in Philosophy","author":"S. Kanger","year":"1957","unstructured":"S. Kanger. Provability in Logic. Stockholm Studies in Philosophy, University of Stockholm. Almqvist and Wiksell, Sweden, 1957."},{"issue":"2","key":"7_CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","volume":"8","author":"R. Letz","year":"1992","unstructured":"R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8(2):183\u2013212, 1992.","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"F. Massacci. Strongly analytic tableaux for normal modal logics. In A. Bundy, editor, Proc, CADE-12, LNCS 814. Springer, 1994.","DOI":"10.1007\/3-540-58156-1_52"},{"key":"7_CR18","volume-title":"A Short Introduction to Modal Logic","author":"G. Mints","year":"1992","unstructured":"G. Mints. A Short Introduction to Modal Logic. CSLI, Stanford, 1992."},{"key":"7_CR19","unstructured":"S. Reeves. Semantic tableaux as a framework for automated theorem-proving. In C. Mellish and J. Hallam, editors, Advances in Artificial Intelligence. Wiley, 1987."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A. Russo. Generalising propositional modal logic using labelled deductive systems. In F. Baader and K. Schulz, editors, Proceedings FroCoS. Kluwer, 1996.","DOI":"10.1007\/978-94-009-0349-4_2"}],"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\/BFb0027407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T19:03:48Z","timestamp":1706727828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629207","9783540690467"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0027407","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0027400","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}