Geodesic
Algorithms using ROBDD as a~base for Boolean constraints
Prikladnaâ diskretnaâ matematika, no. 1 (2010), pp. 86-104

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

In the paper, we study algorithmic properties of ROBDD considered in the role of Boolean constraints in the hybrid (SAT+ROBDD) logical derivation. We suggest ROBDD-analogs for the basic algorithmic procedures used in DPLL-derivation such as variable assignment, unit clause, clause learning, and the techniques of delayed computations. A new algorithm intended for ROBDD reordering is proposed. Computational complexity of all the considered algorithms is provided.
Keywords: logical equations, binary decision diagrams, hybrid logical derivation. 
@article{PDM_2010_1_a6,
     author = {A. S. Ignatiev and A. A. Semenov},
     title = {Algorithms using {ROBDD} as a~base for {Boolean} constraints},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {86--104},
     publisher = {mathdoc},
     number = {1},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_1_a6/}
}
TY  - JOUR
AU  - A. S. Ignatiev
AU  - A. A. Semenov
TI  - Algorithms using ROBDD as a~base for Boolean constraints
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 86
EP  - 104
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_1_a6/
LA  - ru
ID  - PDM_2010_1_a6
ER  - 
%0 Journal Article
%A A. S. Ignatiev
%A A. A. Semenov
%T Algorithms using ROBDD as a~base for Boolean constraints
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 86-104
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_1_a6/
%G ru
%F PDM_2010_1_a6
A. S. Ignatiev; A. A. Semenov. Algorithms using ROBDD as a~base for Boolean constraints. Prikladnaâ diskretnaâ matematika, no. 1 (2010), pp. 86-104. http://geodesic.mathdoc.fr/item/PDM_2010_1_a6/