- 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
Stable models and circumscription
Artificial Intelligence 175 (1):236-263 (2011)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Cyrkumskrypcja: formalizacja rozumowania niemonotonicznego w logice drugiego rzędu.Michał Tyburski - 2009 - Filozofia Nauki 17 (1).
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.
Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111].Piero A. Bonatti - 2008 - Artificial Intelligence 172 (15):1833-1835.
An algorithm to compute circumscription.Teodor C. Przymusinski - 1989 - Artificial Intelligence 38 (1):49-73.
The expressive power of circumscription.Tom Costello - 1998 - Artificial Intelligence 104 (1-2):313-329.
Analytics
Added to PP
2020-12-22
Downloads
20 (#1,035,722)
6 months
7 (#698,214)
2020-12-22
Downloads
20 (#1,035,722)
6 months
7 (#698,214)
Historical graph of downloads
Author's Profile
Citations of this work
Relating constraint answer set programming languages and algorithms.Yuliya Lierler - 2014 - Artificial Intelligence 207 (C):1-22.
FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
Evaluating epistemic negation in answer set programming.Yi-Dong Shen & Thomas Eiter - 2016 - Artificial Intelligence 237 (C):115-135.
Ordered completion for logic programs with aggregates.Vernon Asuncion, Yin Chen, Yan Zhang & Yi Zhou - 2015 - Artificial Intelligence 224 (C):72-102.
Ordered completion for first-order logic programs on finite structures.Vernon Asuncion, Fangzhen Lin, Yan Zhang & Yi Zhou - 2012 - Artificial Intelligence 177-179 (C):1-24.
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.
Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.
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-667477cd97-9l5tj dc2