{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T11:31:48Z","timestamp":1747740708829},"reference-count":57,"publisher":"Elsevier BV","issue":"2-4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7200,"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":[[1993,11]]},"DOI":"10.1016\/0743-1066(93)90036-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"323-364","source":"Crossref","is-referenced-by-count":4,"title":["Circumscribing embedded implications (without stratifications)"],"prefix":"10.1016","volume":"17","author":[{"given":"L.Thorne","family":"McCarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(93)90036-G_BIB1","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1145\/567752.567763","article-title":"Universality of Data Retrieval Languages","author":"Aho","year":"1979","journal-title":"Proceedings of the Sixth ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(93)90036-G_BIB2","series-title":"Entailment: The Logic of Relevance and Necessity","author":"Anderson","year":"1975"},{"key":"10.1016\/0743-1066(93)90036-G_BIB3","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"issue":"3","key":"10.1016\/0743-1066(93)90036-G_BIB4","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. ACM"},{"issue":"4","key":"10.1016\/0743-1066(93)90036-G_BIB5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF01880329","article-title":"Relevant Logic Programming","volume":"7","author":"Bollen","year":"1991","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(93)90036-G_BIB6","first-page":"144","article-title":"Hypothetical Datalog: Complexity and Expressibility","volume":"Vol. 326","author":"Bonner","year":"1988"},{"key":"10.1016\/0743-1066(93)90036-G_BIB7","first-page":"480","article-title":"A Logic for Hypothetical Reasoning","author":"Bonner","year":"1988","journal-title":"Proceedings of the Seventh National Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB8","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1145\/73721.73750","article-title":"Hypothetical Datalog: Negation and Linear Recursion","author":"Bonner","year":"1989","journal-title":"Proceedings of the ACM Symposium on the Principles of Database Systems"},{"key":"10.1016\/0743-1066(93)90036-G_BIB9","first-page":"681","article-title":"Adding Negation-as-Failure to Intuitionistic Logic Programming","author":"Bonner","year":"1990","journal-title":"Proceedings of the North American Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB10","first-page":"831","article-title":"Expressing Database Queries with Intuitionistic Logic","author":"Bonner","year":"1989","journal-title":"Proceedings of the North American Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and Complexity of Relational Queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0743-1066(93)90036-G_BIB12","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(93)90036-G_BIB13","first-page":"158","article-title":"On the Strong Completion of Logic Programs","volume":"Vol. 463","author":"Dung","year":"1990"},{"key":"10.1016\/0743-1066(93)90036-G_BIB14","article-title":"Strong Circumscription Specifies the Stable Semantics of Logic Programs","author":"Dung","year":"1990","journal-title":"Proceedings of the European Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB15","first-page":"117","article-title":"Relevance Logic and Entailment","volume":"Vol. III","author":"Dunn","year":"1986"},{"key":"10.1016\/0743-1066(93)90036-G_BIB16","first-page":"876","article-title":"Automated Inductive Reasoning about Logic Programs","author":"Elkan","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB17","series-title":"Intuitionistic Logic, Model Theory and Forcing","author":"Fitting","year":"1969"},{"key":"10.1016\/0743-1066(93)90036-G_BIB18","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"},{"key":"10.1016\/0743-1066(93)90036-G_BIB19","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 Implications, I","volume":"1","author":"Gabbay","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB20","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear Logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90036-G_BIB22","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"},{"issue":"2","key":"10.1016\/0743-1066(93)90036-G_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1093\/logcom\/1.2.261","article-title":"A Proof-Theoretic Approach to Logic Programming: I. Clauses as Rules","volume":"1","author":"Halln\u00e4ss","year":"1990","journal-title":"J. Logic and Comput."},{"issue":"5","key":"10.1016\/0743-1066(93)90036-G_BIB24","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1093\/logcom\/1.5.635","article-title":"A Proof-Theoretic Approach to Logic Programming: II. Programs as Definitions","volume":"1","author":"Halln\u00e4ss","year":"1991","journal-title":"J. Logic and Comput."},{"key":"10.1016\/0743-1066(93)90036-G_BIB25","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/LICS.1991.151628","article-title":"Logic Programming in a Fragment of Intuitionistic Linear Logic (Extended Abstract)","author":"Hodas","year":"1991","journal-title":"Proceedings of the Sixth Annual Symposium on Logic in Computer Science"},{"key":"10.1016\/0743-1066(93)90036-G_BIB26","first-page":"119","article-title":"Der Minimalkalk\u00fcl, ein Reduzierter Intuitionistischer Formalismus","volume":"4","author":"Johansson","year":"1937","journal-title":"Compositio Math."},{"key":"10.1016\/0743-1066(93)90036-G_BIB27","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-16780-3_97","article-title":"Formulation of Induction Formulas in Verification of PROLOG Programs","author":"Kanamori","year":"1986","journal-title":"Proceedings of the Eight International Conference on Automated Deduction"},{"key":"10.1016\/0743-1066(93)90036-G_BIB28","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(93)90036-G_BIB29","first-page":"121","article-title":"Computing Circumscription","author":"Lifschitz","year":"1985","journal-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB30","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"177","article-title":"On the Declarative Semantics of Logic Programs with Negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0743-1066(93)90036-G_BIB31","series-title":"Ph.D. thesis","article-title":"A Study of Nonmonotonic Reasoning","author":"Lin","year":"1991"},{"key":"10.1016\/0743-1066(93)90036-G_BIB32","first-page":"374","article-title":"Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples","volume":"Vol. 185","author":"Makowsky","year":"1985"},{"key":"10.1016\/0743-1066(93)90036-G_BIB33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription: A Form of Non-Monotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB34","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of Circumscription to Formalizing Common-Sense Knowledge","volume":"28","author":"McCarthy","year":"1986","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/0743-1066(93)90036-G_BIB35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(88)90005-2","article-title":"Clausal Intuitionistic Logic I. Fixed-Point Semantics","volume":"5","author":"McCarthy","year":"1988","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0743-1066(93)90036-G_BIB36","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(88)90014-3","article-title":"Clausal Intuitionistic Logic. II. Tableau Proof Procedures","volume":"5","author":"McCarty","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB37","series-title":"Proceedings of the Second International Conference on Artificial Intelligence and Law","first-page":"180","article-title":"A Language for Legal Discourse. I. Basic Features","author":"McCarty","year":"1989"},{"key":"10.1016\/0743-1066(93)90036-G_BIB38","series-title":"Proceedings of the First International Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"211","article-title":"Circumscribing Embedded Implications","author":"McCarty","year":"1991"},{"key":"10.1016\/0743-1066(93)90036-G_BIB39","series-title":"Technical Report","article-title":"Computing with Prototypes","author":"McCarty","year":"1993"},{"key":"10.1016\/0743-1066(93)90036-G_BIB40","series-title":"Proceedings of the Tenth International Conference on Logic Programming","first-page":"44","article-title":"Proving Inductive Properties of PROLOG Programs in Second-Order Intuitionistic Logic","author":"McCarty","year":"1993"},{"key":"10.1016\/0743-1066(93)90036-G_BIB41","first-page":"890","article-title":"Indefinite Reasoning with Definite Rules","author":"McCarty","year":"1991","journal-title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB42","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR92)","first-page":"59","article-title":"Reasoning about Indefinite Actions","author":"McCarty","year":"1992"},{"key":"10.1016\/0743-1066(93)90036-G_BIB43","series-title":"Logic Programming and Non-Monotonic Reasoning: Proceedings of the Second International Workshops","first-page":"417","article-title":"An Intuitionistic Interpretation of Finite and Infinite Failure","author":"McCarty","year":"1993"},{"key":"10.1016\/0743-1066(93)90036-G_BIB44","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-1066(89)90031-9","article-title":"A Logical Analysis of Modules in Logic Programming","volume":"6","author":"Miller","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB45","first-page":"268","article-title":"Lexical Scoping as Universal Quantification","author":"Miller","year":"1989","journal-title":"Proceedings of the Sixth International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB46","first-page":"810","article-title":"An Overview of \u039bPROLOG","author":"Nadathur","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(93)90036-G_BIB47","doi-asserted-by":"crossref","first-page":"270","DOI":"10.3115\/982023.982056","article-title":"A Definite Clause Version of Categorial Grammar","author":"Pareschi","year":"1988","journal-title":"Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics"},{"key":"10.1016\/0743-1066(93)90036-G_BIB48","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the Declarative Semantics of Stratified Deductive Databases and Logic Programming","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(93)90036-G_BIB49","first-page":"418","article-title":"Circumscription Implies Predicate Completion (Sometimes)","author":"Reiter","year":"1982","journal-title":"Proceedings of the Second National Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90036-G_BIB50","first-page":"327","article-title":"Hypothetical Reasoning and Definitional Reflection in Logic Programming","volume":"Vol. 475","author":"Schroeder-Heister","year":"1990"},{"key":"10.1016\/0743-1066(93)90036-G_BIB51","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A Lattice-Theoretical Fixpoint Theorem and Its Applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0743-1066(93)90036-G_BIB52","series-title":"Constructivism in Mathematics: An Introduction","author":"Troelstra","year":"1988"},{"key":"10.1016\/0743-1066(93)90036-G_BIB53","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2272559","article-title":"Semantics for Relevant Logics","volume":"37","author":"Urquhart","year":"1972","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0743-1066(93)90036-G_BIB54","article-title":"Recursively Indefinite Databases","author":"van","year":"1990","journal-title":"Proceedings of the International Conference on Database Theory"},{"issue":"4","key":"10.1016\/0743-1066(93)90036-G_BIB55","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","year":"1976","journal-title":"J. ACM."},{"key":"10.1016\/0743-1066(93)90036-G_BIB56","first-page":"1","article-title":"The Alternating Fixpoint of Logic Programs with Negation","author":"Van","year":"1989","journal-title":"Proceedings of the Eight ACM Symposium on the Principles of Database Systems"},{"key":"10.1016\/0743-1066(93)90036-G_BIB57","first-page":"620","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van","year":"1991","journal-title":"J. ACM"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390036G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390036G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T16:36:16Z","timestamp":1704213376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669390036G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":57,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["074310669390036G"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)90036-g","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}