{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T08:59:03Z","timestamp":1776329943605,"version":"3.50.1"},"reference-count":110,"publisher":"Elsevier","isbn-type":[{"value":"9780444527264","type":"print"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80013-1","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"281-328","source":"Crossref","is-referenced-by-count":74,"title":["Soft Constraints"],"prefix":"10.1016","member":"78","reference":[{"issue":"1","key":"10.1016\/S1574-6526(06)80013-1_bib1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF02944784","article-title":"The complexity of checking consistency of pedigree information and related problems","volume":"19","author":"Aceto","year":"2004","journal-title":"J. Comput. Sci. Technol."},{"key":"10.1016\/S1574-6526(06)80013-1_bib2","series-title":"Principles of Constraint Programming","author":"Apt","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability \u2014 a survey","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S1574-6526(06)80013-1_bib4","series-title":"Proc. of CP'98","first-page":"87","article-title":"Global constraints for partial CSPs: a case-study of resource and due date constraints","volume":"volume 1520","author":"Baptiste","year":"1998"},{"key":"10.1016\/S1574-6526(06)80013-1_bib5","series-title":"Proc. of CPAIOR'04","first-page":"80","article-title":"Cost Evaluation of Soft Global Constraints","volume":"volume 3011","author":"Beldiceanu","year":"2004"},{"issue":"3","key":"10.1016\/S1574-6526(06)80013-1_bib6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1026488509554","article-title":"Earth observation satellite management","volume":"4","author":"Bensana","year":"1999","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80013-1_bib7","series-title":"Nonserial Dynamic Programming","author":"Bertel\u00e9","year":"1972"},{"key":"10.1016\/S1574-6526(06)80013-1_bib8","series-title":"Proc. of IJCAI'03","first-page":"191","article-title":"Propagate the right thing: How preferences can speed-up constraint solving","author":"Bessi\u00e8re","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib9","series-title":"Proc. of IJCAI'95","first-page":"624","article-title":"Constraint solving over semirings","author":"Bistarelli","year":"1995"},{"issue":"2","key":"10.1016\/S1574-6526(06)80013-1_bib10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/256303.256306","article-title":"Semiring based constraint solving and optimization","volume":"44","author":"Bistarelli","year":"1997","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1574-6526(06)80013-1_bib11","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1026441215081","article-title":"Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison","volume":"4","author":"Bistarelli","year":"1999","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80013-1_bib12","series-title":"Proc. of PADL'00","first-page":"230","article-title":"Labeling and partial local consistency for soft constraint programming","volume":"volume 1753","author":"Bistarelli","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib13","series-title":"Proc. of ICLP'89","first-page":"149","article-title":"Constraint hierarchies and logic programming","author":"Borning","year":"1989"},{"key":"10.1016\/S1574-6526(06)80013-1_bib14","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","article-title":"CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements","volume":"21","author":"Boutilier","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1574-6526(06)80013-1_bib15","series-title":"Proc. of AAAI'96","first-page":"271","article-title":"Heuristic-biased stochastic sampling","author":"Bresina","year":"1996"},{"key":"10.1016\/S1574-6526(06)80013-1_bib16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1009812409930","article-title":"Radio link frequency assignment","volume":"4","author":"Cabon","year":"1999","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80013-1_bib17","series-title":"Proc. of CP'02","first-page":"124","article-title":"Amplification of search performance through randomization of heuristics","volume":"volume 2470","author":"Cicirello","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib18","series-title":"Proc. of CP'04","first-page":"197","article-title":"Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory","volume":"volume 3258","author":"Cicirello","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib19","series-title":"Proc. of CP'03","first-page":"244","article-title":"Soft constraints: complexity and multimorphsims","volume":"volume 2833","author":"Cohen","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib20","series-title":"Proc. of CP'04","first-page":"212","article-title":"A complete characterization of complexity for Boolean constraint optimization problems","volume":"volume 3258","author":"Cohen","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1400","article-title":"A maximal tractable class of soft constraints","volume":"22","author":"Cohen","year":"2004","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1574-6526(06)80013-1_bib22","series-title":"Proc. of STACS'04","first-page":"152","article-title":"Identifying efficiently solvable cases of Max CSP","volume":"volume 2996","author":"Cohen","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib23","series-title":"Proc. of IJCAI'05","first-page":"72","article-title":"A unified theory of structural tractability for constraint satisfaction and spread cut decomposition","author":"Cohen","year":"2005"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.artint.2003.06.004","article-title":"Cyclic consistency: a local reduction operation for binary valued constraints","volume":"155","author":"Cooper","year":"2004","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib25","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10601-005-2240-3","article-title":"High-order consistency in Valued Constraint Satisfaction","volume":"10","author":"Cooper","year":"2005","journal-title":"Constraints"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.artint.2003.09.002","article-title":"Arc consistency for soft constraints","volume":"154","author":"Cooper","year":"2004","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S1574-6526(06)80013-1_bib27","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0165-0114(02)00134-3","article-title":"Reduction operations in fuzzy or valued constraint satisfaction","volume":"134","author":"Cooper","year":"2003","journal-title":"Fuzzy Sets and Systems"},{"key":"10.1016\/S1574-6526(06)80013-1_bib28","article-title":"Complexity Classications of Boolean Constraint Satisfaction Problems","volume":"Volume 7","author":"Creignou","year":"2001","journal-title":"SIAM Monographs on Discrete Mathematics and Applications"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib29","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(00)00069-2","article-title":"Recursive Conditioning","volume":"126","author":"Darwiche","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib31","series-title":"Proc. of CP'03","first-page":"363","article-title":"Solving Max-Sat as weighted CSP","volume":"volume 2833","author":"de Givry","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib32","series-title":"Proc. of IJCAI'05","first-page":"84","article-title":"Existential arc consistency: getting closer to full arc consistency in weighted CSPs","author":"de Givry","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib33","series-title":"Proc. of ICLP'05 Workshop on Constraint Based Methods for Bioinformatics","article-title":"Mendelian error detection in complex pedigree using weighted constraint satisfaction techniques","author":"de Givry","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib34","series-title":"Constraint Processing","author":"Dechter","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib35","series-title":"Proc. of IJCAI'97","first-page":"1297","article-title":"Mini-buckets: A general scheme for generating approximations in automated reasoning","author":"Dechter","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib36","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","article-title":"Bucket elimination: A unifying framework for reasoning","volume":"113","author":"Dechter","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib37","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib39","series-title":"Proc. of CP'01","first-page":"346","article-title":"A general scheme for multiple lower bound computation in constraint optimization","volume":"volume 2239","author":"Dechter","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib40","series-title":"Proc. of KR'02","first-page":"121","article-title":"CP-nets \u2014 Reasoning and Consistency Testing","author":"Domshlak","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib41","series-title":"Proc. of IJCAI'03","first-page":"215","article-title":"Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques","author":"Domshlak","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib42","series-title":"Fuzzy sets and systems: theory and applications","author":"Dubois","year":"1980"},{"key":"10.1016\/S1574-6526(06)80013-1_bib43","series-title":"Proc. of IJCAI'93\/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control","article-title":"Using fuzzy constraints in job-shop scheduling","author":"Dubois","year":"1993"},{"issue":"2","key":"10.1016\/S1574-6526(06)80013-1_bib44","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s002330010026","article-title":"Totally ordered commutative monoids","volume":"62","author":"Evans","year":"2001","journal-title":"Semigroup Forum"},{"key":"10.1016\/S1574-6526(06)80013-1_bib45","article-title":"Probl\u00e8mes de satisfaction de contraintes flexibles et application \u00e0 l'ordonnancement de production","author":"Fargier","year":"1994","journal-title":"Th\u00e8se de doctoral, Institut de Recherche en Informatique de Toulouse (Universit\u00e9 Paul Sabatier), Toulouse, France"},{"key":"10.1016\/S1574-6526(06)80013-1_bib46","series-title":"Proc. of ECSQARU'93","first-page":"97","article-title":"Uncertainty in constraint satisfaction problems: a probabilistic approach","volume":"volume 747","author":"Fargier","year":"1993"},{"key":"10.1016\/S1574-6526(06)80013-1_bib47","series-title":"Proc. of the 1st European Congress on Fuzzy and Intelligent Technologies","article-title":"Selecting preferred solutions in Fuzzy Constraint Satisfaction Problems","author":"Fargier","year":"1993"},{"key":"10.1016\/S1574-6526(06)80013-1_bib48","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0004-3702(92)90004-H","article-title":"Partial constraint satisfaction","volume":"58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib49","series-title":"Proc. of IJCAI'89","first-page":"278","article-title":"Partial constraint satisfaction","author":"Freuder","year":"1989"},{"key":"10.1016\/S1574-6526(06)80013-1_bib50","series-title":"Proc. of IJCAI'85","first-page":"1076","article-title":"Taking advantage of stable sets of variables in constraint satisfaction problems","author":"Freuder","year":"1985"},{"key":"10.1016\/S1574-6526(06)80013-1_bib51","series-title":"Proc. of CP'97","first-page":"196","article-title":"Tabu search for maximal constraint satisfaction problems","volume":"volume 1330","author":"Galinier","year":"1997"},{"issue":"2\u20133","key":"10.1016\/S1574-6526(06)80013-1_bib52","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1011433605905","article-title":"RNA Secondary Structure Determination and Representation Based on Constraints Satisfaction","volume":"6","author":"Gaspin","year":"2001","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80013-1_bib53","series-title":"Proc. of ICLP'05 Workshop on Constraint Based Methods for Bioinformatics","article-title":"A new local consistency for weighted CSP applied to ncRNA detection","author":"Gaspin","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib54","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0004-3702(00)00078-3","article-title":"A comparison of strutural CSP decomposition methods","volume":"124","author":"Gottlob","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib55","series-title":"Proc. of IJCAI'05","first-page":"193","article-title":"Resolution in Max-SAT and its relation to local consistency in weighted CSPs","author":"Heras","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib56","series-title":"Proc. of AAAI'00","first-page":"904","article-title":"Preference-based search for scheduling","author":"Junker","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib57","series-title":"Proc. of AAAI'02","first-page":"34","article-title":"Preference-based search and multi-criteria optimization","author":"Junker","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib58","series-title":"Proc. of AAAI'04","first-page":"167","article-title":"Quickxplain: Preferred explanations and relaxations for over-constrained problems","author":"Junker","year":"2004"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib59","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0004-3702(01)00107-2","article-title":"A general scheme for automatic generation of search heuristics from specification dependencies","volume":"129","author":"Kask","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib60","series-title":"Proc. of IJCAI'01","first-page":"322","article-title":"Temporal constraint reasoning with preferences","author":"Khatib","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib61","series-title":"Triangular Norms","author":"Klement","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib63","article-title":"Frequency assignment: Models and Algorithms","author":"Koster","year":"1999","journal-title":"PhD thesis, University of Maastricht, The Netherlands"},{"key":"10.1016\/S1574-6526(06)80013-1_bib64","series-title":"Proc. of CP'00","first-page":"291","article-title":"Boosting search with variable elimination","volume":"volume 1894","author":"Larrosa","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib65","series-title":"Proc. of AAAI'02","first-page":"48","article-title":"On arc and node consistency in weighted CSP","author":"Larrosa","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib66","series-title":"Proc. of the CP'00 Workshop on Modelling and Solving Soft Constraints","article-title":"On the dual representation of non-binary semiring-based csps","author":"Larrosa","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib67","series-title":"Proc. of CP'96","first-page":"308","article-title":"Exploiting the use of DAC in Max-CSP","volume":"volume 1118","author":"Larrosa","year":"1996"},{"key":"10.1016\/S1574-6526(06)80013-1_bib68","series-title":"Proc. of CP'99","first-page":"303","article-title":"Partition-based lower bound for Max-CSP","volume":"volume 1713","author":"Larrosa","year":"1999"},{"key":"10.1016\/S1574-6526(06)80013-1_bib69","series-title":"Proc. of IJCAI'03","first-page":"239","article-title":"In the quest of the best form of local consistency for weighted CSP","author":"Larrosa","year":"2003"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80013-1_bib70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.05.004","article-title":"Solving weighted CSP by maintaining arc consistency","volume":"159","author":"Larrosa","year":"2004","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80013-1_bib71","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0004-3702(98)00108-8","article-title":"Maintaining reversible DAC for Max-CSP","volume":"107","author":"Larrosa","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib72","series-title":"Proc. of ECAI'02","first-page":"131","article-title":"Pseudo-tree Search with Soft Constraints","author":"Larrosa","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib73","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.1541","article-title":"On the practical applicability of bucket elimination: Still-life as a case study","volume":"23","author":"Larrosa","year":"2005","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10.1016\/S1574-6526(06)80013-1_bib74","series-title":"Proc. of the Third ILOG International Users Meeting","article-title":"Daily management of an earth observation satellite: comparison of ILOG Solver with dedicated algorithms for valued constraint satisfaction problems","author":"Lema\u00eetre","year":"1997"},{"key":"10.1016\/S1574-6526(06)80013-1_bib75","series-title":"Proc. of ECAI'00 Workshop on Modelling and Solving Constraint Problems","article-title":"Large neighbourhood search using constraint satisfaction for greedy reconstruction","author":"Lobjois","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib76","series-title":"Proc. of IJCAI'03","first-page":"251","article-title":"Solving Constraint Optimization Problems in Anytime Contexts","author":"Loudni","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib77","series-title":"Proc. of CP'04 Workshop on Preferences and Soft Constraints","article-title":"AND\/OR Tree Search for Constraint Optimization","author":"Marinescu","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib78","series-title":"Proc. of IJCAI'05","first-page":"224","article-title":"AND\/OR Branch-and-Bound for Graphical Models","author":"Marinescu","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib79","series-title":"Proc. of CP'01","first-page":"464","article-title":"Specializing russian doll search","volume":"volume 2239","author":"Meseguer","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib80","series-title":"Proc. of CP'01","first-page":"317","article-title":"Lower bounds for non-binary constraint optimization problems","volume":"volume 2239","author":"Meseguer","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib81","series-title":"Proc. of CP'02","first-page":"264","article-title":"Opportunistic Specialization in Russian Doll Search","volume":"volume 2470","author":"Meseguer","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib82","series-title":"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","article-title":"Explanations and optimization in preference-based configurators","author":"Moretti","year":"2002"},{"issue":"1","key":"10.1016\/S1574-6526(06)80013-1_bib83","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1086\/301904","article-title":"PedCheck: a program for identification of genotype incompatibilities in linkage analysis","volume":"63","author":"O'Connell","year":"1998","journal-title":"Am. J. Hum. Genet."},{"issue":"6","key":"10.1016\/S1574-6526(06)80013-1_bib84","doi-asserted-by":"crossref","first-page":"1733","DOI":"10.1086\/302663","article-title":"An optimal algorithm for automatic genotype elimination","volume":"65","author":"O'Connell","year":"1999","journal-title":"Am. J. Hum. Genet."},{"key":"10.1016\/S1574-6526(06)80013-1_bib85","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S1574-6526(06)80013-1_bib86","first-page":"89","article-title":"Encyclopedia of Artificial Intelligence, chapter Bayesian Inference Methods","author":"Pearl","year":"1992"},{"key":"10.1016\/S1574-6526(06)80013-1_bib87","series-title":"Proc. of IEEE-ICTAI'00","first-page":"358","article-title":"Meta-constraints on violations for over constrained problems","author":"Petit","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib88","series-title":"Proc. of CP'01","first-page":"451","article-title":"Specific filtering algorithms for over-constrained problems","volume":"volume 2239","author":"Petit","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib89","series-title":"Proc. of CP'02","first-page":"280","article-title":"Range-based Algorithm for Max-CSP","volume":"volume 2470","author":"Petit","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib90","series-title":"Proc. of CP'01","first-page":"332","article-title":"New lower bounds of constraint violations for over-constrained problems","volume":"volume 2239","author":"R\u00e9gin","year":"2001"},{"issue":"1","key":"10.1016\/S1574-6526(06)80013-1_bib91","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"Journal of the ACM"},{"issue":"6","key":"10.1016\/S1574-6526(06)80013-1_bib92","first-page":"173","article-title":"Scene labeling by relaxation operations","volume":"6","author":"Rosenfeld","year":"1976","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"4","key":"10.1016\/S1574-6526(06)80013-1_bib93","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1023\/B:CONS.0000049206.43218.5f","article-title":"Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems","volume":"9","author":"Rossi","year":"2004","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80013-1_bib94","series-title":"Proc. of PATAT'02","first-page":"73","article-title":"University course timetabling with soft constraints","author":"Rudov\u00e0","year":"2002"},{"key":"10.1016\/S1574-6526(06)80013-1_bib95","series-title":"Proc. FUZZ-IEEE'94","first-page":"1263","article-title":"Fuzzy constraint satisfaction","author":"Ruttkay","year":"1994"},{"key":"10.1016\/S1574-6526(06)80013-1_bib96","series-title":"Proc. of ECAI'04","first-page":"216","article-title":"Using Constraints with Memory to Implement Variable Elimination","author":"Sanchez","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib97","first-page":"593","article-title":"Tree Decomposition with Function Filtering","volume":"volume 3709","author":"Sanchez","year":"2005"},{"key":"10.1016\/S1574-6526(06)80013-1_bib98","series-title":"Proc. of CP'00","first-page":"411","article-title":"Arc consistency for soft constraints","volume":"volume 1894","author":"Schiex","year":"2000"},{"key":"10.1016\/S1574-6526(06)80013-1_bib99","series-title":"Proc. of UAI'92","first-page":"268","article-title":"Possibilistic constraint satisfaction problems or \u201cHow to handle soft constraints?\u201d","author":"Schiex","year":"1992"},{"key":"10.1016\/S1574-6526(06)80013-1_bib100","series-title":"Proc. of IJCAI'95","first-page":"631","article-title":"Valued constraint satisfaction problems: hard and easy problems","author":"Schiex","year":"1995"},{"key":"10.1016\/S1574-6526(06)80013-1_bib101","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"3","author":"Shapiro","year":"1981","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S1574-6526(06)80013-1_bib102","series-title":"Uncertainty in AI","article-title":"Valuation-based systems for discrete optimization","author":"Shenoy","year":"1991"},{"key":"10.1016\/S1574-6526(06)80013-1_bib103","series-title":"Proc. of ECAI'04","first-page":"221","article-title":"Guiding a Theorem Prover with Soft Constraints","author":"Slaney","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib104","series-title":"Proc. of the Conf. of Canadian Society for Comput. Studies of Intelligence","first-page":"227","article-title":"Improved relaxation and search methods for approximate constraint satisfaction with a maximin criterion","author":"Snow","year":"1990"},{"key":"10.1016\/S1574-6526(06)80013-1_bib105","series-title":"Proc. of CP'03","first-page":"709","article-title":"Bounded backtracking for the valued constraint satisfaction problems","volume":"volume 2833","author":"Terrioux","year":"2003"},{"key":"10.1016\/S1574-6526(06)80013-1_bib106","series-title":"Proc. of CP'04","first-page":"679","article-title":"A Hyper-Arc Consistency Algorithm for the soft AllDifferent Constraint","volume":"volume 3258","author":"van Hoeve","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib107","series-title":"Proc. of CP'04 Workshop on Preferences and Soft Constraints","article-title":"On Global Warming (Softening Global Constraints)","author":"van Hoeve","year":"2004"},{"key":"10.1016\/S1574-6526(06)80013-1_bib108","series-title":"Proc. of CPAIOR'01 Workshop","article-title":"Solving Conditional and Conflicting Constraints in Manufacturing Process Planning","author":"V\u00e1ncza","year":"2001"},{"key":"10.1016\/S1574-6526(06)80013-1_bib109","series-title":"Proc. of AAAI'96","first-page":"181","article-title":"Russian doll search","author":"Verfaillie","year":"1996"},{"key":"10.1016\/S1574-6526(06)80013-1_bib110","series-title":"Selected papers from the ECAI'94 Workshop on Constraint Processing","first-page":"121","article-title":"Directed arc consistency preprocessing","volume":"volume 923","author":"Wallace","year":"1995"},{"key":"10.1016\/S1574-6526(06)80013-1_bib111","series-title":"Proc. of ICLP'05 Workshop on Constraint based Methods for Bioinformatics","article-title":"Efficient Constraint-based Sequence Alignment by Cluster Tree Elimination","author":"Will","year":"2005"},{"issue":"3","key":"10.1016\/S1574-6526(06)80013-1_bib112","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0743-1066(93)90046-J","article-title":"Hierarchical constraint logic programming","volume":"16","author":"Wilson","year":"1993","journal-title":"J. Log. Program."}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800131?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800131?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:52:24Z","timestamp":1761619944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800131"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":110,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80013-1","relation":{},"ISSN":["1574-6526"],"issn-type":[{"value":"1574-6526","type":"print"}],"subject":[],"published":{"date-parts":[[2006]]}}}