{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:34:22Z","timestamp":1648650862437},"reference-count":36,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1987,12,1]],"date-time":"1987-12-01T00:00:00Z","timestamp":565315200000},"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":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1987,12]]},"DOI":"10.1016\/0169-023x(87)90022-x","type":"journal-article","created":{"date-parts":[[2003,12,2]],"date-time":"2003-12-02T07:08:25Z","timestamp":1070348905000},"page":"259-284","source":"Crossref","is-referenced-by-count":8,"title":["Coping with indefinite and negative data in deductive databases: A survey"],"prefix":"10.1016","volume":"2","author":[{"given":"P.","family":"Chisholm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Ferbrache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Thanisch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.H.","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(87)90022-X_BIB1","series-title":"Proc. 5th Conference on Principles of Database Systems","first-page":"123","article-title":"Positivism vs. minimalism in deductive databases","author":"Bidoit","year":"1986"},{"key":"10.1016\/0169-023X(87)90022-X_BIB2","first-page":"350","article-title":"Minimalism subsumes default logic and circumscription in stratified logic programming","author":"Bidoit","year":"1987"},{"key":"10.1016\/0169-023X(87)90022-X_BIB3","first-page":"239","article-title":"Nonmonotonic reasoning and databases","volume":"Vol. 2","author":"Bossu","year":"1984"},{"key":"10.1016\/0169-023X(87)90022-X_BIB4","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\/0169-023X(87)90022-X_BIB5","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negations as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0169-023X(87)90022-X_BIB6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A relational model of data for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0169-023X(87)90022-X_BIB7","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. ACM"},{"key":"10.1016\/0169-023X(87)90022-X_BIB8","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. Intelligence"},{"key":"10.1016\/0169-023X(87)90022-X_BIB9","series-title":"Introduction to Knowledge Base Systems","author":"Frost","year":"1986"},{"issue":"1","key":"10.1016\/0169-023X(87)90022-X_BIB10","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"},{"issue":"2","key":"10.1016\/0169-023X(87)90022-X_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and databases: a deductive approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0169-023X(87)90022-X_BIB12","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\/0169-023X(87)90022-X_BIB13","first-page":"247","article-title":"Answering queries in indefinite databases and the null value problem","volume":"3","author":"Grant","year":"1986","journal-title":"Adv. Comput. Res."},{"key":"10.1016\/0169-023X(87)90022-X_BIB14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(86)90068-8","article-title":"Making believers out of computers","volume":"30","author":"Levesque","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0169-023X(87)90022-X_BIB15","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\/0169-023X(87)90022-X_BIB16","article-title":"Computing circumscription","volume":"Vol. 1","author":"Lifschitz","year":"1985"},{"key":"10.1016\/0169-023X(87)90022-X_BIB17","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\/0169-023X(87)90022-X_BIB18","first-page":"77","article-title":"Incomplete information in databases","author":"Lipski","year":"1984"},{"key":"10.1016\/0169-023X(87)90022-X_BIB19","series-title":"Foundation of Logic Programming","author":"Lloyd","year":"1984"},{"issue":"3","key":"10.1016\/0169-023X(87)90022-X_BIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0743-1066(84)90011-6","article-title":"Making Prolog more expensive","volume":"1","author":"Lloyd","year":"1984","journal-title":"J. Logic Programming"},{"issue":"2","key":"10.1016\/0169-023X(87)90022-X_BIB21","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A basis for deductive database systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/0169-023X(87)90022-X_BIB22","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0743-1066(86)90004-X","article-title":"A basis for deductive database systems II","volume":"3","author":"Lloyd","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0169-023X(87)90022-X_BIB23","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0169-023X(87)90022-X_BIB24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription \u2014 a form of non-monotonic reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0169-023X(87)90022-X_BIB25","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0004-3702(80)90016-8","article-title":"Circumscription and other non-monotononic formalisms","volume":"13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0169-023X(87)90022-X_BIB26","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"},{"key":"10.1016\/0169-023X(87)90022-X_BIB27","series-title":"Proc. 6th Conference on Automated Deduction","first-page":"292","article-title":"On indefinite databases and the closed world assumption","volume":"138","author":"Minker","year":"1982"},{"key":"10.1016\/0169-023X(87)90022-X_BIB28","series-title":"Proc. 7th International Conference on Automated Deduction","article-title":"Applications of protected circumscription","author":"Minker","year":"1984"},{"key":"10.1016\/0169-023X(87)90022-X_BIB29","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0743-1066(85)80002-9","article-title":"Computing protected circumscription","volume":"2","author":"Minker","year":"1985","journal-title":"J. Logic Programming"},{"key":"10.1016\/0169-023X(87)90022-X_BIB30","series-title":"Proc. International Conference on Database Theory","article-title":"Some extensions to the closed-world assumption in databases","author":"Naqvi","year":"1986"},{"key":"10.1016\/0169-023X(87)90022-X_BIB31","series-title":"Foundations of Deductive Databases and Logic Programming","article-title":"On the semantics of stratified deductive databases","author":"Przymusinski","year":"1986"},{"key":"10.1016\/0169-023X(87)90022-X_BIB32","series-title":"Logic and Data Bases","first-page":"55","article-title":"On closed world data bases","author":"Reiter","year":"1978"},{"key":"10.1016\/0169-023X(87)90022-X_BIB33","series-title":"Proc. International Joint Conference on Artificial Intelligence","first-page":"418","article-title":"Circumscription implies predicate completion (Sometimes)","author":"Reiter","year":"1982"},{"issue":"1","key":"10.1016\/0169-023X(87)90022-X_BIB34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0169-023X(87)90022-X_BIB35","series-title":"Proc. 4th ACM Symposium on Principles of Database Systems","first-page":"57","article-title":"Querying logical databases","author":"Vardi","year":"1985"},{"key":"10.1016\/0169-023X(87)90022-X_BIB36","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. Automated Reasoning"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X8790022X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X8790022X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T11:29:27Z","timestamp":1550316567000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X8790022X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,12]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1987,12]]}},"alternative-id":["0169023X8790022X"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(87)90022-x","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,12]]}}}