Skip to main content
Conference Proceedings

A sequent calculus for skeptical reasoning in predicate default logic

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (2003) 2711 564-575
DOI: 10.1007/978-3-540-45062-7_46
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A sound and complete sequent calculus for skeptical consequence in predicate default logic is presented. While skeptical consequence is decidable in the finite propositional case, 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.

Cite

CITATION STYLE

APA

Milnikel, R. S. (2003). A sequent calculus for skeptical reasoning in predicate default logic. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2711, pp. 564–575). Springer Verlag. https://doi.org/10.1007/978-3-540-45062-7_46

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free