{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:37:24Z","timestamp":1648586244791},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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,6]]},"DOI":"10.1016\/0004-3702(89)90029-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"251-262","source":"Crossref","is-referenced-by-count":4,"title":["The importance of open and recursive circumscription"],"prefix":"10.1016","volume":"39","author":[{"given":"Philippe","family":"Besnard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Moinard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert E.","family":"Mercer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(89)90029-5_BIB1","author":"Besnard","year":"1988"},{"key":"10.1016\/0004-3702(89)90029-5_BIB2","series-title":"Proceedings ECAI-88","first-page":"516","article-title":"A formula circumscriptively both valid and unprovable","author":"Besnard","year":"1988"},{"key":"10.1016\/0004-3702(89)90029-5_BIB3","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)90029-5_BIB4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(80)90013-2","article-title":"The mathematics of non-monotonic reasoning","volume":"13","author":"Davis","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90029-5_BIB5","first-page":"391","article-title":"Circumscription and implicit definability","volume":"1","author":"Doyle","year":"1985","journal-title":"Autom. Reasoning"},{"key":"10.1016\/0004-3702(89)90029-5_BIB6","author":"Etherington","year":"1988"},{"key":"10.1016\/0004-3702(89)90029-5_BIB7","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)90029-5_BIB8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(86)90028-7","article-title":"On the satisfiability of circumscription","volume":"28","author":"Lifschitz","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90029-5_BIB9","series-title":"Proceedings AAAI-86","first-page":"406","article-title":"Pointwise circumscription: Preliminary report","author":"Lifschitz","year":"1986"},{"key":"10.1016\/0004-3702(89)90029-5_BIB10","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\/0004-3702(89)90029-5_BIB11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Application of circumscription to formalizing common-sense knowledge","volume":"28","author":"McCarthy","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90029-5_BIB12","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(87)90082-8","article-title":"A theorem on the consistency of circumscription","volume":"31","author":"Mott","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90029-5_BIB13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(86)90029-9","article-title":"Completeness results for circumscription","volume":"28","author":"Perlis","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(89)90029-5_BIB14","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)90029-5_BIB15","author":"van Dalen","year":"1983"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370289900295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:21:44Z","timestamp":1553646104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370289900295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0004370289900295"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(89)90029-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}