RESOLUTION FOR MANY VALUED LOGICS

被引:0
|
作者
BAAZ, M [1 ]
FERMULLER, CG [1 ]
机构
[1] VIENNA TECH UNIV, INST COMP, A-1040 VIENNA, AUSTRIA
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To achieve efficient proof procedures for quantificational logics with finitely many truth values we extend the classical resolution principle. By generalizing the notion of a semantic tree we demonstrate the completeness of resolution and of some effective refinements. We also present translation calculi that convert formulae of many valued logics to clause syntax. As an application we investigate some well known examples of many-valued logics.
引用
收藏
页码:107 / 118
页数:12
相关论文
共 50 条