Super solutions in constraint programming

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

Volumn 3011, Issue , 2004, Pages 157-172

  Hebrard, Emmanuel ^a   Hnich, Brahim ^a   Walsh, Toby ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION; CONSTRAINT THEORY; OPTIMIZATION;

CONSTRAINT OPTIMIZATION PROBLEMS; CONSTRAINT PROGRAMMING; PROPOSITIONAL SATISFIABILITY; ROBUST SOLUTIONS; SEARCH METHOD; SEARCH-BASED; SUPER-SOLUTIONS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048886534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24664-0_11     Document Type: Article

References (18)

1. R. Dechter D. Frost, C Bessière and J. C. Régin. Random uniform CSP generator. url: http://www.ics.uci.edu/∼dfrost/csp/generator.html, 1996.
2. A. Dechter and R. Dechter. Belief maintenance in dynamic constraint networks. In Proceedings AAAI-88, pages 37-42, 1988.
3. E. Hebrard B. Hnich and T. Walsh. Super CSPs. Technical Report APES-66-2003, APES Research Group, 2003.
4. D.W. Fowler and K.N. Brown. Branching constraint satisfaction problems for solutions robust under likely changes. In Proceedings CP-00, pages 500-504, 2000.
5. E. C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32:755-761, 1985.
6. E. C. Freuder. Partial Constraint Satisfaction. In Proceedings IJCAI-89, pages 278-283, 1989.
7. E. C. Freuder. Eliminating Interchangeable Values in Constraint Satisfaction Problems. In Proceedings AAAI-91, pages 227-233, 1991.
8. J. Gaschnig. A constraint satisfaction method for inference making. In Proceedings of the 12th Annual Allerton Conference on Circuit and System Theory. University of Illinois, Urbana-Champaign, USA, 1974.
9. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Technical report CMU-CS-79-124, Carnegie-Mellon University, 1979. PhD thesis.
10. I. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proceedings AAAI-96, pages 246-252, 1996.
11. N. Jussien, R. Debruyne, and P. Boizumault. Maintaining arc-consistency within dynamic backtracking. In Proceedings CP-00, pages 249-261, 2000.
12. A. Parkes M. Ginsberg and A. Roy. Supermodels and robustness. In Proceedings AAAI-98, pages 334-339, 1998.
13. I. Miguel. Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning. PhD thesis, University of Edinburgh, 2001.
14. T. Schiex and G. Verfaillie. Nogood recording for static and dynamic constraint satisfaction problem. IJAIT, 3(2):187-207, 1994.
15. T. Walsh. SAT v CSP. In Proceedings CP-2000, pages 441-456, 2000.
16. T. Walsh. Stochastic constraint programming. In Proceedings ECAI-02, 2002.
17. J. P. Watson, L. Barbulescu, A.E. Howe, and L.D. Whitley. Algorithms performance and problem structure for flow-shop scheduling. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 688-695, 1999.
18. R. Weigel and C. Bliek. On reformulation of constraint satisfaction problems. In Proceedings ECAI-98, pages 254-258, 1998.