- 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 satisfiability of circumscription
Artificial Intelligence 28 (1):17-27 (1986)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Cyrkumskrypcja: formalizacja rozumowania niemonotonicznego w logice drugiego rzędu.Michał Tyburski - 2009 - Filozofia Nauki 17 (1).
Circumscriptive theories: A logic-based framework for knowledge representation. [REVIEW]Vladimir Lifshitz - 1988 - Journal of Philosophical Logic 17 (4):391 - 441.
Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
Closed-world databases and circumscription.Vladimir Lifschitz - 1985 - Artificial Intelligence 27 (2):229-235.
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
Expressiveness and definability in circumscription.Francicleber Martins Ferreira & Ana Teresa Martins - 2011 - Manuscrito 34 (1):233-266.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
Two Variable First-Order Logic Over Ordered Domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.
Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics.Valentin Goranko & Steen Vester - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. College Publications. pp. 234-253.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,409,222)
6 months
4 (#859,620)
2020-12-22
Downloads
7 (#1,409,222)
6 months
4 (#859,620)
Historical graph of downloads
Citations of this work
Nonmonotonic reasoning, preferential models and cumulative logics.Sarit Kraus, Daniel Lehmann & Menachem Magidor - 1990 - Artificial Intelligence 44 (1-2):167-207.
Negation as failure.Michael Gelfond & Halina Przymusinska - 1986 - Artificial Intelligence 30 (3):273-287.
Nonmonotonicity and the scope of reasoning.David W. Etherington, Sarit Kraus & Donald Perlis - 1991 - Artificial Intelligence 52 (3):221-261.
Annotation Theories over Finite Graphs.Dov M. Gabbay & Andrzej Szałas - 2009 - Studia Logica 93 (2):147-180.
Decidability and definability with circumscription.John S. Schlipf - 1987 - Annals of Pure and Applied Logic 35 (C):173-191.
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.
Saturation, nonmonotonic reasoning and the closed-world assumption.Genevieve Bossu & Pierre Siegel - 1985 - Artificial Intelligence 25 (1):13-63.
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-8fb5884b9-k4bxp uwo