arrow
返回

Complexity issues in basic logic

delete2005-05-31
delete25
PRE
AI
S
Stefano Aguzzoli
B
Brunella Gerla
Z
Zuzana Haniková
DOI:10.1007/s00500-004-0443-ydelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We survey complexity results concerning a family of propositional many-valued logics. In particular, we shall address satisfiability and tautologousness problems for Hajek's Basic Logic BL and for several of its schematic extensions. We shall review complexity bounds obtained from functional representation results, as well as techniques for dealing with non-trivial ordinal sums of continuous t-norms.
Keyword:
ALGEBRAS

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

暂无机构信息
引用论文

引用论文

5GTN: A test network for 5G application development and testing
err2016-06-01
err0
PREAI
errEsa Piri; Pekka Ruuska; Teemu Kanstren; Jukka Makela; Jari Korva; Atso Hekkala; Ari Pouttu; Olli Liinamaa; Matti Latva-aho; Kari Vierimaa; Harri Valasma
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容