Access the full text.
Sign up today, get DeepDyve free for 14 days.
U. Egly, H. Tompits (1997)
Is Non-Monotonic Reasoning Always Harder?
P. Bonatti (1993)
Autoepistemic logic programmingJournal of Automated Reasoning, 13
J. Słupecki, G. Bryll, U. Wybraniec-Skardowska (1971)
Theory of rejected propositions. IStudia Logica, 29
A. Bochman (1994)
On the Relation Between Default and Modal Consequence Relations
(1993)
A gentzen system for non-theorems
P. Bonatti, N. Olivetti (1997)
A Sequent Calculus for Skeptical Default Logic
R. Dutkiewicz (1989)
The method of axiomatic rejection for the intuitionistic propositional logicStudia Logica, 48
V. Marek, M. Truszczynski (1997)
Nonmonotonic logic - context-dependent reasoning
(1995)
Logic Programming and Non-monotonic Reasoning: Proceedings of the 3rd Internatinal Conference
Xavier Ferrer (1978)
A formal system for the non-theorems of the propositional calculusNotre Dame J. Formal Log., 19
J. Groote (1993)
Transition System Specifications with Negative PremisesTheor. Comput. Sci., 118
Jan Łukasiewicz (1957)
Aristotle's Syllogistic From the Standpoint of Modern Formal Logic
C. Bell, A. Nerode, R. Ng, V. Subrahmanian (1992)
Implementing deductive databases by linear programming
(2002)
ACM Transactions on Computational Logic
J. McCarthy (1987)
Applications of Circumscription to Formalizing Common Sense KnowledgeArtif. Intell., 28
D. Gabbay, C. Hogger, J. Robinson (1993)
Handbook of logic in artificial intelligence and logic programming (vol. 1)
M. Abdallah (1989)
An Extended Framework for Default Reasoning
(1993)
Circumscription and minimal models for propositional logics
D. Gabbay (1989)
Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems
K. Konolige (1987)
On the Relation Between Default and Autoepistemic LogicArtif. Intell., 35
J. McCarthy (1995)
Circumscription: a form of non-monotonic reasoning
Yuejun Jiang (1991)
A first step towards autoepistemic logic programmingComputing and Informatics \/ Computers and Artificial Intelligence, 10
I. Niemelä (1996)
A Tableau Calculus for Minimal Model Reasoning
Robert Moore (1985)
Semantical Considerations on Nonmonotonic Logic
H. Levesque (1990)
All I Know: A Study in Autoepistemic LogicArtif. Intell., 42
Joseph Clark, J. Lukasiewicz (1952)
Aristotle's Syllogistic from the Standpoint of Modern Formal Logic.The Philosophical Review, 61
G. Amati, L. Aiello, D. Gabbay, F. Pirri (1996)
A Proof Theoretical Approach to Default Reasoning I: Tableaux for Default LogicJ. Log. Comput., 6
P. Bonatti, N. Olivetti (1997)
A Sequent Calculus for Circumscription
R. Colomb (1998)
Non-monotonic reasoning
Li-Yan Yuan, Cheng Wang (1988)
On Reducing Parallel Circumscription
I. Niemelä (1995)
A decision method for nonmonotonic reasoning based on autoepistemic reasoningJournal of Automated Reasoning, 14
Phokion Kolaitis, C. Papadimitriou (1988)
Some computational aspects of circumscription
V. Lifschitz (1985)
Computing Circumscription
Achille Varzi (1992)
Complementary Logics for Classical Propositional LanguagesKRITERION – Journal of Philosophy, 4
Achille Varzi (1990)
Complementary Sentential Logics
G. Brewka (1991)
Cumulative Default Logic: In Defense of Nonmonotonic Inference RulesArtif. Intell., 50
J. Schlipf (1987)
Decidability and definability with circumscriptionAnn. Pure Appl. Log., 35
N. Olivetti (1992)
Tableaux and sequent calculus for minimal entailmentJournal of Automated Reasoning, 9
J. Groote (1990)
Transition System Specifications with Negative Premises (Extended Abstract)
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
(2000)
Received September
D. Makinson (1988)
General Theory of Cumulative Inference
K. Konolige (1989)
On the Relation Between Autoepistem ic Logic and Circumscription
U. Egly, H. Tompits (1998)
On Proof Complexity of Circumscription
Marco Cadoli, Thomas Eiter, G. Gottlob (1997)
Default Logic as a Query LanguageIEEE Trans. Knowl. Data Eng., 9
V. Risch, C. Schwind (1994)
Tableau-based characterization and theorem proving for default logicJournal of Automated Reasoning, 13
P. Bonatti, Thomas Eiter (1996)
Querying Disjunctive Databases Through Nonmonotonic LogicsTheor. Comput. Sci., 160
Thomas Eiter, G. Gottlob (1993)
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-CompleteTheor. Comput. Sci., 114
R. Bol, J. Groote (1991)
The meaning of negative premises in transition system specifications
J. Lloyd (1984)
Foundations of Logic Programming
Sarit Kraus, D. Lehmann, M. Magidor (1990)
Nonmonotonic Reasoning, Preferential Models and Cumulative LogicsArXiv, cs.AI/0202021
Teodor Przymusinski (1989)
An Algorithm to Compute CircumscriptionArtif. Intell., 38
(1991)
Computing intersections of autoepistemic expansions
P. Bonatti (1996)
Sequent Calculi for Default and Autoepistemic Logics
C. Bell, A. Nerode, R. Ng, V. Subrahmanian (1993)
Implementing Stable Semantics by Linear Programming
I. Niemelä (1996)
Implementing Circumscription Using a Tableau Method
A uniform proof-theoretic reconstruction of the major nonmonotonic logics is introduced. It consists of analytic sequent calculi where the details of nonmonotonic assumption making are modelled by an axiomatic rejection method. Another distinctive feature of the calculi is the use of provability constraints that make reasoning largely independent of any specific derivation strategy. The resulting account of nonmonotonic inference is simple and flexible enough to be a promising playground for investigating and comparing proof strategies, and for describing the behavior of automated reasoning systems. We provide some preliminary evidence for this claim by introducing optimized calculi, and by simulating an existing tableaux-based method for circumscription. The calculi for skeptical reasoning support concise proofs that may depend on a strict subset of the given theory. This is a difficult task, given the nonmonotonic behavior of the logics.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 1, 2002
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.