Multiple-valued tableaux with Δ-reductions

被引：0
|
作者：
de Guzmán, IP [1 ]
Ojeda-Aciego, M [1 ]
Valverde, A [1 ]
机构：
[1] Univ Malaga, Dept Matemat Aplicada, E-29080 Malaga, Spain
来源：
INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL I AND II | 1999年
关键词：
automated deduction; signed logics;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We introduce the reduced signed logics which generalize previous approaches to signed logics in the sense that each variable is allowed to have its own set of semantic values. Reductions on both signed logics and signed formulas are used to describe improvements in tableau provers for MVLs. A labelled deductive system allows to use the implicit information in the formulas to describe improved expansion rules based on these reductions.
引用
收藏
页码：177 / 183
页数：7
相关论文
共 50 条
12345