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.
Complexity issues in basic logic / S. Aguzzoli, B. Gerla, Z. Hanikova. - In: SOFT COMPUTING. - ISSN 1432-7643. - 9:12(2005), pp. 919-934. [10.1007/s00500-004-0443-y]
Complexity issues in basic logic
S. AguzzoliPrimo
;
2005
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
