{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:01:32Z","timestamp":1775818892260,"version":"3.50.1"},"reference-count":159,"publisher":"Elsevier BV","issue":"2-4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7200,"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":[[1993,11]]},"DOI":"10.1016\/0743-1066(93)90029-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"127-160","source":"Crossref","is-referenced-by-count":75,"title":["A survey of complexity results for non-monotonic logics"],"prefix":"10.1016","volume":"17","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(93)90029-G_BIB1","first-page":"1112","article-title":"Computational Complexity of Hypothesis Assembly","author":"Allemang","year":"1987","journal-title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB2","first-page":"3","article-title":"The Generalized Completeness of Horn Predicate Logic as a Programming Language","volume":"4","author":"Andreka","year":"1978","journal-title":"Acta Cybernet."},{"key":"10.1016\/0743-1066(93)90029-G_BIB3","article-title":"Introduction to Logic Programming","volume":"vol. B","author":"Apt","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF03037168","article-title":"Acyclic Programs","volume":"9","author":"Apt","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/0743-1066(93)90029-G_BIB5_1","first-page":"1","article-title":"Arithmetic Classification of Perfect Models of Stratified Programs","volume":"13","author":"Apt","year":"1990","journal-title":"Fund. Inform."},{"key":"10.1016\/0743-1066(93)90029-G_BIB5_2","first-page":"339","article-title":"Arithmetic Classification of Perfect Models of Stratified Programs","volume":"14","author":"Apt","year":"1991","journal-title":"Fund. Inform."},{"key":"10.1016\/0743-1066(93)90029-G_BIB6","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB7","first-page":"306","article-title":"Embedding Defaults into Terminological Knowledge Representation Formalisms","author":"Baader","year":"1992","journal-title":"Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB8","first-page":"283","article-title":"Implementing Deductive Databases by Linear Programming","author":"Bell","year":"1992","journal-title":"Proceedings of the Eleventh Conference on Principles of Database Systems (PODS-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB9","first-page":"379","article-title":"Default Logic, Propositional Logic and Constraints","author":"Ben-Eliyahu","year":"1991","journal-title":"Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB10","article-title":"Propositional Semantics for Default Logic","author":"Ben-Eliyahu","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB11","first-page":"379","article-title":"Propositional Semantics for Disjunctive Logic Programming","author":"Ben-Eliyahu","year":"1992","journal-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming (JICSLP-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(51)90003-5","article-title":"Negation in Rule-Based Database Languages: A Survey","volume":"78","author":"Bidiot","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","article-title":"General Logic Databases and Programs: Default Logic Semantics and Stratification","volume":"91","author":"Bidoit","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0743-1066(93)90029-G_BIB14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","article-title":"Negation by Default and Unstratifiable Logic Programs","volume":"78","author":"Bidoit","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB15","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":"J. Comput. System Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","article-title":"The Recursion-Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language","volume":"54","author":"Blair","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0743-1066(93)90029-G_BIB17","doi-asserted-by":"crossref","DOI":"10.1007\/BF01534455","article-title":"The Expressiveness of Locally Stratified Programs","author":"Blair","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB18","first-page":"33","article-title":"Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning","author":"Borgida","year":"1989","journal-title":"Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning (KR-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB19","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/0004-3702(85)90040-2","article-title":"Saturation, Non-monotonic Reasoning and the Closed World Assumption","volume":"25","author":"Bossu","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB20","first-page":"41","article-title":"A Fundamental Tradeoff in Knowledge Representation and Reasoning","author":"Brachman","year":"1985"},{"key":"10.1016\/0743-1066(93)90029-G_BIB21","first-page":"70","article-title":"The Monotonic Abduction Problem: A Functional Characterization on the Edge of Tractability","author":"Bylander","year":"1991","journal-title":"Proceedings of the Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0004-3702(91)90005-5","article-title":"The Computational Complexity of Abduction","volume":"49","author":"Bylander","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB23","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(92)90049-2","article-title":"The Complexity of Model Checking for Circumscriptive Formulae","volume":"44","author":"Cadoli","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-1066(93)90029-G_BIB24","first-page":"125","article-title":"On the Complexity of Model Finding for Non-monotonic Propositional Logics","author":"Cadoli","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB25","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0004-3702(92)90051-X","article-title":"An Efficient Method for Eliminating Varying Predicates from a Circumscription","volume":"54","author":"Cadoli","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB26","first-page":"550","article-title":"The Complexity of Closed World Reasoning and Circumscription","author":"Cadoli","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB27","author":"Cadoli","year":"1991","journal-title":"Mapping Complexity Results from Circumscription to Default Logic and Vice Versa"},{"key":"10.1016\/0743-1066(93)90029-G_BIB28","first-page":"760","article-title":"Circumscription and Non-monotonic Inheritance","author":"Cadoli","year":"1990","journal-title":"Proceedings of the 1st Pacific Rim Conference on Artificial Intelligence (PRICAI-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB29","first-page":"319","article-title":"Approximate Inference in Default Reasoning and Circumscription","author":"Cadoli","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB30","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB31","doi-asserted-by":"crossref","DOI":"10.1109\/69.219736","article-title":"A Possible Worlds Semantics for Disjunctive Databases","author":"Chan","year":"1993","journal-title":"IEEE Trans. Data and Knowledge Engrg."},{"key":"10.1016\/0743-1066(93)90029-G_BIB32","article-title":"The Complexity of Local Stratification","author":"Cholak","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB33","article-title":"Post Correspondence Problem and Prolog Programs","author":"Cholak","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB34","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(90)90012-M","article-title":"Generalized Closed World Assumption is \u03a002-Complete","volume":"34","author":"Chomicki","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-1066(93)90029-G_BIB35","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(93)90029-G_BIB36","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0004-3702(86)90080-9","article-title":"An Assumption-Based TMS","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB37","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0004-3702(89)90018-0","article-title":"Eliminating the Fixed Predicates from a Circumscription","volume":"39","author":"de Kleer","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB38","article-title":"A Graph Theoretic Approach to Default Logic","author":"Dimopoulos","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/0743-1066(93)90029-G_BIB39","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00140676","article-title":"Non-monotonic Reasoning","volume":"4","author":"Donini","year":"1990","journal-title":"Artificial Intelligence Rev."},{"key":"10.1016\/0743-1066(93)90029-G_BIB40","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB41","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 \u03a0p2-complete","volume":"114","author":"Eiter","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB42","first-page":"158","article-title":"Complexity Aspects of Various Semantics for Disjunctive Databases","author":"Eiter","year":"1993","journal-title":"Proceedings of the Twelfth Conference on Principles of Database Systems (PODS-93)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB43","article-title":"The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revision","author":"Eiter","year":"1993","journal-title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB44","article-title":"Complexity Results for Disjunctive Logic Programming and Application to Non-monotonic Logics","author":"Eiter","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB45","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","article-title":"On the Complexity of Propositional Knowledge Base Revision, Updates and Counterfactuals","volume":"57","author":"Eiter","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB46","first-page":"31","article-title":"Reasoning with Parsimonious and Moderately Grounded Expansions","volume":"17","author":"Eiter","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/0743-1066(93)90029-G_BIB47","article-title":"The Complexity of Logic-Based Abduction","author":"Eiter","year":"1993","journal-title":"Tenth Symposium on Theoretical Aspects of Computer Science (STACS-93)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB48","article-title":"A Tractable Class of Abduction Problems","author":"Eshghi","year":"1993","journal-title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB49","first-page":"234","article-title":"Abduction Compared with Negation by Failure","author":"Eshghi","year":"1989","journal-title":"Proceedings of the Sixth International Conference on Logic Programming (ICLP-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB50","series-title":"Reasoning with Incomplete Information","author":"Etherington","year":"1987"},{"key":"10.1016\/0743-1066(93)90029-G_BIB51","first-page":"489","article-title":"Relating Default Logic and Circumscription","author":"Etherington","year":"1987","journal-title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB52","series-title":"4th Internaftional Workshop on Non-Monotonic Reasoning, Vermont, May 1992","article-title":"Towards Efficient Default Reasoning","author":"Etherington","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB53","first-page":"69","article-title":"Hypothesis Classification, Abductive Diagnosis and Therapy","volume":"462","author":"Friedrich","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB54","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0743-1066(93)90029-G_BIB55","first-page":"411","article-title":"Inheritance = Chaining + Defeat","author":"Geffner","year":"1989"},{"key":"10.1016\/0743-1066(93)90029-G_BIB56","first-page":"207","article-title":"On Stratified Autoepistemic Theories","author":"Gelfond","year":"1987"},{"key":"10.1016\/0743-1066(93)90029-G_BIB57","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB58","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(93)90029-G_BIB59","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\/0743-1066(93)90029-G_BIB60","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"},{"key":"10.1016\/0743-1066(93)90029-G_BIB61","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","article-title":"A Circumscriptive Theorem Prover","volume":"39","author":"Ginsberg","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB62","first-page":"661","article-title":"Rank-Based Systems: A Simple Approach to Belief Revision, Belief Update and Reasoning about Evidence and Actions","author":"Goldszmidt","year":"1992","journal-title":"Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB63","article-title":"The Complexity of Propositional Default Reasoning under the Stationary Fixed Point Semantics","author":"Gottlob","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB64","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity Results for Non-monotonic Logics","volume":"2","author":"Gottlob","year":"1992","journal-title":"J. Logic and Comput."},{"key":"10.1016\/0743-1066(93)90029-G_BIB65","article-title":"On the Power of Pure Beliefs or Embedding Default Logic into Standard Autoepistemic Logic","author":"Gottlob","year":"1993","journal-title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB66","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","article-title":"Removing Redundancy from a Clause","volume":"61","author":"Gottlob","year":"1993","journal-title":"Artificial Intelligence Journal"},{"key":"10.1016\/0743-1066(93)90029-G_BIB67","volume":"554","author":"Grahne","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB68","series-title":"Updates and Subjunctive Queries","author":"Grahne","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB69","article-title":"Default Reasoning as Circumscription","author":"Grosof","year":"1984","journal-title":"First International Workshop on Non-monotonic Reasoning"},{"key":"10.1016\/0743-1066(93)90029-G_BIB70","series-title":"Recursion-Theoretic Hierarchies","author":"Hinman","year":"1978"},{"key":"10.1016\/0743-1066(93)90029-G_BIB71","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0004-3702(90)90057-7","article-title":"A Skeptical Theory of Inheritance in Non-monotonic Semantic networks","volume":"42","author":"Horty","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB72","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\/0743-1066(93)90029-G_BIB73","article-title":"On Theorem Provers for Circumscription","author":"Inoue","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB74","article-title":"A Catalog of Complexity Classes","volume":"vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB75","first-page":"275","article-title":"Negation as Stable Hypothesis","author":"Kakas","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB76","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":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/78935.78936","article-title":"Some Computational Aspects of Circumscription","volume":"37","author":"Kolaitis","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(93)90029-G_BIB78","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0022-0000(91)90033-2","article-title":"Why Not Negation by Fixpoint?","volume":"43","author":"Kolaitis","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB79","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":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB80","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(88)90085-3","article-title":"On the Computability of Circumscription","volume":"27","author":"Krishnaprasad","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-1066(93)90029-G_BIB81","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","article-title":"Negation in Logic Programming","volume":"4","author":"Kunen","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB82","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","article-title":"The Computational Complexity of Provability in Systems of Modal Propositional Logic","volume":"6","author":"Ladner","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-1066(93)90029-G_BIB83","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90041-U","article-title":"What Does a Conditional Knowledge Base Entail?","volume":"55","author":"Lehmann","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB84","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\/0743-1066(93)90029-G_BIB85","first-page":"121","article-title":"Computing Circumscription","author":"Lifschitz","year":"1985","journal-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB86","first-page":"177","article-title":"On the Declarative Semantics of Logic Programs with negation","author":"Lifschitz","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB87","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(92)90019-T","article-title":"A Logic of Knowledge and Justified Assumptions","volume":"57","author":"Lin","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB88","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB89","series-title":"Non-Monotonic Reasoning","author":"Lukaszewicz","year":"1990"},{"key":"10.1016\/0743-1066(93)90029-G_BIB90","first-page":"446","article-title":"The Stable Models of a Predicate Logic Program","author":"Marek","year":"1992","journal-title":"Joint International Conference and Symposium on Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB91","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01543477","article-title":"A Theory of Nonmonotonic Rule Systems II.","volume":"5","author":"Marek","year":"1992","journal-title":"Ann. of Math. and Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB92","first-page":"395","article-title":"Model Non-monotonic Logics: Ranges, Characterization, Computation","author":"Marek","year":"1991","journal-title":"Proceedings of the Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB93","first-page":"600","article-title":"The Relationship between Logic Program Semantics and Non-monotonic Reasoning","author":"Marek","year":"1989","journal-title":"Proceedings of the Sixth International Conference on Logic Programming (ICLP-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB94","first-page":"243","article-title":"Stable Semantics for Logic Programs and Default Theories","author":"Marek","year":"1989"},{"key":"10.1016\/0743-1066(93)90029-G_BIB95","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01531081","article-title":"Modal Logic for Default Reasoning","volume":"1","author":"Marek","year":"1990","journal-title":"Ann. of Math. and Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB96","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\/0743-1066(93)90029-G_BIB97","first-page":"37","article-title":"Computing Intersection of Autoepistemic Expansions","author":"Marek","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB98","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\/0743-1066(93)90029-G_BIB99","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","article-title":"Applications of Circumscription to Formalizing Commonsense knowledge","volume":"28","author":"McCarthy","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB100","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","article-title":"Non-monotonic Logic II: Mon-monotonic Modal Theories","volume":"29","author":"McDermott","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(93)90029-G_BIB101","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\/0743-1066(93)90029-G_BIB102","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","article-title":"On Indefinite Databases and the Closed World Assumption","author":"Minker","year":"1982","journal-title":"Proceedings of the Sixth Conference on Automated Deduction (CADE-82)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB103","article-title":"An Overview of Non-monotonic Reasoning and Logic Programming","author":"Minker","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB104","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical Considerations on Non-monotonic Logic","volume":"25","author":"Moore","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB105","first-page":"301","article-title":"A Knowledge-Level Analysis of Belief Revision","author":"Nebel","year":"1989","journal-title":"Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning (KR-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB106","first-page":"417","article-title":"Belief Revision and Default Reasoning: Syntax-Based Approaches","author":"Nebel","year":"1991","journal-title":"Proceedings of the Second International Conference on the Principles of Knowledge Representation and Reasoning (KR-91)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB107","article-title":"Computing Circumscriptive Databases, Part I: Theory and Algorithms","author":"Nerode","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB108","first-page":"117","article-title":"On the Decidability and Complexity of Autoepistemic Reasoning","volume":"17","author":"Niemel\u00e4","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/0743-1066(93)90029-G_BIB109","first-page":"627","article-title":"On the Impact of Stratification on the Complexity of Non-monotonic Reasoning","author":"Niemel\u00e4","year":"1992","journal-title":"Proceedings of the Third International Conference on the Principles of Knowledge Representation and Reasoning (KR-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB110","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF00247828","article-title":"Tableaux and Sequent Calculus for Minimal Entailment","volume":"9","author":"Olivetti","year":"1992","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(93)90029-G_BIB111","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","article-title":"On the Complexity of Unique Solutions","volume":"31","author":"Papadimitriou","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0743-1066(93)90029-G_BIB112","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/SFCS.1991.185365","article-title":"On Selecting a Satisfying Truth Assignment (Extended Abstract)","author":"Papadimitriou","year":"1991","journal-title":"Proceedings of the 32nd Annual Symposium on the Foundations of Computer Science (FOCS-91)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB113","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-56039-4_47","article-title":"On Finding Extensions of Default Theories","author":"Papadimitriou","year":"1992","journal-title":"Proceedings of the International Conferences on Database Theory (ICDT-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB114","first-page":"16","article-title":"Tie-Breaking Semantics and Structural Totality","author":"Papadimitriou","year":"1992","journal-title":"Proceedings of the Eleventh Conference on Principles Of Database Systems (PODS-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB115","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(90)90031-Y","article-title":"Minimal Consequence in Sentential Logic","volume":"9","author":"Papalaskari","year":"1990","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB116","first-page":"157","article-title":"Probabilistic Semantics for Non-monotonic Reasoning: A Survey","author":"Pearl","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB117","first-page":"331","article-title":"Theorist: A Logical Reasoning System for Defaults and Diagnosis","author":"Poole","year":"1987"},{"key":"10.1016\/0743-1066(93)90029-G_BIB118","first-page":"98","article-title":"A Complexity Analysis of Assumption-Based Truth Maintenance Systems","author":"Provan","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB119","first-page":"522","article-title":"The Computational Complexity of Multiple-Context Truth Maintenance Systems","author":"Provan","year":"1990","journal-title":"Proceedings of the Ninth European Conference on Artificial Intelligence (ECAI-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB120","series-title":"Stationary Default Extensions","author":"Przymusinska","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB121","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(93)90029-G_BIB122","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\/0743-1066(93)90029-G_BIB123","first-page":"655","article-title":"Non-monotonic Formalisms and Logic Programming","author":"Przymusinski","year":"1989"},{"key":"10.1016\/0743-1066(93)90029-G_BIB124","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(93)90029-G_BIB125","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(89)90070-2","article-title":"A Generalization of Collapsible Cases of Circumscription","volume":"38","author":"Rabinov","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB126","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":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(93)90029-G_BIB127","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0020-7373(83)80065-0","article-title":"Diagnostic Expert Systems Based on a Set Covering Model","volume":"19","author":"Reggia","year":"1983","journal-title":"Int. J. Man\u2014Machine Studies"},{"key":"10.1016\/0743-1066(93)90029-G_BIB128","first-page":"119","article-title":"On Closed World Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/0743-1066(93)90029-G_BIB129","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\/0743-1066(93)90029-G_BIB130","first-page":"418","article-title":"Circumscription Implies Predicate Completion (Sometimes)","author":"Reiter","year":"1982","journal-title":"Proceedings of the National Conference on Artificial Intelligence (AAAI-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB131","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0743-1066(93)90029-G_BIB132","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00297247","article-title":"Inferring Negative Information from a Disjunctive Database","volume":"4","author":"Ross","year":"1988","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0743-1066(93)90029-G_BIB133","article-title":"Computational Complexity of Truth Maintenance Systems","volume":"480","author":"Rutenburg","year":"1991"},{"key":"10.1016\/0743-1066(93)90029-G_BIB134","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-57292-9_51","article-title":"Logic Programming and Autoepistemic Logics: New Relations and Complexity Results","author":"Schaerf","year":"1993"},{"key":"10.1016\/0743-1066(93)90029-G_BIB135","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","article-title":"Decidability and Definability with Circumscription","volume":"35","author":"Schlipf","year":"1987","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0743-1066(93)90029-G_BIB136","first-page":"485","article-title":"When Is Closed World Reasoning Tractable?","author":"Schlipf","year":"1988"},{"key":"10.1016\/0743-1066(93)90029-G_BIB137","first-page":"196","article-title":"The Expressive Powers of the Logic Programming Semantics","author":"Schlipf","year":"1990","journal-title":"Proceedings of the Ninth Conference on Principles of Database Systems (PODS-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB138","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01543479","article-title":"Formalizing a Logic for Logic Programming","volume":"5","author":"Schlipf","year":"1992","journal-title":"Ann. Math. and Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB139","first-page":"143","article-title":"A survey of Complexity and Undecidability Results in Logic Programming","author":"Schlipf","year":"1992","journal-title":"Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB140","article-title":"Non-monotonic Reasoning Is Sometimes Easier","author":"Schwarz","year":"1992"},{"key":"10.1016\/0743-1066(93)90029-G_BIB141","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1007\/3-540-52885-7_112","article-title":"A Tableaux-Based Theorem Prover for a Decidable Subset of Default Logic","author":"Schwind","year":"1990","journal-title":"Proceedings of the Tenth Conference on Automated Deduction (CADE-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB142","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(90)90010-W","article-title":"Model-Preference Default Theories","volume":"45","author":"Selman","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB143","first-page":"1140","article-title":"The Tractability of Path-Based Inheritance","author":"Selman","year":"1989","journal-title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB144","first-page":"343","article-title":"Abductive and Default Reasoning: A Computational Core","author":"Selman","year":"1990","journal-title":"Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB145","first-page":"440","article-title":"A New Method for Solving Hard Satisfiability Problems","author":"Selman","year":"1992","journal-title":"Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB146","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","article-title":"Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed-World Assumption","volume":"1","author":"Sheperdson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0743-1066(93)90029-G_BIB147","unstructured":"Shvarts, G., Autoepistemic Modal Logics, in: Proceedings of the Third Conference on Theoretical Aspects of Reasoning about Knowledge (TARK-90), pp. 97\u2013109."},{"key":"10.1016\/0743-1066(93)90029-G_BIB148","series-title":"First Order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/0743-1066(93)90029-G_BIB149","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0004-3702(92)90057-5","article-title":"Resolving Ambiguity in Non-monotonic Inheritance Hierarchies","volume":"55","author":"Stein","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(93)90029-G_BIB150","first-page":"571","article-title":"It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics","author":"Stillman","year":"1990","journal-title":"Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB151","first-page":"794","article-title":"The Complexity of Propositional Default Logics","author":"Stillman","year":"1992","journal-title":"Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB152","article-title":"Higher Order Logic","volume":"1","author":"van Benthem","year":"1983"},{"key":"10.1016\/0743-1066(93)90029-G_BIB153","first-page":"1","article-title":"The Alternating Fixpoint of Logic Programs with Negation","author":"Van Gelder","year":"1989","journal-title":"Proceedings of the Eighth Conference on Principles of Database Systems (PODS-89)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB154","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":"J. ACM"},{"key":"10.1016\/0743-1066(93)90029-G_BIB155","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. System Sci."},{"key":"10.1016\/0743-1066(93)90029-G_BIB156","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"},{"key":"10.1016\/0743-1066(93)90029-G_BIB157","first-page":"460","article-title":"On Reducing Parallel Circumscription","author":"Yuan","year":"1988","journal-title":"Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88)"},{"key":"10.1016\/0743-1066(93)90029-G_BIB158","first-page":"485","article-title":"On the Classification and Existence of Structures in Default Logic","volume":"13","author":"Zhang","year":"1990","journal-title":"Fund. Inform."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390029G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669390029G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:57:40Z","timestamp":1555127860000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669390029G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":159,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["074310669390029G"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(93)90029-g","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}