A new evaluation of forward checking and its consequences on efficiency of tools for decomposition of CSPs

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 1, Issue , 2008, Pages 486-490

  Jégou, Philippe ^a   Ndiaye, Samba Ndojh ^a   Terrioux, Cyril ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; CONSTRAINT NETWORKS; DO-MAINS; FINITE DOMAINS; FORWARD CHECKING;

ARTIFICIAL INTELLIGENCE;

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

References (14)

1. C. Bessiére, P. Meseguer, E. C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. Artificial Intelligence, 141:205-224, 2002.
2. S. de Givry, T. Schiex, and G. Verfaillie. Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In Proc. of AAAI, pages 22-27, 2006.
3. R. Dechter. Constraint processing. Morgan Kaufmann Publishers, 2003.
4. R. Dechter and J. Pearl. Tree-Clustering for Constraint Networks. Artificial Intelligence, 38:353-366, 1989.
5. M. Garey and D. Johnson. Computer and Intractability. In Freeman, 1979.
6. G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence, 124:343-282, 2000.
7. R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
8. P. Jègou, S. Ndiaye, and C. Terrioux. A new Evaluation of Forward Checking and its Consequences on Efficiency of Tools for Decomposition of CSPs. Technical report, LSIS, 2008.
9. P. Jègou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146:43-75, 2003.
10. P. Jègou and C. Terrioux. Decomposition and good recording for solving Max-CSPs. In Proc. of ECAI, pages 196-200, 2004.
11. R. Marinescu and R. Dechter. Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. In Proc. of ECAI, pages 138-142, 2006.
12. N. Robertson and P. Seymour. Graph minors II: Algorithmic aspects of treewidth. Algorithms, 7:309-322, 1986.
13. D. Sabin and E. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. In Proc. of ECAI, pages 125-129, 1994.
14. C. Terrioux and P. Jegou. Bounded backtracking for the valued constraint satisfaction problems. In Proc. ofCP, pages 709-723, 2003.