Chapter 9 Soft constraints

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 281-328

  Meseguer, Pedro ^a   Rossi, Francesca ^b   Schiex, Thomas ^c  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b UNIVERSITY OF PADOVA   (Italy)

^c CEMAGREF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956843030     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80013-1     Document Type: Chapter

References (112)

1. Aceto L., Hansen J.A., Ingólfsdóttir A., Johnsen J., and Knudsen J. The complexity of checking consistency of pedigree information and related problems. J. Comput. Sci. Technol. 19 1 (2004) 42-59
2. Apt K.R. Principles of Constraint Programming (2003), Cambridge University Press
3. Arnborg S. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT 25 (1985) 2-23
4. Pisa, Italy. Baptiste P., Pape C.L., and Peridy L. Global constraints for partial CSPs: a case-study of resource and due date constraints. Proc. of CP'98. LNCS volume 1520 (1998) 87-101
5. Nice, France. Beldiceanu N., and Petit T. Cost Evaluation of Soft Global Constraints. Proc. of CPAIOR'04. LNCS volume 3011 (2004) 80-95
6. Bensana E., Lemaître M., and Verfaillie G. Earth observation satellite management. Constraints 4 3 (1999) 293-299
7. Bertelé U., and Brioshi F. Nonserial Dynamic Programming (1972), Academic Press
8. Acapulco, Mexico. Bessière C., Fabre A., and Junker U. Propagate the right thing: How preferences can speed-up constraint solving. Proc. of IJCAI'03 (2003) 191-196
9. Montréal, Canada. Bistarelli S., Montanari U., and Rossi F. Constraint solving over semirings. Proc. of IJCAI'95 (1995) 624-630
10. Bistarelli S., Montanari U., and Rossi F. Semiring based constraint solving and optimization. Journal of the ACM 44 2 (1997) 201-236
11. Bistarelli S., Fargier H., Montanari U., Rossi F., Schiex T., and Verfaillie G. Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4 (1999) 199-240
12. Bistarelli S., Codognet P., Georget Y., and Rossi F. Labeling and partial local consistency for soft constraint programming. Proc. of PADL'00. LNCS volume 1753 (2000) 230-248
13. Borning A., Mahert M., Martindale A., and Wilson M. Constraint hierarchies and logic programming. Proc. of ICLP'89 (1989), MIT Press 149-164
14. Boutilier C., Brafman R.I., Domshlak C., Hoos H., and Poole D. CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research 21 (2004) 135-191
15. Portland, OR, USA. Bresina J.L. Heuristic-biased stochastic sampling. Proc. of AAAI'96 (1996) 271-278
16. Cabon B., de Givry S., Lobjois L., Schiex T., and Warners J. Radio link frequency assignment. Constraints 4 (1999) 79-89
17. Ithaca, NY, USA. Cicirello V.A., and Smith S.F. Amplification of search performance through randomization of heuristics. Proc. of CP'02. LNCS volume 2470 (2002) 124-138
18. Toronto, Canada. Cicirello V.A., and Smith S.F. Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. Proc. of CP'04. LNCS volume 3258 (2004) 197-211
19. Cohen D., Cooper M., Jeavons P., and Krokhin A. Soft constraints: complexity and multimorphsims. Proc. of CP'03. LNCS volume 2833 (2003) 244-258 Kinsale, Ireland
20. Toronto, Canada. Cohen D., Cooper M., and Jeavons P. A complete characterization of complexity for Boolean constraint optimization problems. Proc. of CP'04. LNCS volume 3258 (2004) 212-226
21. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research 22 (2004) 1-22
22. Cohen D., Cooper M., Jeavons P., and Krokhin A. Identifying efficiently solvable cases of Max CSP. Proc. of STACS'04. LNCS volume 2996 (2004) 152-163
23. Edinburgh, Scotland. Cohen D., Jeavons P., and Gyssens M. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. Proc. of IJCAI'05 (2005) 72-77
24. Cooper M. Cyclic consistency: a local reduction operation for binary valued constraints. Artificial Intelligence 155 1-2 (2004) 69-92
25. Cooper M. High-order consistency in Valued Constraint Satisfaction. Constraints 10 (2005) 283-305
26. (see arXiv.org/abs/cs.AI/0111038). Cooper M., and Schiex T. Arc consistency for soft constraints. Artificial Intelligence 154 1-2 (2004) 199-227
27. Cooper M.C. Reduction operations in fuzzy or valued constraint satisfaction. Fuzzy Sets and Systems 134 3 (2003) 311-342
28. Creignou N., Khanna S., and S.M. Complexity Classications of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications Volume 7 (2001)
29. Darwiche A. Recursive Conditioning. Artificial Intelligence 126 1-2 (2001) 5-41
30. http://www.carlit.toulouse.inra.fr/cgi/bin/awki.cgi/SoftCSP
31. Kinsale, Ireland. de Givry S., Larrosa J., Meseguer P., and Schiex T. Solving Max-Sat as weighted CSP. Proc. of CP'03. LNCS volume 2833 (2003) 363-376
32. Edinburgh, Scotland. de Givry S., Heras F., Larrosa J., and Zytnicki M. Existential arc consistency: getting closer to full arc consistency in weighted CSPs. Proc. of IJCAI'05 (2005) 84-89
33. de Givry S., Palhiere I., Vitezica Z., and Schiex T. Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques. Proc. of ICLP'05 Workshop on Constraint Based Methods for Bioinformatics. Sitges, Spain (2005)
34. Dechter R. Constraint Processing (2003), Morgan Kaufmann
35. Dechter R. Mini-buckets: A general scheme for generating approximations in automated reasoning. Proc. of IJCAI'97 (1997) 1297-1303 Nagoya, Japan
36. Dechter R. Bucket elimination: A unifying framework for reasoning. Artificial Intelligence 113 1-2 (1999) 41-85
37. Dechter R., and Pearl J. Tree clustering for constraint networks. Artificial Intelligence 38 (1989) 353-366
38. Dechter R., and Pearl J. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence 34 (1988) 1-38
39. Paphos, Cyprus. Dechter R., Kask K., and Larrosa J. A general scheme for multiple lower bound computation in constraint optimization. Proc. of CP'01. LNCS volume 2239 (2001) 346-360
40. Toulouse, France. Domshlak C., and Brafman R. CP-nets - Reasoning and Consistency Testing. Proc. of KR'02 (2002) 121-132
41. Acapulco, Mexico. Domshlak C., Rossi F., Venable B., and Walsh T. Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. Proc. of IJCAI'03 (2003) 215-220
42. Dubois D., and Prade H. Fuzzy sets and systems: theory and applications (1980), Academic Press
43. Dubois D., Fargier H., and Prade H. Using fuzzy constraints in job-shop scheduling. Proc. of IJCAI'93/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control. Chambery, France (1993)
44. Evans K., Konikoff M., Mathis R., Maden J., and Whipple G. Totally ordered commutative monoids. Semigroup Forum 62 2 (2001) 249-278
45. Fargier H. Problèmes de satisfaction de contraintes flexibles et application à l'ordonnancement de production. Thèse de doctoral, Institut de Recherche en Informatique de Toulouse (Université Paul Sabatier), Toulouse, France (1994)
46. Granada, Spain. Fargier H., and Lang J. Uncertainty in constraint satisfaction problems: a probabilistic approach. Proc. of ECSQARU'93. LNCS volume 747 (1993) 97-104
47. st European Congress on Fuzzy and Intelligent Technologies (1993)
48. Freuder E., and Wallace R. Partial constraint satisfaction. Artificial Intelligence 58 (1992) 21-70
49. Detroit, MI, USA. Freuder E.C. Partial constraint satisfaction. Proc. of IJCAI'89 (1989) 278-283
50. Los Angeles, CA, USA. Freuder E.C., and Quinn M.J. Taking advantage of stable sets of variables in constraint satisfaction problems. Proc. of IJCAI'85 (1985) 1076-1078
51. Schloss Hagenberg, Austria. Galinier P., and Hao J.-K. Tabu search for maximal constraint satisfaction problems. Proc. of CP'97. LNCS volume 1330 (1997) 196-208
52. Gaspin C. RNA Secondary Structure Determination and Representation Based on Constraints Satisfaction. Constraints 6 2-3 (2001) 201-221
53. Gaspin C., de Givry S., Schiex T., Thébault P., and Zytnicki M. A new local consistency for weighted CSP applied to ncRNA detection. Proc. of ICLP'05 Workshop on Constraint Based Methods for Bioinformatics. Sitges, Spain (2005)
54. Gottlob G., Leone N., and Scarcello F. A comparison of strutural CSP decomposition methods. Artificial Intelligence 124 (2000) 243-282
55. Edinburgh, Scotland. Heras F., and Larrosa J. Resolution in Max-SAT and its relation to local consistency in weighted CSPs. Proc. of IJCAI'05 (2005) 193-198
56. Austin, TX, USA. Junker U. Preference-based search for scheduling. Proc. of AAAI'00 (2000) 904-909
57. Edmonton, Alberta, Canada. Junker U. Preference-based search and multi-criteria optimization. Proc. of AAAI'02 (2002) 34-40
58. San Jose, CA, USA. Junker U. Quickxplain: Preferred explanations and relaxations for over-constrained problems. Proc. of AAAI'04 (2004) 167-172
59. Kask K., and Dechter R. A general scheme for automatic generation of search heuristics from specification dependencies. Artificial Intelligence 129 1-2 (2001) 91-131
60. Washington, USA. Khatib L., Morris P., Morris R., and Rossi F. Temporal constraint reasoning with preferences. Proc. of IJCAI'01 (2001) 322-327
61. Klement E., Mesiar R., and Pap E. Triangular Norms (2000), Kluwer Academic Publishers
62. http://www.fap.zib.de
63. Available at www.zib.de/koster/thesis.html. Koster A.M. Frequency assignment: Models and Algorithms. PhD thesis, University of Maastricht, The Netherlands (1999)
64. Singapore. Larrosa J. Boosting search with variable elimination. Proc. of CP'00. LNCS volume 1894 (2000) 291-305
65. Edmonton, Alberta, Canada. Larrosa J. On arc and node consistency in weighted CSP. Proc. of AAAI'02 (2002) 48-53
66. http://www.math.unipd.it/~frossi/cp2000-soft/program.html. Larrosa J., and Dechter R. On the dual representation of non-binary semiring-based csps. Proc. of the CP'00 Workshop on Modelling and Solving Soft Constraints (2000)
67. Cambridge, MA, USA. Larrosa J., and Meseguer P. Exploiting the use of DAC in Max-CSP. Proc. of CP'96. LNCS volume 1118 (1996) 308-322
68. Alexandria, VI, USA. Larrosa J., and Meseguer P. Partition-based lower bound for Max-CSP. Proc. of CP'99. LNCS volume 1713 (1999) 303-315
69. Acapulco, Mexico. Larrosa J., and Schiex T. In the quest of the best form of local consistency for weighted CSP. Proc. of IJCAI'03 (2003) 239-244
70. Nov. Larrosa J., and Schiex T. Solving weighted CSP by maintaining arc consistency. Artificial Intelligence 159 1-2 (2004) 1-26
71. Larrosa J., Meseguer P., and Schiex T. Maintaining reversible DAC for Max-CSP. Artificial Intelligence 107 1 (1999) 149-163
72. Lyon, France. Larrosa J., Meseguer P., and Sánchez M. Pseudo-tree Search with Soft Constraints. Proc. of ECAI'02 (2002) 131-135
73. Larrosa J., Morancho E., and Niso D. On the practical applicability of bucket elimination: Still-life as a case study. Journal of Artificial Intelligence Research 23 (2005) 421-440
74. Lemaître M., and Verfaillie G. Daily management of an earth observation satellite: comparison of ILOG Solver with dedicated algorithms for valued constraint satisfaction problems. Proc. of the Third ILOG International Users Meeting. Paris, France (1997)
75. Lobjois L., Lemâitre M., and Verfaillie G. Large neighbourhood search using constraint satisfaction for greedy reconstruction. Proc. of ECAI'00 Workshop on Modelling and Solving Constraint Problems (2000)
76. Acapulco, Mexico. Loudni S., and Boizumault P. Solving Constraint Optimization Problems in Anytime Contexts. Proc. of IJCAI'03 (2003) 251-256
77. Marinescu R., and Dechter R. AND/OR Tree Search for Constraint Optimization. Proc. of CP'04 Workshop on Preferences and Soft Constraints (2004)
78. Edinburgh, Scotland. Marinescu R., and Dechter R. AND/OR Branch-and-Bound for Graphical Models. Proc. of IJCAI'05 (2005) 224-229
79. Paphos, Cyprus. Meseguer P., and Sanchez M. Specializing russian doll search. Proc. of CP'01. LNCS volume 2239 (2001) 464-478
80. Paphos, Cyprus. Meseguer P., Larrosa J., and Sanchez M. Lower bounds for non-binary constraint optimization problems. Proc. of CP'01. LNCS volume 2239 (2001) 317-331
81. Ithaca, NY, USA. Meseguer P., Sánchez M., and Verfaillie G. Opportunistic Specialization in Russian Doll Search. Proc. of CP'02. LNCS volume 2470 (2002) 264-279
82. Moretti M., Rossi F., Freuder E., Likitvivatanavong C., and Wallace R. Explanations and optimization in preference-based configurators. Proc. of the Joint Workshop of the ERCIM Working Group on Constraints and the CologNet area on Constraint and Logic Programming on Constraint Solving and Constraint Logic Programming (2002)
83. O'Connell J., and Weeks D. PedCheck: a program for identification of genotype incompatibilities in linkage analysis. Am. J. Hum. Genet. 63 1 (1998) 259-266
84. O'Connell J., and Weeks D. An optimal algorithm for automatic genotype elimination. Am. J. Hum. Genet. 65 6 (1999) 1733-1740
85. Papadimitriou C.M. Computational Complexity (1994), Addison-Wesley Publishing Company
86. Pearl J. Encyclopedia of Artificial Intelligence, chapter Bayesian Inference Methods (1992), John Wiley & Sons 89-98
87. Vancouver, Canada. Petit T., Régin J.-C., and Bessière C. Meta-constraints on violations for over constrained problems. Proc. of IEEE-ICTAI'00 (2000) 358-365
88. Paphos, Cyprus. Petit T., Régin J.-C., and Bessière C. Specific filtering algorithms for over-constrained problems. Proc. of CP'01. LNCS volume 2239 (2001) 451-463
89. Ithaca, NY, USA. Petit T., Régin J.-C., and Bessière C. Range-based Algorithm for Max-CSP. Proc. of CP'02. LNCS volume 2470 (2002) 280-294
90. Paphos, Cyprus. Régin J.-C., Petit T., Bessière C., and Puget J.-F. New lower bounds of constraint violations for over-constrained problems. Proc. of CP'01. LNCS volume 2239 (2001) 332-345
91. Robinson J.A. A machine-oriented logic based on the resolution principle. Journal of the ACM 12 1 (1965) 23-41
92. Rosenfeld A., Hummel R., and Zucker S. Scene labeling by relaxation operations. IEEE Trans. on Systems, Man, and Cybernetics 6 6 (1976) 173-184
93. Rossi F., and Sperduti A. Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems. Constraints 9 4 (2004) 311-332
94. Gent, Belgium. Rudovà H., and Murray K. University course timetabling with soft constraints. Proc. of PATAT'02 (2002) 73-89
95. Orlando, Florida. Ruttkay Z. Fuzzy constraint satisfaction. Proc. FUZZ-IEEE'94 (1994) 1263-1268
96. Sanchez M., Meseguer P., and Larrosa J. Using Constraints with Memory to Implement Variable Elimination. Proc. of ECAI'04 (2004) 216-220
97. Sitges, Spain. Sanchez M., Larrosa J., and Meseguer P. Tree Decomposition with Function Filtering. Proc. of CP'05 volume 3709 (2005) 593-606
98. Singapore. Schiex T. Arc consistency for soft constraints. Proc. of CP'00. LNCS volume 1894 (2000) 411-424
99. Stanford, CA, USA. Schiex T. Possibilistic constraint satisfaction problems or "How to handle soft constraints?". Proc. of UAI'92 (1992) 268-275
100. Montréal, Canada. Schiex T., Fargier H., and Verfaillie G. Valued constraint satisfaction problems: hard and easy problems. Proc. of IJCAI'95 (1995) 631-637
101. Shapiro L., and Haralick R. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 3 (1981) 504-519
102. Shenoy P. Valuation-based systems for discrete optimization. In: Bonissone H., Kanal, and Lemmer (Eds). Uncertainty in AI (1991), North-Holland Publishers
103. Valencia, Spain. Slaney J., Binas A., and Price D. Guiding a Theorem Prover with Soft Constraints. Proc. of ECAI'04 (2004) 221-225
104. Snow P., and Freuder E. Improved relaxation and search methods for approximate constraint satisfaction with a maximin criterion. Proc. of the Conf. of Canadian Society for Comput. Studies of Intelligence (1990) 227-230
105. Kinsale, Ireland. Terrioux C., and Jégou P. Bounded backtracking for the valued constraint satisfaction problems. Proc. of CP'03. LNCS volume 2833 (2003) 709-723
106. Toronto, Canada. van Hoeve W.J. A Hyper-Arc Consistency Algorithm for the soft AllDifferent Constraint. Proc. of CP'04. LNCS volume 3258 (2004) 679-689
107. van Hoeve W.J., Pesant G., and Rousseau L.-M. On Global Warming (Softening Global Constraints). Proc. of CP'04 Workshop on Preferences and Soft Constraints. Toronto, Canada (2004)
108. Váncza J., and Márkus A. Solving Conditional and Conflicting Constraints in Manufacturing Process Planning. Proc. of CPAIOR'01 Workshop (2001)
109. Portland, OR, USA. Verfaillie G., Lemaître M., and Schiex T. Russian doll search. Proc. of AAAI'96 (1996) 181-187
110. Wallace R.J. Directed arc consistency preprocessing. In: Meyer M. (Ed). Selected papers from the ECAI'94 Workshop on Constraint Processing. LNCS volume 923 (1995), Springer 121-137
111. (see www.dimi.uniud.it/dovier/WCB05). Will S., Busch A., and Backofen R. Efficient Constraint-based Sequence Alignment by Cluster Tree Elimination. Proc. of ICLP'05 Workshop on Constraint based Methods for Bioinformatics. Sitges, Spain (2005)
112. Wilson M., and Borning A. Hierarchical constraint logic programming. J. Log. Program. 16 3 (1993) 277-318