Notes on Monotone Recognition in Multi-Valued Grids-Reference-Cited by-同舟云学术

Notes on Monotone Recognition in Multi-Valued Grids

Published:2019-12-25 Issue: Volume: Page:43-53
ISSN:2579-2784
Container-title:Mathematical Problems of Computer Science
language:en
Short-container-title:

Author:

Aslanyan Levon¹^ORCID,Sahakyan Hasmik¹

Affiliation:

1. Institute for Informatics and Automation Problems of NAS RA

Abstract

A novel method of monotone recognition based on the partitioning of the grid into discrete structures isomorphic to binary cubes (called “cube-split” technique) was proposed in our recent work, and a theoretical level description of two algorithms /algorithmic schemes/ solving this problem was also introduced. This paper provides implementation details of those algorithms, as well as focuses on the recognition of monotone binary functions with a small number of units

Publisher

Institute for Informatics and Automation Problems - NAS RA

Subject

General Medicine

Reference9 articles.

1. V.Korobkov, On Monotone Functions of Algebra of Logic, Prob. Cyb, 13, 1965.

2. V.Alekseev, “On deciphering of some classes of monotone many valued functions”, USSR Computational Mathematics and Mathematical Physics, vol. 16, no. 1, pp. 189-198, 1976.

3. A.Serjantov, “Optimal algorithm for deciphering of some classes of monotone functions”,Journal of Computational Mathematics and Math. Physics, vol. 23, no. 1, pp. 206-212, 1983.

4. N.Zolotyk and A.Chirkov, “On the complexity of deciphering of threshold functions of many-valued logic”, Proceedings of the XI International seminar ”Discrete mathematics and its applications”, Commemorate on the 80th anniversary of academician Lupanov, pp. 63-77, 2012.

5. G. Hansel, “Sur le nombre des fonctiones booleennes monotones de n variables”, C. R. Acad. Sci.p. 262, 1966.