{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:01:40Z","timestamp":1775818900237,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1989,2]]},"DOI":"10.1016\/0004-3702(89)90068-4","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"75-94","source":"Crossref","is-referenced-by-count":102,"title":["On the relationship between circumscription and negation as failure"],"prefix":"10.1016","volume":"38","author":[{"given":"Michael","family":"Gelfond","sequence":"first","affiliation":[]},{"given":"Halina","family":"Przymusinska","sequence":"additional","affiliation":[]},{"given":"Teodor","family":"Przymusinski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(89)90068-4_BIB1","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0004-3702(89)90068-4_BIB2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","article-title":"Saturation, nonmonotonic reasoning and the closed world assumption","volume":"25","author":"Bossu","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn clause queries and generalizations","volume":"1","author":"Chandra","year":"1985","journal-title":"J. Logic Program."},{"key":"10.1016\/0004-3702(89)90068-4_BIB4","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0004-3702(89)90068-4_BIB5","article-title":"Reasoning with incomplete information, investigations of non-monotonic reasoning","author":"Etherington","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1111\/j.1467-8640.1985.tb00055.x","article-title":"On the adequacy of predicate circumscription for closed-world reasoning","volume":"1","author":"Etherington","year":"1985","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(89)90068-4_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":"4","author":"Fitting","year":"1985","journal-title":"J. Logic Program."},{"key":"10.1016\/0004-3702(89)90068-4_BIB8","series-title":"Modal provability foundations for negation as failure I","author":"Gabbay","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(86)90001-9","article-title":"Negation as failure: Careful closure procedure","volume":"30","author":"Gelfond","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB10","series-title":"Proceedings ACM SIGART International Symposium on Methodologies for Intelligent Systems","first-page":"256","article-title":"On the relationship between autoepistemic logic and parallel circumscription","author":"Gelfond","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB11","series-title":"Proceedings ACM SIGACT-SIGMOD Symposium on Principles of Database Systems","first-page":"133","article-title":"The extended closed world assumption and its relationship to parallel circumscription","author":"Gelfond","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB12","unstructured":"Gelfond, M., Przymusinska, H. and Pryzymusinski, T., On the relationship between circumscription and negation as failure II (in preparation)."},{"key":"10.1016\/0004-3702(89)90068-4_BIB13","series-title":"Answering queries in indefinite databases and the null value problem","author":"Grant","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB14","unstructured":"Hewitt, C., Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot, AI Memo 251, MIT Project MAC, Cambridge, MA."},{"key":"10.1016\/0004-3702(89)90068-4_BIB15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","article-title":"Results on translating defaults to circumscription","volume":"32","author":"Imielinski","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB16","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the declarative semantics of logic programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0004-3702(89)90068-4_BIB17","series-title":"Proceedings IJCAI-85","first-page":"121","article-title":"Computing circumscription","author":"Lifschitz","year":"1985"},{"key":"10.1016\/0004-3702(89)90068-4_BIB18","series-title":"Proceedings AAAI-86","first-page":"406","article-title":"Pointwise circumscription","author":"Lifschitz","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0004-3702(85)90055-4","article-title":"Closed-world databases and circumscription","volume":"27","author":"Lifschitz","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB20","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0004-3702(89)90068-4_BIB21","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":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB22","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\/0004-3702(89)90068-4_BIB23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","article-title":"Non-monotonic logic II: Non-monotonic modal theories","volume":"29","author":"McDermott","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(89)90068-4_BIB24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Non-monotonic logic I","volume":"13","author":"McDermott","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB25","series-title":"Proceedings Sixth Conference on Automated Deduction","first-page":"292","article-title":"On indefinite data bases and the closed world assumption","author":"Minker","year":"1982"},{"key":"10.1016\/0004-3702(89)90068-4_BIB26","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantic considerations on nonmonotonic logic","volume":"25","author":"Moore","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB27","series-title":"A logic for negation in database systems","author":"Naqvi","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB28","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative and procedural semantics of stratified deductive databases","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0004-3702(89)90068-4_BIB29","series-title":"Proceedings AAAI-86","first-page":"186","article-title":"Query answering in circumscriptive and closed-world theories","author":"Przymusinski","year":"1986"},{"key":"10.1016\/0004-3702(89)90068-4_BIB30","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90068-4_BIB31","series-title":"On Conceptual Modeling","article-title":"Towards a logical reconstruction of relational database theory","author":"Reiter","year":"1984"},{"key":"10.1016\/0004-3702(89)90068-4_BIB32","series-title":"Logic and Data Bases","first-page":"55","article-title":"On closed-world data bases","author":"Reiter","year":"1978"},{"key":"10.1016\/0004-3702(89)90068-4_BIB33","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"},{"key":"10.1016\/0004-3702(89)90068-4_BIB34","series-title":"Proceedings AAAI-82","first-page":"418","article-title":"Circumscription implies predicate completion (sometimes)","author":"Reiter","year":"1982"},{"key":"10.1016\/0004-3702(89)90068-4_BIB35","series-title":"PROLOG, manuel de reference et d'utilisation","author":"Roussel","year":"1985"},{"issue":"1","key":"10.1016\/0004-3702(89)90068-4_BIB36","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as failure: A comparison of Clarke's completed data bases and Reiter's closed world assumption","volume":"1","author":"Shepherdson","year":"1984","journal-title":"J. Logic Program."},{"issue":"4","key":"10.1016\/0004-3702(89)90068-4_BIB37","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"3","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(89)90068-4_BIB38","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"149","article-title":"Negation as failure using tight derivations for general logic programs","author":"van Gelder","year":"1988"},{"issue":"2","key":"10.1016\/0004-3702(89)90068-4_BIB39","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","article-title":"Deduction in non-Horn databases","volume":"1","author":"Yahya","year":"1985","journal-title":"J. Autom. Reasoning"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900684?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900684?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T20:20:51Z","timestamp":1553631651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370289900684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0004370289900684"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(89)90068-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}