Abstract
We consider the problem of decoding a two-valued monotone function \(f \) defined on a \(k \)-valued \(n \)-dimensional cube. The traditional approach to solving this problem is to construct a Shannon-optimal algorithm. The Shannon-optimal decoding algorithm has minimal “worst-case” complexity (efficient for the most difficult case). The authors propose and study an approach to the decoding problem based on the application of an asymptotically optimal dualization algorithm over the product of \(k \)-valued chains. The asymptotically optimal decoding of the function \(f\) is aimed at the “typical case” (typical version of the problem). The conditions for the applicability of the traditional and new approaches are experimentally revealed. \(k \)
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
Korobkov, V.K., On monotone functions of the algebra of logic, in Sb. Problemy kibernetiki. Vyp. 13 (Collect. Probl. Cybern. Iss. 13), Moscow: Nauka, 1965, pp. 5–28.
Hansel, G., Sur le nombre des fonctions booleennes monotones de \(n \) variables. C. R. Acad. Sci., Paris, Sér. B, 1966, vol. 262, 1088-1090. Translated under the title: O chisle monotonnykh bulevykh funktsii \(n\) peremennykh, in Kibern. Sb. Nov. Ser. Iss. 5, Moscow: Mir, 1968, pp. 53–57.
Alekseev, V.B., Deciphering of some classes of monotonic many-valued functions, USSR Comput. Math. Math. Phys., 1976, vol. 16, no. 1, pp. 180–189.
Agrawal, R., Imielinski, T., and Swami, A., Mining association rules between sets of items in large databases, Proc. 1993 ACM SIGMOD Int. Conf. Manage. Data (1993), pp. 207–216.
Zhuravlev, Yu.I., Ryazanov, V.V., and Sen’ko, O.V., Raspoznavanie. Matematicheskie metody. Programmnaya sistema. Prakticheskie primeneniya. T. 176 (Recognition. Mathematical Methods. Software System. Practical Applications. Vol. 176), Moscow: FAZIS, 2006.
Dragunov, N.A. and Djukova, E.V., Finding minimal infrequent and maximal frequent sets in partially ordered data, Mat. Metody Raspoznavaniya Obrazov: Tez. Dokl. 9-i Vseross. Konf. Mezhdunar. Uchastiem (Math. Methods Pattern Recognit.: Abstr. 9th All-Russ. Conf. Int. Participation) (2019), pp. 10–12.
Djukova, E.V., Maslyakov, G.O., and Prokofjev, P.A., Dualization problem over the product of chains: asymptotic estimates for the number of solutions, Dokl. Math., 2018, vol. 98, no. 3, pp. 564–567.
Johnson, D.S., Yannakakis, M., and Papadimitriou, C.H., On general all maximal independent sets, Inf. Process. Lett., 1988, vol. 27, no. 3, pp. 119–123.
Fredman, M.L. and Khachiyan, L., On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, 1996, no. 21, pp. 618–628.
Djukova, E.V., On an asymptotically optimal algorithm for constructing irredundant tests, Dokl. Akad. Nauk SSSR, 1977, vol. 233, no. 4, pp. 423–426.
Murakami, K. and Uno, T., Efficient algorithms for dualizing large-scale hypergraphs, Discrete Appl. Math., 2014, vol. 170, pp. 83–94.
Aggarwal, C., Frequent Pattern Mining, Switzerland: Springer Int., 2014.
Elbassioni, K., On finding minimal infrequent elements in multidimensional data defined over partially ordered sets, 2014. https://arxiv.org/abs/1411.2275.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by V. Potapchouck
Rights and permissions
About this article
Cite this article
Dragunov, N.A., Djukova, E.V. One Approach to Decoding Monotone Logical Function. Autom Remote Control 83, 1600–1607 (2022). https://doi.org/10.1134/S00051179220100125
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S00051179220100125