Binary resolution over complete residuated Stone lattices

被引：10

作者：

Guller, Dusan ^{[1
]}

机构：

[1] Comenius Univ, Dept Appl Informat, Bratislava 84215, Slovakia

来源：

FUZZY SETS AND SYSTEMS | 2008年 / 159卷 / 09期

关键词：

resolution proof methods; automated deduction; many-valued logics; knowledge representation and reasoning;

D O I：

10.1016/j.fss.2007.10.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper extends previous results obtained for binary resolution proof method over complete Boolean lattices. We shall assume that truth Values form a complete residuated Stone lattice. In addition, we investigate binary resolution over residuated lattices with strict negation. The refutational soundness and completeness of the generalised resolution proof method will be proved. Finally, we discuss the boundaries of the refutational completeness over arbitrary residuated lattices. (c) 2007 Elsevier B.V. All rights reserved.

引用

页码：1031 / 1041

页数：11