Geodesic
Application of SAT-approach for solving combinatorial problems
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 68-69.

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

In the report, we present results of applying symbolic computation algorithms to solving discrete automata research problems (e.g. problems of analysis of discrete models of gene networks) and combinatorial optimization problems. In all cases, an original problem is translated into Boolean equations (and after this to SAT) and then is solved using SAT-solver. Optimization problems are solved in distributed computing environments with the help of the SAT-solver specially developed for this task. 
@article{PDM_2011_13_a34,
     author = {A. A. Semenov and I. V. Otpuschennikov and S. E. Kochemazov},
     title = {Application of {SAT-approach} for solving combinatorial problems},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {68--69},
     publisher = {mathdoc},
     number = {13},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a34/}
}
TY  - JOUR
AU  - A. A. Semenov
AU  - I. V. Otpuschennikov
AU  - S. E. Kochemazov
TI  - Application of SAT-approach for solving combinatorial problems
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 68
EP  - 69
IS  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_13_a34/
LA  - ru
ID  - PDM_2011_13_a34
ER  - 
%0 Journal Article
%A A. A. Semenov
%A I. V. Otpuschennikov
%A S. E. Kochemazov
%T Application of SAT-approach for solving combinatorial problems
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 68-69
%N 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_13_a34/
%G ru
%F PDM_2011_13_a34
A. A. Semenov; I. V. Otpuschennikov; S. E. Kochemazov. Application of SAT-approach for solving combinatorial problems. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 68-69. http://geodesic.mathdoc.fr/item/PDM_2011_13_a34/

[1] Khopkroft Dzh., Motvani R., Ulman Dzh., Vvedenie v teoriyu avtomatov, yazykov i vychislenii, Vilyams, M., 2002

[2] Semenov A. A., Otpuschennikov I. V., Kochemazov S. E., “Propozitsionalnyi podkhod v zadachakh testirovaniya diskretnykh avtomatov”, Sovremennye tekhnologii. Sistemnyi analiz. Modelirovanie, 2009, no. 4, 48–56

[3] Up-to-date links for the SATisfability Problem http://www.satlive.org

[4] N. A. Kolchanov, S. S. Goncharov, V. A. Likhoshvai, V. A. Ivanisenko (red.), Sistemnaya kompyuternaya biologiya, Izd-vo SO RAN, Novosibirsk, 2008

[5] Evdokimov A. A., Kochemazov S. E., Semenov A. A., “Primenenie simvolnykh vychislenii k issledovaniyu diskretnykh modelei nekotorykh klassov gennykh setei”, Vychislitelnye tekhnologii, 16:1 (2011), 30–47