(No)good recording and ROBDDs for solving structured (V)CSPs

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2006, Pages 297-304

  Boutaleb, Karim ^a   Jégou, Philippe ^a   Terrioux, Cyril ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DATA STRUCTURES; DECISION MAKING;

BINARY DECISION DIAGRAMS (BDD); CONSTRAINT SATISFACTION PROBLEMS (CSP);

PROBLEM SOLVING;

EID: 38949108286     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2006.1     Document Type: Conference Paper

References (23)

1. S. B. Akers. Binary decision diagrams. IEEE Trans. Computers, 27(6):509-516, 1978.
2. R. I. Bahar, E. A. Frohm, C. M. Gaona, G. D. Hachtel, E. Macii, A. Pardo, and E Somenzi. Algebraic decision diagrams and their applications. In Proc. of ICCAD, pages 188-191, 1993.
3. K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient Implementation of a BDD Package. In Proc. of DAC, pages 40-45, 1990.
4. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers, 35(8):677-691, 1986.
5. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
6. C. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J. P. Warners. Radio Link Frequency Assignment. Constraints, 4:79-89, 1999.
7. A. Darwiche. New advances in compiling cnf to decomposable negational normal form. In Proc. of ECAI, pages 328-332, 2004.
8. R. Dechter and Y. E. Fattah. Topological Parameters for Time-Space Tradeoff. Artificial Intelligence, 125:93-118, 2001.
9. R. Dechter and J. Pearl. Tree-Clustering for Constraint Networks. Artificial Intelligence, 38:353-366, 1989.
10. G. Gottlob, M. Hutle, and E Wotawa. Combining hypertree, bicomp and hinge decomposition. In Proc. of ECAI, pages 161-165, 2002.
11. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124:343-282, 2000.
12. P. Jégou, S. N. Ndiaye, and C. Terrioux. Computing and exploiting tree-decompositions for solving constraint networks. In Proc. of CP, pages 777-781, 2005.
13. P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146:43-75, 2003.
14. P. Jégou and C. Terrioux. Decomposition and good recording for solving Max-CSPs. In Proc. of ECAI, pages 196-200, 2004.
15. J.-C. Madre and J.-P. Billon. Proving circuit correctness using formal comparison between expected and extracted behaviour. In Proc. of DAC, pages 205-210, 1988.
16. D. Miller and R. Drechsler. Implementing a multiple-valued decision diagram package. In Proc. of ISMVL, page 52, 1998.
17. N. Robertson and P. Seymour. Graph minors II: Algorithmic aspects of tree-width. Algorithms, 7:309-322, 1986.
18. M. Sachenbacher and B. C. Williams. Bounded Search and Symbolic Inference for Constraint Optimization. In Proc. of IJCAI, pages 286-291, 2005.
19. T. Schiex, H. Fargier, and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of IJCAI, pages 631-637, 1995.
20. F. Schmiedle, W Günther, and R. Drechsler. Dynamic reencoding during mdd minimization. In Proc. of ISMVL, pages 239-244, 2000.
21. A. Srinivasan, T. Kam, S. Malik, and R. K. Brayton. Algorithms for discrete function manipulation. In Proc. of ICCAD, pages 92-95, 1990.
22. R. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13 (3):566-579, 1984.
23. C. Terrioux and P. Jégou. Bounded backtracking for the valued constraint satisfaction problems. In Proc. of CP, pages 709-723, 2003.