{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:23:37Z","timestamp":1725488617458},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671909"},{"type":"electronic","value":"9783540465089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46508-1_19","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T16:02:03Z","timestamp":1186156923000},"page":"282-297","source":"Crossref","is-referenced-by-count":0,"title":["Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized \u03b4-Rule but Without Skolemization"],"prefix":"10.1007","author":[{"given":"Claus-Peter","family":"Wirth","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Matthias Baaz, Christian G. Ferm\u00fcller (1995). Non-elementary Speedups between Different Versions of Tableaux. 4th TABLEAUX 1995, LNAI 918, pp. 217\u2013230, Springer.","DOI":"10.1007\/3-540-59338-1_38"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0004-3702(96)00042-2","volume":"90","author":"P. Baumgartner","year":"1997","unstructured":"Peter Baumgartner, Ulrich Furbach, Frieder Stolzenburg (1997). Computing Answers with Model Elimination. Artificial Intelligence 90, pp. 135\u2013176.","journal-title":"Artificial Intelligence"},{"key":"19_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0022559","volume-title":"Kurt G\u00f6del Colloquium","author":"B. Beckert","year":"1993","unstructured":"Bernhard Beckert, Reiner H\u00e4hnle, Peter H. Schmitt (1993). The Even More Liberalized \u03b4-Rule in Free Variable Semantic Tableaux. Kurt G\u00f6del Colloquium, LNCS 713, pp. 108\u2013119, Springer."},{"key":"19_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-90102-6","volume-title":"Automated Theorem Proving","author":"W. Bibel","year":"1987","unstructured":"Wolfgang Bibel (1987). Automated Theorem Proving. 2nd rev. ed., Vieweg, Braunschweig.","edition":"2nd rev. ed."},{"key":"19_CR5","unstructured":"Wolfgang Bibel, Peter H. Schmitt (eds.) (1998). Automated Deduction \u2014 A Basis for Applications. Kluwer Acad. Publ."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Melvin Fitting (1996). First-Order Logic and Automated Theorem Proving. 2nd extd. ed., Springer.","DOI":"10.1007\/978-1-4612-2360-3"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gerhard Gentzen (1935). Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift 39, pp. 176\u2013210, 405\u2013431.","DOI":"10.1007\/BF01201363"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00881956","volume":"13","author":"R. H\u00e4hnle","year":"1994","unstructured":"Reiner H\u00e4hnle, Peter H. Schmitt (1994). The Liberalized \u03b4-Rule in Free Variable Semantic Tableaux. J. Automated Reasoning 13, pp. 211\u2013221, Kluwer Acad. Publ.","journal-title":"J. Automated Reasoning"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"S. Kanger (1963). A Simplified Proof Method for Elementary Logic. In: G. Wrightson (eds.) (1983). Automation of Reasoning. Springer Siekmann & Wrightson (1983), Vol. 1, pp. 364\u2013371.","DOI":"10.1016\/S0049-237X(08)72020-2"},{"key":"19_CR10","unstructured":"Micha\u00ebl Kohlhase (1995). Higher-Order Tableaux. 4th TABLEAUX 1995, LNAI 918, pp. 294\u2013309, Springer. Revised version is: Kohlhase (1998)."},{"key":"19_CR11","unstructured":"Micha\u00ebl Kohlhase (1998). Higher-Order Automated Theorem Proving. In: Peter H. Schmitt (eds.) (1998). Automated Deduction \u2014 A Basis for Applications. Kluwer Acad. Publ. Bibel & Schmitt (1998), Vol. 1, pp. 431\u2013462."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0747-7171(92)90011-R","volume":"14","author":"D. Miller","year":"1992","unstructured":"Dale Miller (1992). Unification under a Mixed Prefix. J. Symbolic Computation 14, pp. 321\u2013358.","journal-title":"J. Symbolic Computation"},{"key":"19_CR13","volume-title":"Strong Skolemization","author":"A. Nonnengart","year":"1996","unstructured":"Andreas Nonnengart (1996). Strong Skolemization. MPI-I-96-2-010, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M. S. Paterson","year":"1978","unstructured":"Michael S. Paterson, Mark N. Wegman (1978). Linear Unification. J. Computer and System Sci. 16, pp. 158\u2013167, Academic Press.","journal-title":"J. Computer and System Sci."},{"key":"19_CR15","unstructured":"Dag Prawitz (1960). An Improved Proof Procedure. In: G. Wrightson (eds.) (1983). Automation of Reasoning. Springer Siekmann & Wrightson (1983), Vol. 1, pp. 159\u2013199."},{"key":"19_CR16","unstructured":"J\u00f6rg Siekmann, G. Wrightson (eds.) (1983). Automation of Reasoning. Springer."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Raymond M. Smullyan (1968). First-Order Logic. Springer.","DOI":"10.1007\/978-3-642-86718-7"},{"key":"19_CR18","volume-title":"Positive\/Negative-Conditional Equations: A Constructor-Based Framework for Specification and Inductive Theorem Proving","author":"C.-P. Wirth","year":"1997","unstructured":"Claus-Peter Wirth (1997). Positive\/Negative-Conditional Equations: A Constructor-Based Framework for Specification and Inductive Theorem Proving. Dissertation (Ph.D. thesis), Verlag Dr. Kova\u010d, Hamburg."},{"key":"19_CR19","unstructured":"Claus-Peter Wirth (1998). Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized \u03b4-Rule but Without Skolemization. Report 698\/1998, FB Informatik, Univ. Dortmund. http:\/\/LS5.cs.uni-dortmund.de\/~wirth\/publications\/gr698\/all.ps.gz ."},{"key":"19_CR20","unstructured":"Claus-Peter Wirth (1999). Full First-Order Free Variable Sequents and Tableaux in Implicit Induction. 8thTABLEAUX1999, LNAI, Springer, to appear."},{"key":"19_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-60381-6_21","volume-title":"4th CTRS 1994","author":"C.-P. Wirth","year":"1995","unstructured":"Claus-Peter Wirth, Klaus Becker (1995). Abstract Notions and Inference Systems for Proofs by Mathematical Induction. 4th CTRS 1994, LNCS 968, pp. 353\u2013373, Springer."},{"key":"19_CR22","unstructured":"Claus-Peter Wirth, Bernhard Gramlich (1994). On Notions of Inductive Validity for First-Order Equational Clauses. 12th CADE 1994, LNAI 814, pp. 162\u2013176, Springer."}],"container-title":["Lecture Notes in Computer Science","Automated Deduction in Classical and Non-Classical Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46508-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T14:57:51Z","timestamp":1556722671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46508-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671909","9783540465089"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-46508-1_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}