{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T12:39:30Z","timestamp":1778675970302,"version":"3.51.4"},"reference-count":32,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":7749,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IRI-87-22886"],"award-info":[{"award-number":["IRI-87-22886"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["AFOSR-88-0266"],"award-info":[{"award-number":["AFOSR-88-0266"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004316","name":"International Business Machines Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004316","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0743-1066(92)90019-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["A procedural semantics for well-founded negation in logic programs"],"prefix":"10.1016","volume":"13","author":[{"given":"Kenneth A.","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(92)90019-Y_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB2","article-title":"Acyclic Programs","author":"Apt","year":"1990","journal-title":"Proceedings of the Seventh International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB3","article-title":"Continuity, Consistency, and Completeness Properties for Logic Programs","author":"Cavedon","year":"1989","journal-title":"Proceedings of the Sixth International Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB4","article-title":"Constructive Negation Based on the Completed Database","author":"Chan","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn Clause Queries and Generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB6","series-title":"Logic and Databases","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB7","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"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB8","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(92)90019-Y_BIB9","article-title":"Completeness of the Negation-as-Failure Rule","author":"Jaffar","year":"1983","journal-title":"Proceedings of the International Joint Conference on Artificial Intelligence"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB10","article-title":"Completeness of a Top Down Query Evaluation Procedure for Stratified Databases","author":"Kemp","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB11","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in Logic Programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF00243794","article-title":"Explicit Representation of Terms Defined by Counter Examples","volume":"3","author":"Lassez","year":"1987","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB13","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB14","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Equivalences of Logic Programs","author":"Maher","year":"1988"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription\u2014a Form of Non-Monotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artif. Intell."},{"key":"10.1016\/0743-1066(92)90019-Y_BIB16","series-title":"Proceedings of the Sixth Conference on Automated Deduction","article-title":"On Indefinite Databases and the Closed World Assumption","author":"Minker","year":"1982"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB17","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB18","article-title":"Weakly Perfect Model Semantics for Logic Programs","author":"Przymusinska","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB19","doi-asserted-by":"crossref","DOI":"10.1145\/73721.73723","article-title":"Every Logic Program Has a Natural Stratification and an Iterated Fixed Point Model","author":"Przymusinski","year":"1989","journal-title":"ACM Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB20","article-title":"On Constructive Negation in Logic Programming","author":"Przymusinski","year":"1989","journal-title":"Proceedings, North American Conference on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB21","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF00243002","article-title":"On the Declarative and Procedural Semantics of Logic Programs","volume":"5","author":"Przymusinski","year":"1989","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB22","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB23","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","article-title":"Inferring negative Information from Disjunctive Databases","volume":"4","author":"Ross","year":"1988","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB24","article-title":"A Procedural Semantics for Well-Founded Negation in Logic Programs","author":"Ross","year":"1989","journal-title":"Proceedings of the Eighth ACM Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB25","article-title":"Modular Acyclicity and Tail Recursion in Logic Programs","author":"Ross","year":"1991","journal-title":"Proceedings of the Tenth ACM Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB26","article-title":"A Query Evaluation Method of Stratified Programs Under the Extended cwa","author":"Seki","year":"1988","journal-title":"Proceedings of the Fifth International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB27","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","article-title":"Negation as Failure, II","volume":"2","author":"Shepherdson","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB28","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/0743-1066(92)90019-Y_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":"JACM"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB30","series-title":"Proceedings of the Third IEEE Symposium on Logic Programming","article-title":"Negation as Failure Using Tight Derivations for General Logic Programs","author":"Van Gelder","year":"1988"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB31","doi-asserted-by":"crossref","DOI":"10.1145\/308386.308444","article-title":"Unfounded Sets and Well-Founded Semantics for General Logic Programs","author":"Van Gelder","year":"1988","journal-title":"Proceedings of the Seventh ACM Symposium on Principles of Database Systems"},{"key":"10.1016\/0743-1066(92)90019-Y_BIB32","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","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:074310669290019Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669290019Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:01Z","timestamp":1757514481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669290019Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["074310669290019Y"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(92)90019-y","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A procedural semantics for well-founded negation in logic programs","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-1066(92)90019-Y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}