Geodesic
Technology for translating combinatorial problems into Boolean equations
Prikladnaâ diskretnaâ matematika, no. 1 (2011), pp. 96-115

Voir la notice de l'article provenant de la source Math-Net.Ru

The article is devoted to converting combinatorial problems into the problems of solving Boolean equations. Some theoretical results are presented as the basis of technology for propositional encoding of algorithms calculating discrete functions. Software system Transalg implementing the technology is described. Examples of using the Transalg for translating cryptoanalysis algorithms to SAT-problem are presented. The technics for translating 0-1-ILP optimization algorithms into SAT are considered too.
Keywords: discrete functions, Boolean equations, cryptoanalysis, propositional encoding. 
@article{PDM_2011_1_a6,
     author = {I. V. Otpuschennikov and A. A. Semenov},
     title = {Technology for translating combinatorial problems into {Boolean} equations},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {96--115},
     publisher = {mathdoc},
     number = {1},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_1_a6/}
}
TY  - JOUR
AU  - I. V. Otpuschennikov
AU  - A. A. Semenov
TI  - Technology for translating combinatorial problems into Boolean equations
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 96
EP  - 115
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_1_a6/
LA  - ru
ID  - PDM_2011_1_a6
ER  - 
%0 Journal Article
%A I. V. Otpuschennikov
%A A. A. Semenov
%T Technology for translating combinatorial problems into Boolean equations
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 96-115
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_1_a6/
%G ru
%F PDM_2011_1_a6
I. V. Otpuschennikov; A. A. Semenov. Technology for translating combinatorial problems into Boolean equations. Prikladnaâ diskretnaâ matematika, no. 1 (2011), pp. 96-115. http://geodesic.mathdoc.fr/item/PDM_2011_1_a6/