THE COMPLEXITY OF MCNAUGHTON FUNCTIONS OF ONE VARIABLE

Authors
Citation
S. Aguzzoli, THE COMPLEXITY OF MCNAUGHTON FUNCTIONS OF ONE VARIABLE, Advances in applied mathematics, 21(1), 1998, pp. 58-77
Citations number
11
Categorie Soggetti
Mathematics,Mathematics
ISSN journal
01968858
Volume
21
Issue
1
Year of publication
1998
Pages
58 - 77
Database
ISI
SICI code
0196-8858(1998)21:1<58:TCOMFO>2.0.ZU;2-I
Abstract
McNaughton functions play the same role in Lukasiewicz logics as Boole an functions do in classical logic. Formulas in one variable are an im portant ingredient of automated deduction in many-valued logics: the a im of this paper is to establish some results on the complexity of the problems of function representation and formula minimization. (C) 199 8 Academic Press.