Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics

Authors:
Robert Saxon Milnikel
Affiliations:
Department of Mathematics, Kenyon College, Gambier, USA 43022
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2005

Citing 10
Cited 1

Foundations of logic programming

Foundations of logic programming
Semantical considerations on nonmonotonic logic

Artificial Intelligence
Logic programming

Handbook of theoretical computer science (vol. B)
Autoepistemic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Foundations of logic programming

Principles of knowledge representation
Sequent calculi for propositional nonmonotonic logics

ACM Transactions on Computational Logic (TOCL)
Logic for Applications

Logic for Applications
Nonmonotonic Logic: Context-Dependent Reasoning

Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic logic: a monotonic approach

Nonmonotonic logic: a monotonic approach
Reasoning with infinite stable models

Artificial Intelligence

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP

ICLP '08 Proceedings of the 24th International Conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequent calculi for skeptical consequence in predicate default logic, predicate stable model logic programming, and infinite autoepistemic theories are presented and proved sound and complete. While skeptical consequence is decidable in the finite propositional case of all three formalisms, the move to predicate or infinite theories increases the complexity of skeptical reasoning to being 驴11-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.