{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:23Z","timestamp":1725663863105},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581567"},{"type":"electronic","value":"9783540484677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58156-1_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:23:36Z","timestamp":1330251816000},"page":"708-722","source":"Crossref","is-referenced-by-count":5,"title":["Semantic tableaux with ordering restrictions"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Klingenbeck","sequence":"first","affiliation":[]},{"given":"Reiner","family":"H\u00e4hnle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"51_CR1","first-page":"224","volume-title":"Proc. 11th Conference on Automated Deduction","author":"O. Astrachan","year":"1992","unstructured":"O. Astrachan and M. Stickel. Caching and lemmaizing in model elimination theorem provers. In D. Kapur, editor, Proc. 11th Conference on Automated Deduction, Albany\/NY, USA, pages 224\u2013238. Springer LNAI 607, 1992."},{"key":"51_CR2","volume-title":"Technical Report MPI-I-9-1-208","author":"L. Bachmair","year":"1991","unstructured":"L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. Technical Report MPI-I-9-1-208, Max-Planck-Institut f\u00fcr Informatik, MPI at Saarbr\u00fccken, Germany, 1991."},{"key":"51_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"W. Bibel. Automated Theorem Proving. Vieweg, Braunschweig, 2nd edition, 1987.","edition":"2nd edition"},{"key":"51_CR4","unstructured":"W. Bibel and E. Eder. Decomposition of tautologies into regular formulas and strong completeness of connection graph resolution. Technical Report AIDA-94-0?, FG Intellektik, FB Informatik, TH Darmstadt, Mar. 1994."},{"issue":"1","key":"51_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1093\/logcom\/3.1.3","volume":"3","author":"R. Caferra","year":"1993","unstructured":"R. Caferra and N. Zabel. A tableaux method for systematic simultaneous search for refutations and models using equational problems. Journal of Logic and Computation, 3(1):3\u201326, 1993.","journal-title":"Journal of Logic and Computation"},{"key":"51_CR6","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C.-L. Chang","year":"1973","unstructured":"C.-L. Chang and R. C.-T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973."},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"C. Ferm\u00fcller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Methods for the Decision Problem. Springer LNAI 679, 1993.","DOI":"10.1007\/3-540-56732-1"},{"key":"51_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","volume-title":"First-Order Logic and Automated Theorem Proving","author":"M. C. Fitting","year":"1990","unstructured":"M. C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990."},{"issue":"3","key":"51_CR9","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"W. H. Joyner","year":"1976","unstructured":"W. H. Joyner. Resolution strategies as decision procedures. Journal of the Association for Computing Machinery, 23(3):398\u2013417, 1976.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"51_CR10","first-page":"99","volume":"4","author":"T. K\u00e4ufl","year":"1990","unstructured":"T. K\u00e4ufl and N. Zabel. Cooperation of decision procedures in a tableau-based theorem prover. Revue d'Intelligence Artificielle, 4(3):99\u2013126, 1990.","journal-title":"Revue d'Intelligence Artificielle"},{"key":"51_CR11","first-page":"87","volume":"4","author":"R. Kowalski","year":"1969","unstructured":"R. Kowalski and P. Hayes. Semantic trees in automatic theorem-proving. Machine Intelligence, 4:87\u2013101, 1969.","journal-title":"Machine Intelligence"},{"key":"51_CR12","unstructured":"R. Letz. First-Order Calcult and Proof Procedures for Automated Deduction. PhD thesis, TH Darmstadt, June 1993."},{"key":"51_CR13","doi-asserted-by":"crossref","unstructured":"R. Letz, J. Schumann, S. Bayerl, and W. Bibel. SETHEO: A high-perfomance theorem prover. Technical report, Forschungsgruppe KI, TU M\u00fcnchen, 1991.","DOI":"10.1007\/BF00244282"},{"key":"51_CR14","unstructured":"D. W. Loveland. Automated Theorem Proving. A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, 1978."},{"key":"51_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00244513","volume":"4","author":"F. Oppacher","year":"1988","unstructured":"F. Oppacher and E. Suen. HARP: A tableau-based theorem prover. Journal of Automated Reasoning, 4:69\u2013100, 1988.","journal-title":"Journal of Automated Reasoning"},{"key":"51_CR16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0004-3702(76)90021-7","volume":"7","author":"R. E. Shostak","year":"1976","unstructured":"R. E. Shostak. Refutation graphs. Artificial Intelligence, 7:51\u201364, 1976.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"51_CR17","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/321420.321428","volume":"14","author":"J. R. Slagle","year":"1967","unstructured":"J. R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, 14(4):687\u2013697, 1967.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"51_CR18","doi-asserted-by":"crossref","unstructured":"T. Tammet. The resolution program, able to decide some solvable classes. In Proceedings COLOG-88, Talinn, pages 300-312. Springer, LNCS 417, 1990.","DOI":"10.1007\/3-540-52335-9_61"},{"key":"51_CR19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0168-0072(89)90053-5","volume":"42","author":"N. Zamov","year":"1989","unstructured":"N. Zamov. Maslov's inverse method and decidable classes. Annals of Pure and Applied Logic, 42:165\u2013194, 1989.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-12"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58156-1_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:17:43Z","timestamp":1605629863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58156-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581567","9783540484677"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-58156-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}