A sequent calculus for skeptical reasoning in predicate default logic - (Extended abstract)

被引:0
|
作者
Milnikel, RS [1 ]
机构
[1] Kenyon Coll, Gambier, OH 43022 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 II11-complete. This implies the need for sequent rules with countably many premises, and such rules are employed.
引用
收藏
页码:564 / 575
页数:12
相关论文
共 50 条