Goal-Oriented Proof-Search in Natural Deduction for Intuitionistic Propositional Logic

被引:3
|
作者
Ferrari, Mauro [1 ]
Fiorentini, Camillo [2 ]
机构
[1] Univ Insubria, Dipartimento Sci Teor & Applicate, Via Mazzini 5, I-21100 Varese, Italy
[2] Univ Milan, Dipartimento Informat, Via Comelico 39, I-20135 Milan, Italy
关键词
Natural deduction; Intuitionistic propositional logic; Proof-search procedures; CALCULUS; SEQUENT;
D O I
10.1007/s10817-017-9427-3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We address the problem of proof-search in the natural deduction calculus for Intuitionistic propositional logic. Our aim is to improve the usual proof-search procedure where introduction rules are applied upwards and elimination rules downwards. In particular, we introduce Nbu, a variant of the usual natural deduction calculus for Intuitionistic Propositional Logic, and we show that it can be used as a base for a goal-oriented proof-search procedure. We also show that the implementation of our proof-search procedure is competitive with those based on sequent or tableaux calculi.
引用
收藏
页码:127 / 167
页数:41
相关论文
共 50 条