Finite Satisfiability in Infinite-Valued Lukasiewicz Logic

被引：0
|
作者：
Schockaert, Steven [1 ]
Janssen, Jeroen [2 ]
Verrmeir, Dirk [2 ]
De Cock, Martine [1 ,3 ]
机构：
[1] Univ Ghent, Dept Appl Math & Comp Sci, Ghent, Belgium
[2] Vrije Univ Brussel, Dept Comp Sci, Brussels, Belgium
[3] Univ Washington, Inst Technol, Tacoma, WA USA
来源：
SCALABLE UNCERTAINTY MANAGEMENT, PROCEEDINGS | 2009年 / 5785卷
关键词：
CALCULUS; SAT;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Although it is well-known that every satisfiable formula in Lukasiewicz' infinite-valued logic L-infinity can be satisfied in some finite-valued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L-infinity, we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case tipper bound of Aguzzoli et al.
引用
收藏
页码：240 / +
页数：3
相关论文
共 50 条
12345