Chapter 21 Uncertainty and change

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 731-760

  Brown, Kenneth N ^a   Miguel, Ian ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956786694     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80025-8     Document Type: Chapter

References (78)

1. Bartak R., and Surynek P. An improved algorithm for maintaining arc consistency in dynamic constraint satisfaction problems. FLAIRS'05: Proceedings of the Eighteenth International Florida Artificial Intelligence Research Society Conference (2005), AAAI Press 161-166
2. Springer Lecture Notes in Artificial Intelligence. Bartak R., Muller T., and Rudova H. A new approach to modeling and solving minimal perturbation problems. Recent Advances in Constraints 3010 (2004) 223-249
3. Beck J.C., and Wilson N. Job shop scheduling with probabilistic durations. ECAI'04: Proceedings of the Sixteenth European Conference on Artificial Intelligence (2004), IOS Press 652-656
4. Beck J.C., and Wilson N. Proactive algorithms for scheduling with probabilistic durations. IJCAI'05: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (2005), Professional Book Center 1201-1206
5. Springer Lecture Notes in Computer Science. Benoist T., Bourreau E., Caseau Y., and Rottembourg B. Towards stochastic constraint programming: A study of online multichoice knapsack with deadlines. CP'01: Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming 2239 (2001) 61-76
6. Bent R., and van Hentenryck P. The value of consensus in online stochastic scheduling. ICAPS'04: Fourteenth International Conference on Automated Planning and Scheduling (2004), AAAI Press 219-226
7. Bent R., and van Hentenryck P. Regrets only! online stochastic optimization under time constraints. AAAI'04: Proceedings of the Nineteenth National Conference on Artificial Intelligence (2004), AAAI Press 501-506
8. Bent R., and van Hentenryck P. Online stochastic optimization without distributions. ICAPS'05: Fifteenth International Conference on Automated Planning and Scheduling (2005), AAAI Press 171-180
9. Bessiere C. Arc-consistency in dynamic constraint satisfaction problems. AAAI'91: Proceedings of the Ninth National Conference on Artificial Intelligence (1991), AAAI Press/MIT Press 221-226
10. Bessiere C. Arc-consistency for non-binary dynamic CSPs. ECAI'92: Proceedings of the Tenth European Conference on Artificial Intelligence (1992), John Wiley and Sons 23-27
11. Birge J.R., and Louveaux F.V. Introduction to Stochastic Programming (1997), Springer Verlag
12. Bistarelli S., Montanari U., and Rossi F. Constraint solving over semi-rings. IJCAI'95: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (1995), Morgan Kaufmann 624-630
13. Boyd D.B., and Bowen J. Using dependency records to generate design coordination advice in a constraint-based approach to concurrent engineering. Computers in Industry 33 2 (1997) 191-199
14. Davenport A.J., Gefflot C., and Beck J.C. Slack-based techniques for robust schedules. ECP'01: Proceedings of the Sixth European Conference on Planning (2001) 7-18
15. Debruyne R. Arc-consistency in dynamic CSPs is no more prohibitive. ICTAI'96: Proceedings of the Eighth International Conference on Tools with Artificial Intelligence (1996), IEEE Computer Society 299-307
16. Debruyne R., Ferrand G., Jussien N., Lesaint W., Ouis S., and Tessier A. Correctness of constraint retraction algorithms. FLAIRS'03: Proceedings of the Sixteenth International Florida Artificial Intelligence Research Society Conference (2003), AAAI Press 172-176
17. Dechter R., and Dechter A. Belief maintenance in dynamic constraint networks. AAAI'88: Proceedings of the Ninth National Conference on Artificial Intelligence (1988), AAAI Press/MIT Press 37-42
18. Dechter R., and Larkin D. Hybrid processing of belief and constraints. UAI'01: Proceedings of the Seventeenth Annual Conference on Uncertainty in Artificial Intelligence (2001), Morgan Kaufmann 112-119
19. Dechter R., and Mateescu R. Mixtures of deterministic-probabilistic networks and their and/or search space. UAI'04: Proceedings of the Twentieth Annual Conference on Uncertainty in Artificial Intelligence (2004)
20. Dechter R., Meiri I., and Pearl J. Temporal constraint networks. Artificial Intelligence 49 (1991) 61-95
21. Doyle J. A truth maintenance system. Artificial Intelligence 12 (1979) 231-272
22. Dubois D., Fargier H., and Prade H. Possibility theory in constraint satisfaction problems. Applied Intelligence 6 (1996) 287-309
23. El Sakkout H., and Wallace M. Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints 5 4 (2000) 359-388
24. Faltings B., and Macho-Gonzalez S. Open constraint programming. Artificial Intelligence 161 (2005)
25. Springer Lecture Notes in Computer Science. Fargier H., and Lang J. Uncertainty in constraint satisfaction problems: a probalistic approach. ECSQARU'93: Proceedings of the Second European Conference on Symbolic and Qualitative Approaches to Reasoning with Uncertainty 747 (1995) 97-104
26. Fargier H., Lang J., Martin-Clouaire R., and Schiex T. A constraint satisfaction framework for decision under uncertainty. UAI'95: Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (1995), Morgan Kaufmann 167-174
27. Fargier H., Lang J., and Schiex T. Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. AAAI'96: Proceedings of the Thirteenth National Conference on Artificial Intelligence (1996), AAAI Press/MIT Press 175-180
28. Fishman G.S. Monte Carlo: Concepts, Algorithms and Applications (1996), Springer Verlag
29. Fowler D., and Brown K. Branching constraint satisfaction problems and markov decision problems compared. Annals of Operations Research 118 (2003) 85-110
30. Springer Lecture Notes in Computer Science. Fowler D.W., and Brown K.N. Branching constraint satisfaction problems for solutions robust under likely changes. CP2000: Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming 1894 (2000) 500-504
31. Fromherz M., and Conley J. Issues in reactive constraint solving. COTIC'97: Proceedings of the Workshop on Concurrent Constraint Programming for Time Critical Applications (1997)
32. Georget Y., Codognet P., and Rossi F. Constraint retraction in CLP(FD): Formal framework and performance results. Constraints 4 1 (1999) 1-41
33. Ginsberg M. Dynamic backtracking. Journal of Artificial Intelligence Research 1 (1993) 25-46
34. Goodwin P., and Wright G. Decision Analysis for Management Judgment (3e) (2004), Wiley
35. Gross D., and Harris C.M. Fundamentals of Queueing Theory (3e) (1998), Wiley
36. Halpern J. Reasoning about Uncertainty (2003), MIT Press
37. Springer Lecture Notes in Computer Science. Hebrard E., Hnich B., and Walsh T. Super solutions in constraint programming. CPAIOR'04: Proceedings of the First International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems 3011 (2004) 157-172
38. Hebrard E., Hnich B., and Walsh T. Robust solutions for constraint satisfaction and optimization. ECAI'04: Proceedings of the Sixteenth European Conference on Artificial Intelligence (2004), IOS Press 186-190
39. Holland A., and OŚullivan B. Weighted super solutions for constraint programs. AAAI'05: Proceedings of the Twentieth National Conference on Artificial Intelligence (2005), AAAI Press/MIT Press 378-383
40. Jensen F.V. Bayesian Networks and Decision Graphs (2001), Springer
41. Jones P.W., and Smith P. Stochastic Processes (2001), Oxford University Press
42. Jussien N. The versatility of using explanations within constraint programming. Technical Report 03-04-INFO, Ecole des Mines de Nantes (2003)
43. Jussien N., and Barichard V. The PaLM system: Explanation-based constraint programming. TRICS'00: Proceedings of the International Workshop on Techniques for Implementing Constraint Programming Systems (2000) 118-133
44. Springer Lecture Notes in Computer Science. Jussien N., Debruyne R., and Boizumault P. Maintaining arc-consistency within dynamic backtracking. CP'2000: Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming 1894 (2000) 249-261
45. Kambhampati S. Planning graph as a (dynamic) CSP: Exploiting EBL, DDB and other CSP search techniques in graphlan. Journal of Artificial Intelligence Research 12 (2000) 1-34
46. Klir G., and Yuan B. Fuzzy sets and fuzzy logic: theory and applications (1995), Prentice Hall
47. Lamma E., Mello P., Milano M., Cucchiara R., Gavanelli M., and Piccardi M. Constraint propagation and value acquisition: Why we should do it interactively. IJCAI'99: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (1999), Morgan Kaufmann 467-473
48. Littman M., Majercik S., and Pitassi T. Stochastic boolean satisfiability. Journal of Automated Reasoning 27 3 (2001) 251-296
49. Macho-Gonzalez S., and Meseguer P. Open, interactive and dynamic CSP. Proceedings of the International Workshop on Constraint Solving under Change and Uncertainty (2005) 13-17
50. Manander S., Tarim A., and Walsh T. Scenario-based stochastic constraint programming. IJCAI'03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (2003), Morgan Kaufmann 257-262
51. Miguel I., and Shen Q. Fuzzy rrDFCSP and planning. Artificial Intelligence 148 1-2 (2003) 11-52
52. Minton S., Johnston M.D., Philps A.B., and Laird P. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 (1992) 161-205
53. Mittal S., and Falkenhainer B. Dynamic constraint satisfaction problems. AAAI'90: Proceedings of the Eighth National Conference on Artificial Intelligence (1990), AAAI Press/MIT Press 25-32
54. Morris P., Muscettola N., and Vidal T. Dynamic control of plans with temporal uncertainty. IJCAI'01: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (2001), Morgan Kaufmann 494-502
55. Springer Lecture Notes in Computer Science. Mouhoub M. Arc consistency for dynamic CSPs. KES'03: Proceedings of the Seventh International Conference on Knowledge-based Intelligent Information and Engineering Systems 2773 (2003) 393-400
56. Neveu B., and Berlandier P. Maintaining arc consistency through constraint retraction. ICTAI'94: Proceedings of the Sixth International Conference on Tools with Artificial Intelligence (1994), IEEE Computer Society 426-431
57. Pack Kaelbling L., Littman M., and Cassandra A. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101 (1998) 99-134
58. Pearl J. Probabilistic Reasoning in Intelligent Systems (1988), Morgan Kaufmann
59. Petcu A., and Faltings B. Optimal solution stability in continuous-time optimization. DCR'05: Proceedings of the Sixth International Workshop on Distributed Constraint Reasoning (2005) 207-221
60. Policella N., and Rasconi R. Looking for a common scheduling perturbations benchmark. Changes'05: Proceedings of the International Workshop on Constraint Solving under Change and Uncertainty. Sitges (2005) 23-27
61. Springer Lecture Notes in Computer Science. Policella N., Oddi A., Smith S.F., and Cesta A. Generating robust partial order schedules. CP'04: Proceedings of the Tenth International Conference on the Principles and Practice of Constraint Programming volume 3258 (2004) 406-511
62. Policella N., Smith S.F., Cesta A., and Oddi A. Generating robust schedules through temporal flexibility. ICAPS'04: Fourteenth International Conference on Automated Planning and Scheduling (2004), AAAI Press 209-218
63. Pralet C., Verfaillie G., and Schiex T. Composite graphical models for reasoning about uncertainties, feasibilities, and utilities. Soft'05: Proceedings of the Seventh International Workshop on Preferences and Soft Constraints. Sitges (2005) 104-118
64. Prosser P., Conway C., and Muller C. A constraint maintenance system for the distributed resource allocation problem. Intelligent Systems Engineering 1 1 (1992)
65. Puterman M.L. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994), Wiley
66. Springer Lecture Notes in Computer Science. Roos N., Ran Y., and van den Herik J. Combining local search and constraint propagation to find a minimal change solution for a dynamic CSP. AIMSA'00: Proceedings of the Ninth International Conference on Artificial Intelligence: Methodology, Systems, and Applications volume 1904 (2000) 272-282
67. Sabin M., and Freuder E. Detecting and resolving inconsistency and redundancy in conditional constraint satisfaction problems. Proceedings of the CP'98 Workshop on Constraint Problem Reformulation (1998)
68. Schiex T., and Verfaillie G. Nogood recording for static and dynamic constraint satisfaction problems. International Journal of Artificial Intelligence Tools 3 2 (1994) 187-207
69. Schiex T., Fargier H., and Verfaillie G. Valued constraint satisfaction problems: Hard and easy problems. IJCAI'95: Proceedings of the fourteenth International Joint Conference on Artificial Intelligence (1995), Morgan Kaufmann 631-637
70. Springer Lecture Notes in Computer Science. Surynek P., and Bartak R. A new algorithm for maintaining arc consistency after constraint retraction. CP'04: Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming volume 3258 (2004) 767-771
71. van Hentenryck P., and Provost T.L. Incremental search in constraint logic programming. New Generation Computing 9 (1991) 257-275
72. Verfaillie G., and Jussien N. Constraint solving in uncertain and dynamic environments: A survey. Constraints 10 3 (2005) 253-281
73. Verfaillie G., and Schiex T. Solution reuse in dynamic constraint satisfaction problems. AAAI'94: Proceedings of the Twelfth National Conference on Artificial Intelligence (1994), AAAI Press 307-312
74. Vidal T., and Fargier H. Handling contingency in temporal constraint networks: From consistency to controllabilities. Journal of Experimental and Theoretical Artificial Intelligence 11 (1999) 23-45
75. Springer Lecture Notes in Computer Science. Wallace R.J., and Freuder E.C. Stable solutions for dynamic constraint satisfaction problems. CP'98: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming volume 1520 (1998) 447-461
76. Walsh T. Stochastic constraint programming. ECAI'02: Proceedings of the Fifteenth European Conference on Artificial Intelligence (2002), IOS Press 111-115
77. Springer Lecture Notes in Computer Science. Yorke-Smith N., and Gervet C. Certainty closure: A framework for reliable constraint reasoning with uncertainty. CP'03: Proceedings of the Ninth International Conference on Principles and Practice of Constraint volume 2833 (2003) 769-783
78. Yorke-Smith N., Venable K.B., and Rossi F. Temporal reasoning with preferences and uncertainty. IJCAI'03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (2003), Morgan Kaufmann 1385-1386