- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Default reasoning from conditional knowledge bases: Complexity and tractable cases
Artificial Intelligence 124 (2):169-241 (2000)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Conditional entailment: Bridging two approaches to default reasoning.Hector Geffner & Judea Pearl - 1992 - Artificial Intelligence 53 (2-3):209-244.
On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus.Jochen Renz & Bernhard Nebel - 1999 - Artificial Intelligence 108 (1-2):69-123.
An approach to default reasoning based on a first-order conditional logic: Revised report.James P. Delgrande - 1988 - Artificial Intelligence 36 (1):63-90.
On the computational complexity of assumption-based argumentation for default reasoning.Yannis Dimopoulos, Bernhard Nebel & Francesca Toni - 2002 - Artificial Intelligence 141 (1-2):57-78.
Using approximate reasoning to represent default knowledge.Ronald R. Yager - 1987 - Artificial Intelligence 31 (1):99-112.
Limited reasoning in first-order knowledge bases.Gerhard Lakemeyer - 1994 - Artificial Intelligence 71 (2):213-255.
Probabilistic Default Reasoning with Conditional Constraints.Thomas Lukasiewicz - 2000 - Linköping Electronic Articles in Computer and Information Science 5.
Optimal compression of propositional Horn knowledge bases: complexity and approximation.Peter L. Hammer & Alexander Kogan - 1993 - Artificial Intelligence 64 (1):131-145.
Off-line reasoning for on-line efficiency: knowledge bases.Yoram Moses & Moshe Tennenholtz - 1996 - Artificial Intelligence 83 (2):229-239.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,351,358)
6 months
4 (#970,122)
2020-12-22
Downloads
14 (#1,351,358)
6 months
4 (#970,122)
Historical graph of downloads
Citations of this work
A new semantics for overriding in description logics.P. A. Bonatti, M. Faella, I. M. Petrova & L. Sauro - 2015 - Artificial Intelligence 222 (C):1-48.
Combining probabilistic logic programming with the power of maximum entropy.Gabriele Kern-Isberner & Thomas Lukasiewicz - 2004 - Artificial Intelligence 157 (1-2):139-202.
Expressive probabilistic description logics.Thomas Lukasiewicz - 2008 - Artificial Intelligence 172 (6-7):852-883.
Weak nonmonotonic probabilistic logics.Thomas Lukasiewicz - 2005 - Artificial Intelligence 168 (1-2):119-161.
Updating action domain descriptions.Thomas Eiter, Esra Erdem, Michael Fink & Ján Senko - 2010 - Artificial Intelligence 174 (15):1172-1221.
References found in this work
On the logic of theory change: Partial meet contraction and revision functions.Carlos E. Alchourrón, Peter Gärdenfors & David Makinson - 1985 - Journal of Symbolic Logic 50 (2):510-530.
Nonmonotonic reasoning, preferential models and cumulative logics.Sarit Kraus, Daniel Lehmann & Menachem Magidor - 1990 - Artificial Intelligence 44 (1-2):167-207.
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-99fc7d78b-58pt2 uwo