{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,9]],"date-time":"2023-01-09T23:12:21Z","timestamp":1673305941439},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":6684,"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":[[1995,4]]},"DOI":"10.1016\/0743-1066(94)00026-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T03:40:06Z","timestamp":1052797206000},"page":"63-86","source":"Crossref","is-referenced-by-count":3,"title":["Negation and minimality in disjunctive databases"],"prefix":"10.1016","volume":"23","author":[{"given":"Marco","family":"Schaerf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)00026-3_BIB1","series-title":"Foundation of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(94)00026-3_BIB2","series-title":"Proceedings of the International Joint Conference and Symposium on Logic Programming (IJCSLP-92)","first-page":"379","article-title":"Propositional semantics for disjunctive logic programs","author":"Ben-Eliyahu","year":"1992"},{"key":"10.1016\/0743-1066(94)00026-3_BIB3","series-title":"Proceedings of the Fifth ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS-86)","first-page":"123","article-title":"Positivism versus minimalism in deductive databases","author":"Bidoit","year":"1986"},{"key":"10.1016\/0743-1066(94)00026-3_BIB4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(89)90004-4","article-title":"Minimalism, justification and non-monotonicity in deductive databases","volume":"38","author":"Bidoit","year":"1989","journal-title":"Journal of Computer and System Science"},{"key":"10.1016\/0743-1066(94)00026-3_BIB5","article-title":"The complexity of propositional closed world reasoning and circumscription","author":"Cadoli","year":"1993"},{"key":"10.1016\/0743-1066(94)00026-3_BIB6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","article-title":"A survey of complexity results for non-monotonic logics","volume":"17","author":"Cadoli","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00026-3_BIB7","series-title":"Proceedings of the Tenth International Conference on Logic Programming (ICLP-94)","article-title":"Stratifying disjunctive logic programs","author":"Dix","year":"1994"},{"key":"10.1016\/0743-1066(94)00026-3_BIB8","article-title":"Complexity results for disjunctive logic programming and application to nonmonotonic logics","author":"Eiter","year":"1992"},{"key":"10.1016\/0743-1066(94)00026-3_BIB9","series-title":"Proceedings of the Twelfth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS-93)","first-page":"158","article-title":"Complexity aspects of various semantics for disjunctive databases","author":"Eiter","year":"1993"},{"key":"10.1016\/0743-1066(94)00026-3_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0304-3975(93)90073-3","article-title":"Propositional circumscription and extended closed world reasoning are \u220f2p-complete","author":"Eiter","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00026-3_BIB11","series-title":"Proceedings of the International Conference on Database Theory (ICDT-92)","first-page":"21","article-title":"Semantics of disjunctive deductive databases","author":"Fernandez","year":"1992"},{"key":"10.1016\/0743-1066(94)00026-3_BIB12","series-title":"Proceedings of the Fifth Logic Programming Symposium","first-page":"1070","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(94)00026-3_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(94)00026-3_BIB14","series-title":"Proceedings of the Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91)","first-page":"230","article-title":"Disjunctive defaults","author":"Gelfond","year":"1991"},{"key":"10.1016\/0743-1066(94)00026-3_BIB15","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90068-4","article-title":"On the relationship between circumscription and negation as failure","volume":"38","author":"Gelfond","year":"1989","journal-title":"Artificial Intelligence Journal"},{"key":"10.1016\/0743-1066(94)00026-3_BIB16","article-title":"A catalog of complexity classes","volume":"vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/0743-1066(94)00026-3_BIB17","series-title":"Proceedings of the Third International Conference on Data and Knowledge Bases","first-page":"416","article-title":"Non-deterministic choice in datalog","author":"Krishnamurthy","year":"1988"},{"key":"10.1016\/0743-1066(94)00026-3_BIB18","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"issue":"3","key":"10.1016\/0743-1066(94)00026-3_BIB19","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","article-title":"Autoepistemic logic","volume":"38","author":"Marek","year":"1991","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00026-3_BIB20","series-title":"Proceedings of the First international Workshop on Logic Programming and Non Monotonic Reasoning","first-page":"37","article-title":"Computing intersection of autoepistemic expansions","author":"Marek","year":"1991"},{"key":"10.1016\/0743-1066(94)00026-3_BIB21","series-title":"Proceedings of the Sixth Conference on Automated Deduction (CADE-82)","first-page":"292","article-title":"On indefinite databases and the closed world assumption","author":"Minker","year":"1982"},{"key":"10.1016\/0743-1066(94)00026-3_BIB22","series-title":"Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems (ISMIS-93)","first-page":"1","article-title":"On extended disjunctive logic programs","author":"Minker","year":"1993"},{"key":"10.1016\/0743-1066(94)00026-3_BIB23","series-title":"Proceedings of the Eleventh ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS-92)","first-page":"16","article-title":"Tie-breaking semantics and structural totality","author":"Papadimitriou","year":"1992"},{"key":"10.1016\/0743-1066(94)00026-3_BIB24","series-title":"Foundation of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the declarative semantics of stratified deductive databases and logic programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(94)00026-3_BIB25","series-title":"Proceedings of the Second International Conference on Deductive and Object-Oriented Databases (DOOD-91)","first-page":"85","article-title":"Semantics of disjunctive logic programs and deductive databases","author":"Przymusinski","year":"1991"},{"key":"10.1016\/0743-1066(94)00026-3_BIB26","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable semantics for disjunctive programs","volume":"9","author":"Przymusinski","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(94)00026-3_BIB27","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00248321","article-title":"Weak generalized closed world assumption","volume":"5","author":"Rajasekar","year":"1989","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/0743-1066(94)00026-3_BIB28","series-title":"Logic and Data Bases","first-page":"119","article-title":"On closed world data bases","author":"Reiter","year":"1978"},{"key":"10.1016\/0743-1066(94)00026-3_BIB29","series-title":"Proceedings of the Ninth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (PODS-90)","first-page":"205","article-title":"Stable models and non-determinism in logic programs with negation","author":"Sacc\u00e0","year":"1990"},{"key":"10.1016\/0743-1066(94)00026-3_BIB30","series-title":"Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89)","first-page":"369","article-title":"Possible model semantics for disjunctive databases","author":"Sakama","year":"1989"},{"key":"10.1016\/0743-1066(94)00026-3_BIB31","series-title":"Advances in Artificial Intelligence","first-page":"132","article-title":"Logic programming and autoepistemic logics: New relations and complexity results","volume":"vol. 728","author":"Schaerf","year":"1993"},{"key":"10.1016\/0743-1066(94)00026-3_BIB32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial-time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00026-3_BIB33","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/PGEC.1967.264648","article-title":"Generalized consensus theory and application to the minimization of Boolean functions","author":"Tison","year":"1967","journal-title":"IEEE Transactions on Electronic Computers EC-4"},{"issue":"4","key":"10.1016\/0743-1066(94)00026-3_BIB34","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":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00026-3_BIB35","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":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00026-3_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":"Journal of Automated Reasoning"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694000263?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106694000263?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:21:18Z","timestamp":1555424478000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106694000263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["0743106694000263"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)00026-3","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}