The complexity of McNaughton functions of one variable

被引：17

作者：

Aguzzoli, S ^{[1
]}

机构：

[1] Univ Siena, Dept Math, I-53100 Siena, Italy

来源：

ADVANCES IN APPLIED MATHEMATICS | 1998年 / 21卷 / 01期

关键词：

D O I：

10.1006/aama.1998.0581

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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. (C) 1998 Academic Press.

引用

页码：58 / 77

页数：20

共 11 条

[1] AN ALGORITHMIC DESINGULARIZATION OF 3-DIMENSIONAL TORIC VARIETIES [J].