The Complexity of McNaughton Functions of One Variable-Reference-Cited by-同舟云学术

The Complexity of McNaughton Functions of One Variable

Published:1998-07 Issue:1 Volume:21 Page:58-77
ISSN:0196-8858
Container-title:Advances in Applied Mathematics
language:en
Short-container-title:Advances in Applied Mathematics

Author:

Aguzzoli Stefano

Publisher

Elsevier BV

Subject

Applied Mathematics

Reference10 articles.

1. An algorithmic desingularization of three-dimensional toric varieties;Aguzzoli;Tohoku Math. J.,1994

2. J. Łukasiewicz, A. Tarski, Untersuchungen über den Aussagenkalkül, Comptes Rendus des séances de la Société des Sciences et des Lettres de Varsovie, 23, 1930, 30, 50, Clarendon, Oxford, 1956

3. A theorem about infinite-valued sentential logic;McNaughton;J. Symbolic Logic,1951

4. Satisfiability in many-valued sentential logic is NP-complete;Mundici;Theoret. Comput. Sci.,1987

5. Normal forms in infinite-valued logic: the case of one variable;Mundici;Lecture Notes in Comput. Sci.,1992

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient representation of piecewise linear functions into Łukasiewicz logic modulo satisfiability;Mathematical Structures in Computer Science;2022-05-17

2. An Efficient Algorithm for Representing Piecewise Linear Functions into Logic;Electronic Notes in Theoretical Computer Science;2020-09

3. Word problems in Elliott monoids;Advances in Mathematics;2018-09

4. On the failure of the finite model property in some Fuzzy Description Logics;Fuzzy Sets and Systems;2011-06

5. Infinite-Valued Lukasiewicz Logic Based on Principal Lattice Filters;2010 40th IEEE International Symposium on Multiple-Valued Logic;2010