- 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
My notes
Similar books and articles
Honesty in partial logic.Wiebe Hoek, Jan Jaspars & Elias Thijsse - 1996 - Studia Logica 56 (3):323-360.
Expressiveness and definability in circumscription.Francicleber Martins Ferreira & Ana Teresa Martins - 2011 - Manuscrito 34 (1):233-266.
Cyrkumskrypcja: formalizacja rozumowania niemonotonicznego w logice drugiego rzędu.Michał Tyburski - 2009 - Filozofia Nauki 17 (1).
Safe Formulas in the General Theory of Stable Models (Preliminary Report).Joohyung Lee & Vladimir Lifschitz - unknown
Honesty in partial logic.Wiebe van der Hoek, Jan Jaspars & Elias Thijsse - 1996 - Studia Logica 56 (3):323-360.
Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
Circumscriptive theories: A logic-based framework for knowledge representation. [REVIEW]Vladimir Lifshitz - 1988 - Journal of Philosophical Logic 17 (4):391 - 441.
Safe formulas in the general theory of stable models (preliminary report).Vladimir Lifschitz - unknown
On the satisfiability of circumscription.Vladimir Lifschitz - 1986 - Artificial Intelligence 28 (1):17-27.
Closed-world databases and circumscription.Vladimir Lifschitz - 1985 - Artificial Intelligence 27 (2):229-235.
How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
An Old Friend Revisited: Countable Models of ω-Stable Theories.Michael C. Laskowski - 2007 - Notre Dame Journal of Formal Logic 48 (1):133-141.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,132,782)
6 months
9 (#301,354)
2020-12-22
Downloads
11 (#1,132,782)
6 months
9 (#301,354)
Historical graph of downloads
Author's Profile
Citations of this work
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.
Relating constraint answer set programming languages and algorithms.Yuliya Lierler - 2014 - Artificial Intelligence 207 (C):1-22.
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-64dd777598-g9b9l uwo