An approach for dynamic split strategies in constraint solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3789 LNAI, Issue , 2005, Pages 162-174

  Castro, Carlos ^a   Monfroy, Eric ^a,b   Figueroa, Christian ^a   Meneses, Rafael ^a  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; METADATA; PROBLEM SOLVING;

CONSTRAINT PROGRAMMING; META-BACKTRACKS; RESOLUTION PERFORMANCES;

LOGIC PROGRAMMING;

EID: 33646814014     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11579427_17     Document Type: Conference Paper

References (17)

1. K. R. Apt. Principles of Constraint Programming. Cambridge Univ. Press, 2003.
2. J. C. Beck, P. Presser, and R. Wallace. Variable Ordering Heuristics Show Promise. In Proceedings of the International Conference on Principles and Practice of Constraint Programming, CP'2004, volume 3258 of Lecture Notes in Computer Science, pages 711-715, 2004.
3. J. Borrett, E. Tsang, and N. Walsh. Adaptive constraint satisfaction, In 15th UK Planning and Scheduling Special Interest Group Workshop, Liverpool, 1996.
4. J. E. Borrett, E. P. K. Tsang, and N. R. Walsh. Adaptive constraint satisfaction: The quickest first principle. In Proceedings of 12th European Conference on Artificial Intelligence, ECAI'1996, pages 160-164. John Wiley and Sons, 1996.
5. M. Bruynooghe, Intelligent Backtracking Revisited. In J.-L. Lassez and G. Plotkin, editors, Computational Logic, Essays in Honor of Alan Robinson. MIT Press, 1991.
6. T. Carchrae and J. C. Beck. Low-Knowledge Algorithm Control. In Proceedings of the National Conference on Artificial Intelligence, AAAI 2004, pages 49-54, 2004.
7. Y. Caseau and F. Laburthe. Improved clp scheduling with task intervals. In Proceedings of the International Conference on Logic Programming, ICLP'1994, pages 369-383. MIT Press, 1994.
8. H. El Sakkout, M. Wallace, and B. Richards. An instance of adaptive constraint propagation. In Proceedings of the Int. Conference on Principles and Practice of Constraint Programming, CP'96, volume 1118 of Lecture Notes in Computer Science, pages 164-178. Springer, 1996.
9. P. Flener, B. Hnich, and Z. Kiziltan. A meta-heuristic for subset problems. In Proceedings of Practical Aspects of Declarative Languages, PADL'2001, volume 1990 of Lecture Notes in Computer Science, pages 274-287. Springer, 2001.
10. C. Gebruers, A. Guerri, B. Hnich, and M. Milano. Making choices using structure at the instance level within a case based reasoning framework. In Proceedings of CPAIOR'2004, volume 3011 of Lecture Notes in Computer Science, pages 380-386. Springer, 2004.
11. C. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of AAAI'98, pages 431-437, Madison, Wisconsin, 1998.
12. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, and B. Selman. Boosting combinatorial search through randomization. In Proceedings of AAAI'2002, pages 674-682, 2002.
13. V. Kumar. Algorithms for Constraint-Satisfaction Problems: A Survey. Artificial Intelligence Magazine, 13(1):32-44, Spring 1992.
14. A. K. Mackworth. Consistency in Networks of Relations. AI, 8:99-118, 1977.
15. E. Monfroy and C. Castro. A Component Language for Hybrid Solver Cooperations. In Proceedings of ADVIS, volume 3261 of Lecture Notes in Computer Science, pages 192-202, 2004.
16. E. Monfroy, F. Saubion, and T. Lambert. On hybridization of local search and constraint propagation. In Proceedings of the Int. Conference on Logic Programming, ICLP 2004, volume 3132 of Lecture Notes in Computer Science, pages 299-313, 2004.
17. C. Schulte and P. J. Stuckey. Speeding up constraint propagation. In Proceedings of International Conference on Principles and Practice of Constraint Programming, CP'2004, volume 3258 of Lecture Notes in Computer Science, pages 619-633, 2004.