J. Amilhastre, Représentation par automate d'ensemble de solutions deprobì emes de satisfaction de contraintes, 1999.

J. Amilhastre, H. Fargier, and P. Marquis, Consistency restoration and explanations in dynamic CSPs???Application to configuration, Artificial Intelligence, vol.135, issue.1-2, pp.199-234, 2002.
DOI : 10.1016/S0004-3702(01)00162-X

J. Amilhastre, P. Vilarem, and M. Vilarem, FA Minimisation Heuristics for a Class of Finite Languages, WIA, pp.1-12, 1999.
DOI : 10.1007/3-540-45526-4_1

H. R. Andersen, T. Hadzic, J. N. Hooker, and P. Tiedemann, A Constraint Store Based on Multivalued Decision Diagrams, CP, pp.118-132, 2007.
DOI : 10.1007/978-3-540-74970-7_11

J. Bern, J. Gergov, C. Meinel, and A. Slobodová, Boolean manipulation with free BDD's. First experimental results, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC, pp.200-207, 1994.
DOI : 10.1109/EDTC.1994.326915
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4712

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Boosting systematic search by weighting constraints, ECAI, pp.146-150, 2004.

R. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

H. Cambazard, T. Hadzic, and B. O. Sullivan, Knowledge Compilation for Itemset Mining, ECAI, pp.1109-1110, 2010.

. Team, choco : an open source java constraint programming library, 2010.

F. Giunchiglia and P. Traverso, Planning as Model Checking, ECP, pp.1-20, 1999.
DOI : 10.1007/10720246_1

T. Hadzic, E. Hansen, and B. B. Sullivan, On Automata , MDDs and BDDs in Constraint Satisfaction, ECAI Workshop on Inference methods based on Graphical Structures of Knowledge (WIGSK), 2008.

T. Hadzic, J. N. Hooker, B. O. Sullivan, and P. Tiedemann, Approximate Compilation of Constraints into Multivalued Decision Diagrams, CP, pp.448-462, 2008.
DOI : 10.1007/978-3-540-85958-1_30

J. Hoey, R. St-aubin, A. J. Hu, and C. Boutilier, SPUDD : Stochastic Planning Using Decision Diagrams, UAI, pp.279-288, 1999.

J. Huang and A. Darwiche, DPLL with a Trace : From SAT to Knowledge Compilation, IJCAI, pp.156-162, 2005.

T. Kam, T. Villa, R. Brayton, and A. Sangiovanni-vincentelli, Multi-valued Decision Diagrams : Theory and Applications. Multiple-Valued Logic, pp.9-62, 1998.

C. Lecoutre, L. Sais, S. Tabary, V. Vidal, and J. Lind-nielsen, Transposition tables for constraint satisfaction BuDDy : Binary Decision Diagrams Library Package, release 2, AAAI, pp.243-248, 2002.

R. Mateescu, R. Dechter, and R. Marinescu, AND/OR multi-valued decision diagrams (AOMDDs) for graphical models, J. Artif. Intell. Res. (JAIR), vol.33, pp.465-519, 2008.

A. Niveau, H. Fargier, and C. Pralet, Representing CSPs with Set-Labeled Diagrams: A Compilation Map, Proc. of the 2nd International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR), 2011.
DOI : 10.1007/978-3-642-29449-5_6

A. Niveau, H. Fargier, C. Pralet, and G. Verfaillie, Knowledge compilation using interval automata and applications to planning, ECAI, pp.459-464, 2010.

F. Somenzi, CUDD : Colorado University Decision Diagram package, release 2.4.1, 2005.

A. Srinivasan, T. Ham, S. Malik, and R. Brayton, Algorithms for discrete function manipulation, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers, pp.92-95, 1990.
DOI : 10.1109/ICCAD.1990.129849

K. Strehl and L. Thiele, Symbolic model checking of process networks using interval diagram techniques, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design , ICCAD '98, pp.686-692, 1998.
DOI : 10.1145/288548.289117

P. Torasso and G. Torta, Model-Based Diagnosis Through OBDD Compilation: A Complexity Analysis, Reasoning , Action and Interaction in AI Theories and Systems, pp.287-305, 2006.
DOI : 10.1007/11829263_16

N. R. Vempaty, Solving Constraint Satisfaction Problems Using Finite State Automata, AAAI, pp.453-458, 1992.