- 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
On the relationship between circumscription and negation as failure
Artificial Intelligence 38 (1):75-94 (1989)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Negation as failure.Michael Gelfond & Halina Przymusinska - 1986 - Artificial Intelligence 30 (3):273-287.
Minimal belief and negation as failure.Vladimir Lifschitz - 1994 - Artificial Intelligence 70 (1-2):53-72.
Gelfond–Zhang aggregates as propositional formulas.Pedro Cabalar, Jorge Fandinno, Torsten Schaub & Sebastian Schellhorn - 2019 - Artificial Intelligence 274 (C):26-43.
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
Value minimization in circumscription.China Baral, Alfredo Gabaldon & Alessandro Provetti - 1998 - Artificial Intelligence 102 (2):163-186.
Abstract minimality and circumscription.Churn Jung Liau & Bertrand I.-Peng Lin - 1992 - Artificial Intelligence 54 (3):381-396.
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
Analytics
Added to PP
2020-12-22
Downloads
17 (#1,196,561)
6 months
8 (#390,329)
2020-12-22
Downloads
17 (#1,196,561)
6 months
8 (#390,329)
Historical graph of downloads
Citations of this work
On the complexity of propositional knowledge base revision, updates, and counterfactuals.Thomas Eiter & Georg Gottlob - 1992 - Artificial Intelligence 57 (2-3):227-270.
Combining answer set programming with description logics for the Semantic Web.Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer & Hans Tompits - 2008 - Artificial Intelligence 172 (12-13):1495-1539.
Linear resolution for consequence finding.Katsumi Inoue - 1992 - Artificial Intelligence 56 (2-3):301-353.
Bounded treewidth as a key to tractability of knowledge representation and reasoning.Georg Gottlob, Reinhard Pichler & Fang Wei - 2010 - Artificial Intelligence 174 (1):105-132.
Is intractability of nonmonotonic reasoning a real drawback?Marco Cadoli, Francesco M. Donini & Marco Schaerf - 1996 - Artificial Intelligence 88 (1-2):215-251.
References found in this work
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Applications of Circumscription to Formalizing Common Sense Knowledge.John McCarthy - 1986 - Artificial Intelligence 28 (1):89–116.
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-dwqgq uwo