Robust solutions for constraint satisfaction and optimization

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 186-190

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

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

And department of information science; Cork constraint computation centre; University college cork; Uppsala university

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; JOB SHOP SCHEDULING;

AND DEPARTMENT OF INFORMATION SCIENCE; CONSTRAINT OPTIMIZATIONS; CONSTRAINT PROGRAMS; CONSTRAINT SATISFACTION; CORK CONSTRAINT COMPUTATION CENTER; MAKESPAN; ROBUST SOLUTIONS; SUPERSOLUTION; UNIVERSITY COLLEGE CORK; UPPSALA UNIVERSITY;

REPAIR;

EID: 85017346577     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. A. Dechter and R. Dechter, 'Belief maintenance in dynamic constraint networks', in Proceedings AAAI'88, pp. 37-42, (1988).
2. H. Fargier and J. Lang, 'Uncertainty in constraint satisfaction problems: A probalistic approach', in Proceedings ECSQARU'93, pp. 97- 104, (1993).
3. H. Fargier, J. Lang, and T. Schiex, 'Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge', in Proceedings AAAI'96, pp. 175-180, (1996).
4. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh, 'Breaking row and column symmetries in matrix models', in Proceedings CP'02, pp. 462-476, (2002).
5. D.W. Fowler and K. N. Brown, 'Branching constraint satisfaction problems for solutions robust under likely changes', in Proceedings CP'00, pp. 500-504, (2000).
6. E. C. Freuder, 'Partial Constraint Satisfaction', in Proceedings IJCAI' 89, pp. 278-283, (1989).
7. J. Gaschnig, 'A constraint satisfaction method for inference making', in Proceedings of the 12th Annual Allerton Conference on Circuit and System Theory.(1974).
8. J. Gaschnig, 'Performance measurement and analysis of certain search algorithms', Technical report CMU-CS-79-124, Carnegie-Mellon University, (1979). PhD thesis.
9. M. Ginsberg, A. Parkes, and A. Roy, 'Supermodels and robustness', in Proceedings AAAI'98, pp. 334-339, (1998).
10. E. Hebrard, B. Hnich, and T. Walsh, 'Super solutions in constraint programming', in Proceedings CPAIOR'04, pp. 157-172, (2004).
11. P. Meseguer and C. Torras, 'Solving strategies for highly symmetric CSPs', in Proceedings IJCAI'99, pp. 400-405, (1999).
12. I. Miguel, Dynamic Flexible Constraint Satisfaction and Its Application to AI Planning, Ph.D. dissertation, University of Edinburgh, 2001.
13. A. Roy and C. Wilson, 'Supermodels and closed sets', Electronic Colloquium on Computational Complexity (ECCC), (2000).
14. E. D. Taillard, 'Benchmarks for basic scheduling problems', European Journal of Operational Research, (1993).
15. G. Verfaillie and N. Jussien, Dynamic constraint solving. Tutorial - online notes available http://www.emn.fr/jussien/CP03tutorial.
16. T. Walsh, Stochastic constraint programming, in Proceedings ECAI'02, (2002).
17. R. Weigel and C. Bliek, On reformulation of constraint satisfaction problems, in Proceedings ECAI'98, pp. 254-258, (1998).