Regular Article: The Complexity of McNaughton Functions of One Variable

Authors:
Stefano Aguzzoli
Affiliations:
Department of Mathematics, University of Siena, Via del Capitano 15, 53100, Siena, Italy
Venue:
Advances in Applied Mathematics
Year:
1998

Citing 0
Cited 4

Complexity of many-valued logics

Beyond two
Weierstrass approximation theorem and Łukasiewicz formulas with one quantified variable

Beyond two
Formulas of łukasiewicz's logic represented by hyperplanes

IFSA'03 Proceedings of the 10th international fuzzy systems association World Congress conference on Fuzzy sets and systems
On the failure of the finite model property in some Fuzzy Description Logics

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.00

Visualization

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.