{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:48Z","timestamp":1760202468026},"reference-count":42,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6255,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,6]]},"DOI":"10.1016\/0304-3975(95)00192-1","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"321-363","source":"Crossref","is-referenced-by-count":20,"title":["Querying disjunctive databases through nonmonotonic logics"],"prefix":"10.1016","volume":"160","author":[{"given":"Piero A.","family":"Bonatti","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00192-1_BIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0304-3975(51)90007-2","article-title":"On the representation and querying of sets of possible worlds","volume":"78","author":"Abiteboul","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00192-1_BIB2","series-title":"Theoretical Studies in Computer Science","article-title":"Expressive power of query languages","author":"Abiteboul","year":"1992"},{"key":"10.1016\/0304-3975(95)00192-1_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF00881911","article-title":"Autoepistemic logic programming","volume":"13","author":"Bonatti","year":"1994","journal-title":"J. Automat. Reasoning"},{"key":"10.1016\/0304-3975(95)00192-1_BIB4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0743-1066(94)00022-X","article-title":"Autoepistemic logics as a unifying framework for the semantics of logic programs","volume":"22","author":"Bonatti","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(95)00192-1_BIB5","series-title":"Proc. 4th Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-94)","first-page":"99","article-title":"Using default logic as a query language","author":"Cadoli","year":"1994"},{"key":"10.1016\/0304-3975(95)00192-1_BIB6","series-title":"Proc. PODS-88","article-title":"Theory of database queries","author":"Chandra","year":"1988"},{"key":"10.1016\/0304-3975(95)00192-1_BIB7","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":"Journal of Logic Programming"},{"key":"10.1016\/0304-3975(95)00192-1_BIB8","series-title":"Proc. 13th ACM SIGACT SIGMOD-SIGART Symp. on Principles of Database Systems (PODS-94)","first-page":"267","article-title":"Adding disjunction to datalog","author":"Eiter","year":"1994"},{"key":"10.1016\/0304-3975(95)00192-1_BIB9","series-title":"Reasoning with Incomplete Information","author":"Etherington","year":"1988"},{"key":"10.1016\/0304-3975(95)00192-1_BIB10","series-title":"Proc. of PODS-83","first-page":"352","article-title":"On the semantics of updates in databases","author":"Fagin","year":"1983"},{"key":"10.1016\/0304-3975(95)00192-1_BIB11","series-title":"Proc. ICDT-92","first-page":"21","article-title":"Semantics of disjunctive deductive databases","author":"Fern\u00e1ndez","year":"1992"},{"key":"10.1016\/0304-3975(95)00192-1_BIB12","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 Comput."},{"key":"10.1016\/0304-3975(95)00192-1_BIB13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity results for nonmonotonic logics","volume":"2","author":"Gottlob","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/0304-3975(95)00192-1_BIB14","article-title":"The Problem of Incomplete Information in Relational Databases","volume":"Vol. 554","author":"Grahne","year":"1991"},{"key":"10.1016\/0304-3975(95)00192-1_BIB15","series-title":"Proc. 2nd Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-91)","first-page":"269","article-title":"Updates and counterfactuals","author":"Grahne","year":"1991"},{"key":"10.1016\/0304-3975(95)00192-1_BIB16","series-title":"Proc. 5th Internal. Conf. on Database Theory (ICDT'95)","first-page":"82","article-title":"DATALOG queries with stratified negation and choice","volume":"Vol. 893","author":"Greco","year":"1995"},{"key":"10.1016\/0304-3975(95)00192-1_BIB17","series-title":"Trends in Theoretical Computer Science","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1988"},{"key":"10.1016\/0304-3975(95)00192-1_BIB18","doi-asserted-by":"crossref","first-page":"760","DOI":"10.1137\/0216051","article-title":"Languages that capture complexity classes","volume":"16","author":"Immerman","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00192-1_BIB19","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform. Processing Lett."},{"key":"10.1016\/0304-3975(95)00192-1_BIB20","article-title":"Elements of relational database theory","volume":"Vol. B","author":"Kanellakis","year":"1990"},{"key":"10.1016\/0304-3975(95)00192-1_BIB21","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","article-title":"Hard problems for simple default logics","volume":"49","author":"Kautz","year":"1991","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB22","series-title":"Proc. PODS-90","first-page":"61","article-title":"On the expressive power of datalog: tools and a case study","author":"Kolaitis","year":"1990"},{"key":"10.1016\/0304-3975(95)00192-1_BIB23_1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","article-title":"On the relationship between default and autoepistemic logic","volume":"35","author":"Konolige","year":"1988","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB23_2","first-page":"115","article-title":"Errata","volume":"41","author":"Konolige","year":"1989","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB24","series-title":"Proc. IJCAI-89","article-title":"On the relation between autoepistemic logic and circumscription","author":"Konolige","year":"1989"},{"key":"10.1016\/0304-3975(95)00192-1_BIB25","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(90)90056-6","article-title":"All i know: A study in autoepistemic logic","volume":"42","author":"Levesque","year":"1990","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB26","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"key":"10.1016\/0304-3975(95)00192-1_BIB27","series-title":"Non-Monotonic Reasoning","author":"Lukasiewicz","year":"1990"},{"key":"10.1016\/0304-3975(95)00192-1_BIB28","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","article-title":"Autoepistemic logic","volume":"38","author":"Marek","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(95)00192-1_BIB29","series-title":"Nonmonotonic Logics \u2014 Context-Dependent Reasoning","author":"Marek","year":"1993"},{"key":"10.1016\/0304-3975(95)00192-1_BIB30","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical considerations on nonmonotonic logics","volume":"25","author":"Moore","year":"1985","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB31","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\/0304-3975(95)00192-1_BIB32","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 Comput."},{"key":"10.1016\/0304-3975(95)00192-1_BIB33","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0004-3702(91)90013-A","article-title":"Three-valued nonmonotonic formalisms and semantics of logic programming","volume":"49","author":"Przymusinski","year":"1991","journal-title":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB34","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":"Artif. Intelligence"},{"key":"10.1016\/0304-3975(95)00192-1_BIB35_1","doi-asserted-by":"crossref","DOI":"10.1006\/jcss.1995.1053","article-title":"The expressive powers of logic programming semantics","author":"Schlipf","year":"1990"},{"key":"10.1016\/0304-3975(95)00192-1_BIB35_2","series-title":"Proc. PODS-90","first-page":"196","author":"Schlipf","year":"1990"},{"key":"10.1016\/0304-3975(95)00192-1_BIB36","series-title":"Proc. AAAI-92","first-page":"794","article-title":"The complexity of propositional default logic","author":"Stillman","year":"1992"},{"key":"10.1016\/0304-3975(95)00192-1_BIB37","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(95)00192-1_BIB38","series-title":"Proc. 14th STOC","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0304-3975(95)00192-1_BIB39","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0022-0000(86)90016-4","article-title":"Querying logical databases","volume":"33","author":"Vardi","year":"1986","journal-title":"J. Comput. and System Sci."},{"key":"10.1016\/0304-3975(95)00192-1_BIB40","series-title":"Updating Logical Databases","author":"Winslett","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001921?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595001921?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T05:26:51Z","timestamp":1556256411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595001921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0304397595001921"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00192-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}