乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T11:49:54Z","timestamp":1706788194885},"reference-count":90,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4619,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0004-3702(00)00073-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:55:14Z","timestamp":1027630514000},"page":"169-241","source":"Crossref","is-referenced-by-count":26,"title":["Default reasoning from conditional knowledge bases: Complexity and tractable cases"],"prefix":"10.1016","volume":"124","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Lukasiewicz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(00)00073-4_ID003","series-title":"The Logic of Conditionals","volume":"Vol. 86","author":"Adams","year":"1975"},{"key":"10.1016\/S0004-3702(00)00073-4_ID004","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","article-title":"On the logic of theory change: Partial meet contraction and revision functions","volume":"Vol. 50","author":"Alchourr\u00f3n","year":"1985","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0004-3702(00)00073-4_ID005","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0004-3702(96)00003-3","article-title":"From statistical knowledge bases to degrees of belief","volume":"Vol. 87","author":"Bacchus","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"6","key":"10.1016\/S0004-3702(00)00073-4_ID006","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1145\/195613.195637","article-title":"Mixed integer programming methods for computing non-monotonic deductive databases","volume":"Vol. 41","author":"Bell","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00073-4_ID007","series-title":"NP-complete problems in optimal Horn clauses satisfiability","author":"Ben-Eliyahu","year":"1991"},{"key":"10.1016\/S0004-3702(00)00073-4_ID008","series-title":"Proc. IJCAI-93, Chamb\u00e9ry, France","first-page":"640","article-title":"Inconsistency management and prioritized syntax-based entailment","author":"Benferhat","year":"1993"},{"key":"10.1016\/S0004-3702(00)00073-4_ID009","series-title":"Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA","first-page":"673","article-title":"Representing default rules in possibilistic logic","author":"Benferhat","year":"1992"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00073-4_ID010","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0004-3702(97)00012-X","article-title":"Nonmonotonic reasoning, conditional objects and possibility theory","volume":"Vol. 92","author":"Benferhat","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID011","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(00)00041-2","article-title":"Belief functions and default reasoning","volume":"Vol. 122","author":"Benferhat","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID012","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01531068","article-title":"Polynomial-time inference of all valid implications for Horn and related formulae","volume":"Vol. 1","author":"Boros","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID013","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(94)90033-7","article-title":"Recognition of q-Horn formulae in linear time","volume":"Vol. 55","author":"Boros","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0004-3702(00)00073-4_ID014","series-title":"Default reasoning using maximum entropy and variable strength defaults, Ph.D. Thesis","author":"Bourne","year":"1999"},{"key":"10.1016\/S0004-3702(00)00073-4_ID015","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"50","article-title":"Maximum entropy and variable strength defaults","author":"Bourne","year":"1999"},{"key":"10.1016\/S0004-3702(00)00073-4_ID016","series-title":"Proc. AAAI-90, Boston, MA","first-page":"594","article-title":"Conditional logics of normality as modal systems","author":"Boutilier","year":"1990"},{"key":"10.1016\/S0004-3702(00)00073-4_ID017","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0004-3702(94)90096-5","article-title":"Conditional logics of normality: A modal approach","volume":"Vol. 68","author":"Boutilier","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID018","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0004-3702(94)90095-7","article-title":"Unifying default reasoning and belief revision in a modal framework","volume":"Vol. 68","author":"Boutilier","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID019","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0890-5401(91)90075-D","article-title":"On truth-table reducibility to SAT","volume":"Vol. 91","author":"Buss","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(00)00073-4_ID020","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":"Vol. 44","author":"Cadoli","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(00)00073-4_ID021","series-title":"Proc. 4th Israeli Symposium on Theory of Computing and Systems (ISTCS'96), Jerusalem, Israel","first-page":"100","article-title":"Feasibility and unfeasibility of off-line processing","author":"Cadoli","year":"1996"},{"key":"10.1016\/S0004-3702(00)00073-4_ID022","series-title":"Proc. AAAI-98, Madison, WI","first-page":"262","article-title":"An algorithm to evaluate quantified Boolean formulae","author":"Cadoli","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID023","first-page":"165","article-title":"The complexity of propositional closed world reasoning and circumscription","volume":"Vol. 43","author":"Cadoli","year":"1994","journal-title":"J. Comput. System Sci."},{"issue":"3\u20134","key":"10.1016\/S0004-3702(00)00073-4_ID024","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1018939502485","article-title":"Nonmonotonic reasoning: From complexity to algorithms","volume":"Vol. 22","author":"Cayrol","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"2\u20133","key":"10.1016\/S0004-3702(00)00073-4_ID025","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0004-3702(99)00053-3","article-title":"Computing with default logic","volume":"Vol. 112","author":"Cholewi\u0144ski","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID026","series-title":"Proc. AAAI-88, St. Paul, MN","first-page":"475","article-title":"Investigations into a theory of knowledge base revision","author":"Dalal","year":"1988"},{"key":"10.1016\/S0004-3702(00)00073-4_ID027","series-title":"Proc. 12th IEEE International Conference on Computational Complexity (CCC-97), Ulm, Germany","first-page":"82","article-title":"Complexity and expressive power of logic programming","author":"Dantsin","year":"1997"},{"issue":"1","key":"10.1016\/S0004-3702(00)00073-4_ID028","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(87)90053-1","article-title":"A first-order conditional logic for prototypical properties","volume":"Vol. 33","author":"Delgrande","year":"1987","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00073-4_ID029","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0004-3702(98)00088-5","article-title":"On first-order conditional logics","volume":"Vol. 105","author":"Delgrande","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID030","series-title":"Parameterized Complexity","author":"Downey","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID031","series-title":"Satisfiability Problem: Theory and Applications","volume":"Vol. 35","year":"1997"},{"key":"10.1016\/S0004-3702(00)00073-4_ID032","series-title":"Proc. IJCAI-91, Sydney, Australia","first-page":"419","article-title":"Possibilistic logic, preferential models, non-monotonicity and related issues","author":"Dubois","year":"1991"},{"key":"10.1016\/S0004-3702(00)00073-4_ID033","doi-asserted-by":"crossref","first-page":"1724","DOI":"10.1109\/21.328930","article-title":"Conditional objects as non-monotonic consequence relationships","volume":"Vol. 24","author":"Dubois","year":"1994","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0004-3702(00)00073-4_ID034","series-title":"Proc. AAAI-00, Austin, TX","first-page":"417","article-title":"Solving advanced reasoning tasks using quantified Boolean formulas","author":"Egly","year":"2000"},{"issue":"2\u20133","key":"10.1016\/S0004-3702(00)00073-4_ID035","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":"Vol. 57","author":"Eiter","year":"1992","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(00)00073-4_ID036","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":"Vol. 114","author":"Eiter","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0004-3702(00)00073-4_ID037","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/200836.200838","article-title":"The complexity of logic-based abduction","volume":"Vol. 42","author":"Eiter","year":"1995","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00073-4_ID038","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(96)00179-X","article-title":"Abduction from logic programs: Semantics and complexity","volume":"Vol. 189","author":"Eiter","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00073-4_ID039","series-title":"Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR-98), Trento, Italy","first-page":"406","article-title":"The KR system dlv: Progress report, comparisons, and benchmarks","author":"Eiter","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID040","doi-asserted-by":"crossref","unstructured":"N. Friedman, J.Y. Halpern, Plausibility measures and default reasoning, J. ACM, to appear","DOI":"10.1145\/502090.502092"},{"key":"10.1016\/S0004-3702(00)00073-4_ID041","series-title":"Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany","first-page":"202","article-title":"On the complexity of conditional logics","author":"Friedman","year":"1994"},{"key":"10.1016\/S0004-3702(00)00073-4_ID042","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. III: Nonmonotonic Reasoning and Uncertain Reasoning","year":"1994"},{"key":"10.1016\/S0004-3702(00)00073-4_ID043","series-title":"Handbook on Defeasible Reasoning and Uncertainty Management Systems","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID044","series-title":"Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. IV: Epistemic and Temporal Reasoning","first-page":"35","article-title":"Belief revision","author":"G\u00e4rdenfors","year":"1995"},{"key":"10.1016\/S0004-3702(00)00073-4_ID045","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(00)00073-4_ID046","series-title":"Default Reasoning: Causal and Conditional Theories","author":"Geffner","year":"1992"},{"key":"10.1016\/S0004-3702(00)00073-4_ID047","first-page":"51","article-title":"High probabilities, model preference and default arguments","volume":"Vol. 2","author":"Geffner","year":"1992","journal-title":"Mind and Machines"},{"issue":"2\u20133","key":"10.1016\/S0004-3702(00)00073-4_ID048","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(92)90071-5","article-title":"Conditional entailment: Bridging two approaches to default reasoning","volume":"Vol. 53","author":"Geffner","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID049","series-title":"Proc. IJCAI-95, Montr\u00e9al, Quebec","first-page":"862","article-title":"The comparative linguistics of knowledge representation","author":"Gogic","year":"1995"},{"issue":"3","key":"10.1016\/S0004-3702(00)00073-4_ID050","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/34.204904","article-title":"A maximum entropy approach to nonmonotonic reasoning","volume":"Vol. 15","author":"Goldszmidt","year":"1993","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(00)00073-4_ID051","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0004-3702(91)90039-M","article-title":"On the consistency of defeasible databases","volume":"Vol. 52","author":"Goldszmidt","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID052","series-title":"Proc. AAAI-91, Anaheim, CA","first-page":"399","article-title":"System Z+: A formalism for reasoning with variable strength defaults","author":"Goldszmidt","year":"1991"},{"key":"10.1016\/S0004-3702(00)00073-4_ID053","series-title":"Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA","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"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(00)00073-4_ID054","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(95)00090-9","article-title":"Qualitative probabilities for default reasoning, belief revision, and causal modeling","volume":"Vol. 84","author":"Goldszmidt","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(00)00073-4_ID055","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity results for nonmonotonic logics","volume":"Vol. 2","author":"Gottlob","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(00)00073-4_ID056","series-title":"Proc. 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-99), El Paso, TX","first-page":"1","article-title":"Fixed parameter complexity in AI and nonmonotonic reasoning","volume":"Vol. 1730","author":"Gottlob","year":"1999"},{"key":"10.1016\/S0004-3702(00)00073-4_ID057","series-title":"Proc. European Workshop on Logics in Artificial Intelligence (JELIA'98), Dagstuhl, Germany","first-page":"216","article-title":"On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription","volume":"Vol. 1489","author":"Janhunen","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID058","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(94)00080-3","article-title":"Computing functions with parallel queries to NP","volume":"Vol. 141","author":"Jenner","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(00)00073-4_ID059","series-title":"Handbook of Theoretical Computer Science, Vol. A, Chapter 2","first-page":"67","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(00)00073-4_ID060","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0004-3702(91)90069-V","article-title":"Propositional knowledge base revision and minimal change","volume":"Vol. 52","author":"Katsuno","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID061","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","article-title":"Hard problems for simple default logics","volume":"Vol. 49","author":"Kautz","year":"1991","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(00)00073-4_ID062","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","article-title":"Nonmonotonic reasoning, preferential models and cumulative logics","volume":"Vol. 14","author":"Kraus","year":"1990","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(00)00073-4_ID063","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"Vol. 36","author":"Krentel","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(00)00073-4_ID064","series-title":"Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA","first-page":"357","article-title":"S4 as the conditional logic of nonmonotonicity","author":"Lamarre","year":"1991"},{"key":"10.1016\/S0004-3702(00)00073-4_ID065","series-title":"Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA","first-page":"572","article-title":"A promenade from monotonicity to non-monotonicity following a theorem prover","author":"Lamarre","year":"1992"},{"key":"10.1016\/S0004-3702(00)00073-4_ID066","series-title":"Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ontario","first-page":"212","article-title":"What does a conditional knowledge base entail?","author":"Lehmann","year":"1989"},{"issue":"1","key":"10.1016\/S0004-3702(00)00073-4_ID067","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01535841","article-title":"Another perspective on default reasoning","volume":"Vol. 15","author":"Lehmann","year":"1995","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(00)00073-4_ID068","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":"Vol. 55","author":"Lehmann","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID069","series-title":"Proc. IJCAI-97, Nagoya, Japan","first-page":"68","article-title":"The complexity of belief update","author":"Liberatore","year":"1997"},{"key":"10.1016\/S0004-3702(00)00073-4_ID070","series-title":"Proc. IJCAI-85, Los Angeles, CA","first-page":"121","article-title":"Computing circumscription","author":"Lifschitz","year":"1985"},{"key":"10.1016\/S0004-3702(00)00073-4_ID071","series-title":"Nonmonotonic Logics\u2014Context-Dependent Reasoning","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(00)00073-4_ID072","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":"Vol. 13","author":"McCarthy","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID073","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/322290.322293","article-title":"Non-monotonic logic II: Nonmonotonic modal theories","volume":"Vol. 29","author":"McDermott","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(00)00073-4_ID074","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Non-monotonic logic I","volume":"Vol. 13","author":"McDermott","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID075","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical considerations on nonmonotonic logics","volume":"Vol. 25","author":"Moore","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID076","series-title":"Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA","first-page":"417","article-title":"Belief revision and default reasoning: Syntax-based approaches","author":"Nebel","year":"1991"},{"key":"10.1016\/S0004-3702(00)00073-4_ID077","series-title":"Proc. 11th European Conference on Artificial Intelligence (ECAI-94), Amsterdam, Netherlands","first-page":"341","article-title":"Base revision operators and schemes: Semantics, representation, and complexity","author":"Nebel","year":"1994"},{"key":"10.1016\/S0004-3702(00)00073-4_ID078","series-title":"Handbook on Defeasible Reasoning and Uncertainty Management Systems, Vol. III: Belief Change","first-page":"77","article-title":"How hard is it to revise a belief base?","author":"Nebel","year":"1998"},{"key":"10.1016\/S0004-3702(00)00073-4_ID079","doi-asserted-by":"crossref","first-page":"117","DOI":"10.3233\/FI-1992-171-208","article-title":"On the decidability and complexity of autoepistemic reasoning","volume":"Vol. 17","author":"Niemel\u00e4","year":"1992","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0004-3702(00)00073-4_ID080","series-title":"Proc. 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), Dagstuhl, Germany","first-page":"420","article-title":"Smodels\u2014An implementation of the stable model and well-founded semantics for normal logic programs","volume":"Vol. 1265","author":"Niemel\u00e4","year":"1997"},{"key":"10.1016\/S0004-3702(00)00073-4_ID081","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(00)00073-4_ID082","series-title":"Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning (KR-89), Toronto, Ontario","first-page":"505","article-title":"Probabilistic semantics for nonmonotonic reasoning: A survey","author":"Pearl","year":"1989"},{"key":"10.1016\/S0004-3702(00)00073-4_ID083","series-title":"Proc. 3rd Conference on Theoretical Aspects of Reasoning about Knowledge (TARK-90), Pacific Grove, CA","first-page":"121","article-title":"System Z: A natural ordering of defaults with tractable applications to default reasoning","author":"Pearl","year":"1990"},{"key":"10.1016\/S0004-3702(00)00073-4_ID084","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"Vol. 13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(00)00073-4_ID085","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"1192","article-title":"Improvements to the evaluation of quantified Boolean formulae","author":"Rintanen","year":"1999"},{"key":"10.1016\/S0004-3702(00)00073-4_ID086","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","article-title":"A taxonomy of complexity classes of functions","volume":"Vol. 48","author":"Selman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(00)00073-4_ID087","series-title":"Proc. 2nd IEEE Symposium on Logic in Computer Science (LICS-87), Ithaca, NY","first-page":"275","article-title":"A semantical approach to nonmonotonic logics","author":"Shoham","year":"1987"},{"key":"10.1016\/S0004-3702(00)00073-4_ID088","series-title":"Causation in Decision, Belief Change, and Statistics, Vol. 2","first-page":"105","article-title":"Ordinal conditional functions: A dynamic theory of epistemic states","author":"Spohn","year":"1988"},{"key":"10.1016\/S0004-3702(00)00073-4_ID089","series-title":"Proc. AAAI-90, Boston, MA","first-page":"571","article-title":"It's not my default: The complexity of membership problems in restricted propositional default logic","author":"Stillman","year":"1990"},{"key":"10.1016\/S0004-3702(00)00073-4_ID090","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"794","article-title":"The complexity of propositional default logic","author":"Stillman","year":"1992"},{"key":"10.1016\/S0004-3702(00)00073-4_ID091","series-title":"Proc. IJCAI-99, Stockholm, Sweden","first-page":"304","article-title":"On the use of integer programming models in AI planning","author":"Vossen","year":"1999"},{"issue":"5","key":"10.1016\/S0004-3702(00)00073-4_ID092","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","article-title":"Bounded query classes","volume":"Vol. 19","author":"Wagner","year":"1990","journal-title":"SIAM J. Comput."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000734?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370200000734?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T11:21:10Z","timestamp":1681384870000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370200000734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":90,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0004370200000734"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(00)00073-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}