|
Bulletin of Irkutsk State University. Series Mathematics, 2011, Volume 4, Issue 1, Pages 83–96
(Mi iigum96)
|
|
|
|
Transformations of discrete functions calculation algorithms to boolean equations
I. V. Otpuschennikov, A. A. Semenov Institute for System Dynamics and Control Theory of SB RAS, Lermontov str., 134, Post Box 292, 664033, Irkutsk, Russia
Abstract:
The article is devoted to the problem of transforming algorithmic descriptions of discrete functions to their equational descriptions in the form of boolean equations. We propose an approach based on propositional encoding procedures for binary random access machine programs. These procedures are used to build transformations of high-level descriptions of discrete functions calculation algorithms to boolean equations.
Keywords:
discrete functions; boolean equations; random access machines.
Citation:
I. V. Otpuschennikov, A. A. Semenov, “Transformations of discrete functions calculation algorithms to boolean equations”, Bulletin of Irkutsk State University. Series Mathematics, 4:1 (2011), 83–96
Linking options:
https://www.mathnet.ru/eng/iigum96 https://www.mathnet.ru/eng/iigum/v4/i1/p83
|
Statistics & downloads: |
Abstract page: | 189 | Full-text PDF : | 102 | References: | 30 |
|