Valued Constraint Satisfaction
Valued Constraint Satisfaction is a formal framework within constraint programming that extends the classical constraint satisfaction problem by associating a cost or preference value with constraint violations, enabling the optimization of solutions based on a valuation structure over assignments.
25
Publications
831
Citations
32
Authors
31
Institutions
Publications per year
2017–2026
2
Parents
25
The Power of Linear Programming for Valued CSPs
Johan Thapper, Stanislav Živný · 2012 · 77 citations · Full text
Reduction operations in fuzzy or valued constraint satisfaction
Martin Cooper · Fuzzy Sets and Systems · 2003 · 63 citations
Computing, Mathematics, Algorithms +12
The complexity of conservative valued CSPs
Vladimir Kolmogorov, Stanislav Živný · Journal of the ACM · 2013 · 52 citations · Full text
1–5 of 25
32
9
h-index
4
h-index
4
h-index
4
h-index
Microsoft Research (United Kingdom), United Kingdom
3 publications · 148 citations
3
h-index
1–5 of 32
31
University of Oxford
Oxford, United Kingdom
5 h-index
5 publications
247 citations
Institut de Recherche en Informatique de Toulouse
Toulouse, France
4 h-index
4 publications
163 citations

Université Toulouse III - Paul Sabatier
Toulouse, France
4 h-index
4 publications
163 citations

University of Warwick
Coventry, United Kingdom
4 h-index
4 publications
193 citations
Institute of Science and Technology Austria
Klosterneuburg, Austria
3 h-index
4 publications
166 citations

Université Fédérale de Toulouse Midi-Pyrénées
Toulouse, France
2 h-index
2 publications
107 citations
École Polytechnique
Palaiseau, France
2 h-index
2 publications
96 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
2 h-index
2 publications
96 citations
1–8 of 31
3 publications · 149 citations
3
h-index
Repository · 1 publications · 27 citations
1
h-index
1 publications · 19 citations
1
h-index
Repository · 1 publications · 63 citations
1
h-index
Repository · 1 publications · 30 citations
1
h-index
1–5