McNaughton functions play the same role in Lukasiewicz logics as Boolean functions do in classical logic. Formulas in one variable are an important ingredient of automated deduction in many-valued logics: the aim of this paper is to establish some results on the complexity of the problems of function representation and formula minimization.
The complexity of McNaughton functions of one variable / S. Aguzzoli. - In: ADVANCES IN APPLIED MATHEMATICS. - ISSN 0196-8858. - 21:1(1998), pp. 58-77. [10.1006/aama.1998.0581]
The complexity of McNaughton functions of one variable
S. AguzzoliPrimo
1998
Abstract
McNaughton functions play the same role in Lukasiewicz logics as Boolean functions do in classical logic. Formulas in one variable are an important ingredient of automated deduction in many-valued logics: the aim of this paper is to establish some results on the complexity of the problems of function representation and formula minimization.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I metadati presenti in AIR sono rilasciati con licenza CCO mentre i file delle pubblicazioni sono rilasciati con licenza CC BY-SA, salvo diversa indicazione. In caso di violazione di copyright, contattare l'assistenza di AIR
