{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:25:17Z","timestamp":1761596717529},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":9179,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0743-1066(88)90014-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"93-132","source":"Crossref","is-referenced-by-count":34,"title":["Clausal intuitionistic logic II. tableau proof procedures"],"prefix":"10.1016","volume":"5","author":[{"given":"L.Thorne","family":"McCarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/0743-1066(88)90014-3_BIB1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the theory of Logic Programming","volume":"29","author":"Apt","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"issue":"11","key":"10.1016\/0743-1066(88)90014-3_BIB2","doi-asserted-by":"crossref","first-page":"668","DOI":"10.2307\/2026578","article-title":"Situations and Attitudes","volume":"78","author":"Barwise","year":"1981","journal-title":"J. Phil."},{"key":"10.1016\/0743-1066(88)90014-3_BIB3","series-title":"Automated Theorem Proving","author":"Bibel","year":"1982"},{"issue":"2","key":"10.1016\/0743-1066(88)90014-3_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0004-3702(79)90015-8","article-title":"Using Rewriting Rules for Connection Graphs to Prove Theorems","volume":"12","author":"Chang","year":"1979","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90014-3_BIB5","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"issue":"4","key":"10.1016\/0743-1066(88)90014-3_BIB6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0743-1066(85)80005-4","article-title":"A Kripke-Kleene Semantics for Logic Programs","volume":"2","author":"Fitting","year":"1985","journal-title":"J. Logic Programming"},{"issue":"4","key":"10.1016\/0743-1066(88)90014-3_BIB7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","article-title":"N-PROLOG: An Extension of PROLOG with Hypothetical Implication. I","volume":"1","author":"Gabbay","year":"1984","journal-title":"J. Logic Programming"},{"issue":"4","key":"10.1016\/0743-1066(88)90014-3_BIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(85)80003-0","article-title":"n-PROLOG: An Extension of PROLOG with Hypothetical Implication. II. Logical Foundations, and Negation as Failure","volume":"2","author":"Gabbay","year":"1985","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(88)90014-3_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(86)90002-6","article-title":"Negation as Inconsistency. I","volume":"3","author":"Gabbay","year":"1986","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/0743-1066(88)90014-3_BIB10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial Algebra Semantics and Continuous Algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90014-3_BIB11","series-title":"Logic Programming: Functions, Relations, and Equations","first-page":"295","article-title":"EQLOG: Equality, Types, and Generic Modules for Logic Programming","author":"Goguen","year":"1986"},{"key":"10.1016\/0743-1066(88)90014-3_BIB12","series-title":"Formal Methods in the Study of Language","first-page":"277","article-title":"A Theory of Truth and Semantic Representation","author":"Kamp","year":"1981"},{"issue":"1","key":"10.1016\/0743-1066(88)90014-3_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2964568","article-title":"A Completeness Theorem in Modal Logic","volume":"24","author":"Kripe","year":"1959","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0743-1066(88)90014-3_BIB14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/malq.19630090502","article-title":"Semantical Analysis of Modal Logic I: Normal Modal Propositional Calculi","volume":"9","author":"Kripke","year":"1963","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/0743-1066(88)90014-3_BIB15","series-title":"Formal Systems and Recursive Functions","first-page":"92","article-title":"Semantical Analysis of Intuitionistic Logic. I","author":"Kripke","year":"1965"},{"key":"10.1016\/0743-1066(88)90014-3_BIB16","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription: A Form of Nonmonotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90014-3_BIB17","first-page":"287","article-title":"Permissions and Obligations","author":"McCarty","year":"1983","journal-title":"Proceedings IJCAI-83"},{"key":"10.1016\/0743-1066(88)90014-3_BIB18","first-page":"325","article-title":"Programming Directly in a Nonmonotonic Logic: Extended Abstract","author":"McCarty","year":"1984","journal-title":"Proceedings, AAAI Nonmonotonic Reasoning Workshop"},{"key":"10.1016\/0743-1066(88)90014-3_BIB19","series-title":"Automated Analysis of Legal Texts: Logic, Informatics, Law","first-page":"307","article-title":"Permissions and Obligations: An Informal Introduction","author":"McCarty","year":"1986"},{"key":"10.1016\/0743-1066(88)90014-3_BIB20","unstructured":"McCarty, L.T., Programming Directly in a Nonmonotonic Logic, to appear."},{"key":"10.1016\/0743-1066(88)90014-3_BIB21","first-page":"246","article-title":"The Representation of an Evolving System of Legal Concepts: II. Prototypes and Deformations","author":"McCarty","year":"1981","journal-title":"Proceedings IJCAI-81"},{"key":"10.1016\/0743-1066(88)90014-3_BIB22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Nonmonotonic Logic I","volume":"13","author":"McDermott","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(88)90014-3_BIB23","article-title":"A Theory of Modules for Logic Programs","author":"Miller","year":"1986","journal-title":"Proceedings, Third IEEE Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(88)90014-3_BIB24","series-title":"Machine Intelligence","first-page":"101","article-title":"A Production System for Automatic Deduction","author":"Nilsson","year":"1979"},{"key":"10.1016\/0743-1066(88)90014-3_BIB25","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0743-1066(88)90014-3_BIB26","first-page":"455","article-title":"A Decidable First-Order Logic for Knowledge Representation","author":"Patel-Schneider","year":"1985","journal-title":"Proceedings IJCAI-85"},{"key":"10.1016\/0743-1066(88)90014-3_BIB27","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A Logic for Default Reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"8","key":"10.1016\/0743-1066(88)90014-3_BIB28","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1109\/TC.1976.1674701","article-title":"A Search Technique for Clause Interconnectivity Graphs","volume":"C-25","author":"Sickel","year":"1976","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-1066(88)90014-3_BIB29","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(88)90014-3_BIB30","first-page":"244","article-title":"Database Updates in PROLOG","author":"Warren","year":"1984","journal-title":"Proceedings of the International Conference of Fifth Generation Computer Systems"},{"issue":"1","key":"10.1016\/0743-1066(88)90014-3_BIB31","first-page":"35","article-title":"Nonclassical Logic Theorem Proving","volume":"1","author":"Wrightson","year":"1985","journal-title":"J. Automated Reasoning"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:55:00Z","timestamp":1555113300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106688900143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0743106688900143"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(88)90014-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]}}}