Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics |
| |
Authors: | Robert Saxon Milnikel |
| |
Affiliation: | (1) Department of Mathematics, Kenyon College, Gambier, OH 43022, USA |
| |
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.AMS subject classification 03B42, 68N17, 68T27This paper grew directly out of the authors dissertation, written under the direction of Anil Nerode. |
| |
Keywords: | default logic stable models autoepistemic logic sequent calculus |
本文献已被 SpringerLink 等数据库收录! |
|