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

Authors

32

  1. SŽ
    Stanislav Živný

    University of Oxford, United Kingdom

    9 publications · 387 citations

    9

    h-index

  2. AK
    Andrei Krokhin

    Durham University, United Kingdom

    4 publications · 91 citations

    4

    h-index

  3. MC
    Martin Cooper

    Université Toulouse III - Paul Sabatier, France

    4 publications · 163 citations

    4

    h-index

  4. JT
    Johan Thapper

    Université Gustave Eiffel, France

    4 publications · 242 citations

    4

    h-index

  5. VK
    Vladimir Kolmogorov

    Microsoft Research (United Kingdom), United Kingdom

    3 publications · 148 citations

    3

    h-index

1–5 of 32

Venues

  1. SIAM Journal on Computing

    3 publications · 149 citations

    3

    h-index

  2. Durham Research Online (Durham University)

    Repository · 1 publications · 27 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 19 citations

    1

    h-index

  4. 1

    h-index

  5. KTH Publication Database DiVA (KTH Royal Institute of Technology)

    Repository · 1 publications · 30 citations

    1

    h-index

1–5