{"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":1761596717722},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"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":9271,"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,3]]},"DOI":"10.1016\/0743-1066(88)90005-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"1-31","source":"Crossref","is-referenced-by-count":56,"title":["Clausal intuitionistic logic I. fixed-point semantics"],"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)90005-2_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."},{"key":"10.1016\/0743-1066(88)90005-2_BIB2","series-title":"Machine Intelligence","first-page":"421","article-title":"Programming with Full First-Order Logic","author":"Bowen","year":"1982"},{"issue":"2","key":"10.1016\/0743-1066(88)90005-2_BIB3","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)90005-2_BIB4","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(88)90005-2_BIB5","series-title":"Model Theory and Forcing","article-title":"Intuitionistic Logic","author":"Fitting","year":"1969"},{"issue":"4","key":"10.1016\/0743-1066(88)90005-2_BIB6","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)90005-2_BIB7","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)90005-2_BIB8","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"},{"key":"10.1016\/0743-1066(88)90005-2_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01744296","article-title":"On the Existence of Optimal Fixpoints","volume":"13","author":"Gallier","year":"1980","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/0743-1066(88)90005-2_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.2307\/2964334","article-title":"Concerning Formulas of the Types A \u2192 B \u03bd C, A \u2192 (Ex) B (x) in Intuitionistic Formal Systems","volume":"25","author":"Harrop","year":"1960","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0743-1066(88)90005-2_BIB11","series-title":"Automata, Languages and Programming","first-page":"225","article-title":"Induction Rules and Termination Proofs","author":"Hitchcock","year":"1973"},{"issue":"1","key":"10.1016\/0743-1066(88)90005-2_BIB12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.2307\/2963675","article-title":"Disjunction and Existence under Implication in Elementary Intuitionistic Formalisms","volume":"27","author":"Kleene","year":"1962","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0743-1066(88)90005-2_BIB13","series-title":"Logic for Problem Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/0743-1066(88)90005-2_BIB14","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)90005-2_BIB15","series-title":"AAAI Presidential Address","author":"McCarthy","year":"1984"},{"key":"10.1016\/0743-1066(88)90005-2_BIB16","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)90005-2_BIB17","unstructured":"McCarty, L. T., Programming Directly in a Nonmonotonic Logic, to appear."},{"key":"10.1016\/0743-1066(88)90005-2_BIB18","series-title":"Proceedings, Third IEEE Symposium on Logic Programming","article-title":"A Theory of Modules for Logic Programs","author":"Miller","year":"1986"},{"key":"10.1016\/0743-1066(88)90005-2_BIB19","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)90005-2_BIB20","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0743-1066(88)90005-2_BIB21","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)90005-2_BIB22","series-title":"Logic and Data Bases","first-page":"55","article-title":"On Closed World Data Bases","author":"Reiter","year":"1978"},{"issue":"8","key":"10.1016\/0743-1066(88)90005-2_BIB23","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."},{"key":"10.1016\/0743-1066(88)90005-2_BIB24","first-page":"211","article-title":"A PROLOG Technology Theorem Prover","author":"Stickel","year":"1984","journal-title":"Proceedings, 1984 International Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(88)90005-2_BIB25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A Lattice-Theoretical Fixpoint Thorem and Its Applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"issue":"4","key":"10.1016\/0743-1066(88)90005-2_BIB26","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."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900052?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106688900052?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:55Z","timestamp":1555127695000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106688900052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0743106688900052"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(88)90005-2","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}