In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of Product logic are defined and their properties are exploited.
Finite-Valued Approximations of Product Logic / Stefano Aguzzoli, Brunella Gerla - In: Proceedings of 30th IEEE International Symposium on Multiple-Valued LogicLos Alamitos, Calif. : IEEE Computer Society Press, 2000. - ISBN 0-7695-0692-5. - pp. 179-184 (( Intervento presentato al 30. convegno ISMVL’2000 tenutosi a Portland (USA) nel 2000.
Finite-Valued Approximations of Product Logic
Stefano Aguzzoli;
2000
Abstract
In this paper we shall propose a method for the reduction of the problem of decidability in propositional infinite-valued Product Logic to suitably determined finite-valued approximating logics. In order to do so, functions associated with formulas of Product logic are defined and their properties are exploited.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
