{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:47:45Z","timestamp":1649098065065},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0304-3975(94)90089-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"1-28","source":"Crossref","is-referenced-by-count":5,"title":["On the relative merits of path dissolution and the method of analytic tableaux"],"prefix":"10.1016","volume":"131","author":[{"given":"Neil V.","family":"Murray","sequence":"first","affiliation":[]},{"given":"Erik","family":"Rosenthal","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90089-2_bib1","series-title":"The Foundations of Mathematics","author":"Beth","year":"1965"},{"key":"10.1016\/0304-3975(94)90089-2_bib2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(79)90054-9","article-title":"Tautology testing with a generalized matrix reduction method","volume":"8","author":"Bibel","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90089-2_bib3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.2307\/2274395","article-title":"Systematization of finite many-valued logics through the method of tableaux","volume":"52","author":"Carnielli","year":"1987","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(94)90089-2_bib4","series-title":"Proc. 6th Ann. Acm SToC","first-page":"135","article-title":"On the lengths of proofs in the propositional calculus","author":"Cook","year":"1974"},{"key":"10.1016\/0304-3975(94)90089-2_bib5","series-title":"Proc. 5th Internat. Sypm. on Methodologies for Intelligence Systems","first-page":"498","article-title":"Preliminary report: NM3 \u2013 a three-valued monotonic formalism","volume":"Vol. 5","author":"Doherty","year":"1990"},{"key":"10.1016\/0304-3975(94)90089-2_bib6","series-title":"Relative Complexities of First Order Calculi","author":"Eder","year":"1992"},{"key":"10.1016\/0304-3975(94)90089-2_bib7","series-title":"Proc. ECAI-88","article-title":"The use of assertion-time inference in logic-based knowledge bases","author":"Elfrink","year":"1988"},{"key":"10.1016\/0304-3975(94)90089-2_bib8","series-title":"First Order Logic and Automatic Theorem Proving","author":"Fitting","year":"1990"},{"key":"10.1016\/0304-3975(94)90089-2_bib9","series-title":"The Collected Papers of Gerhard Gentzen","first-page":"68","article-title":"Investigations in logical deduction","author":"Gentzen","year":"1969"},{"key":"10.1016\/0304-3975(94)90089-2_bib10","series-title":"Proc. 21st Internat. Symp. on Multiple-Valued Logic","first-page":"238","article-title":"Uniform notation of tableau rules for multiple-valued logics","author":"H\u00e4hnle","year":"1991"},{"key":"10.1016\/0304-3975(94)90089-2_bib11","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90089-2_bib12","first-page":"7","article-title":"Form and content in quantification theory","volume":"8","author":"Hintikka","year":"1955","journal-title":"Acta Philos. Fenn."},{"key":"10.1016\/0304-3975(94)90089-2_bib13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/23005.23716","article-title":"Inference with path resolution and semantic graphs","volume":"34","author":"Murray","year":"1987","journal-title":"J. Acm"},{"key":"10.1016\/0304-3975(94)90089-2_bib14","series-title":"Proc. Internat. Symp. on Symbolic and Algebraic Computation","first-page":"373","article-title":"Employing path dissolution to shorten tableau proofs","author":"Murray","year":"1989"},{"key":"10.1016\/0304-3975(94)90089-2_bib15","series-title":"Proc. 4th Internat. Symp. on Methodologies for Intelligent Systems","first-page":"477","article-title":"Improving tableau proofs","volume":"Vol. 4","author":"Murray","year":"1989"},{"key":"10.1016\/0304-3975(94)90089-2_bib16","series-title":"Proc. Internat. Symp. on Symbolic and Algebraic Computation","first-page":"52","article-title":"Reexamining intractability of analytic tableaux","author":"Murray","year":"1990"},{"key":"10.1016\/0304-3975(94)90089-2_bib17","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/174130.174135","article-title":"Dissolution: making paths vanish","volume":"40","author":"Murray","year":"1993","journal-title":"J. Acm"},{"key":"10.1016\/0304-3975(94)90089-2_bib18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00244513","article-title":"HARP: a tableau-based theorem prover","volume":"4","author":"Oppacher","year":"1988","journal-title":"J. Automat. Reason."},{"key":"10.1016\/0304-3975(94)90089-2_bib19","series-title":"Proc. 10th Internat. Conf. on Automated Deduction","first-page":"528","article-title":"A tableau based theorem prover for a decidable subset of default logic","volume":"Vol. 449","author":"Schwind","year":"1990"},{"key":"10.1016\/0304-3975(94)90089-2_bib20","series-title":"First-Order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/0304-3975(94)90089-2_bib21","series-title":"Automated Deduction in Nonclassical Logics","author":"Wallen","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900892?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900892?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:19Z","timestamp":1555129699000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0304397594900892"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90089-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}