The Complexity of Valued Constraint Satisfaction Problems in a Nutshell - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

The Complexity of Valued Constraint Satisfaction Problems in a Nutshell

Abstract

The valued constraint satisfaction problem was introduced by Schiex et al. [23] as a unifying framework for studying constraint programming with soft constraints. A systematic worst-case complexity theoretical investigation of this problem was initiated by Cohen et al. [4], building on ideas from the successful classi cation programme for the ordinary constraint satisfaction problem. In addition to the decision problem for constraint satisfaction, this framework also captures problems as varied as Max CSP and integer programming with bounded domains. This paper is intended to give a quick introduction to the questions, the main results, and the current state of the complexity classi cation of valued constraint satisfaction problems. Two special cases are looked at in some detail : the classi cation for the Boolean domain and the less well-understood case of Max CSP. Some recent results for general constraint languages are also reviewed, as well as the connection to the very active study of approximation algorithms for Max CSP.
Fichier principal
Vignette du fichier
paper_22.pdf (112.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00830467 , version 1 (05-06-2013)

Identifiers

  • HAL Id : hal-00830467 , version 1

Cite

Johan Thapper. The Complexity of Valued Constraint Satisfaction Problems in a Nutshell. Huitièmes Journées Francophones de Programmation par Contraintes - JFPC 2012, May 2012, Toulouse, France. ⟨hal-00830467⟩
79 View
300 Download

Share

Gmail Facebook Twitter LinkedIn More