The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2016

The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable

Abstract

Given a fixed constraint language Γ , the conservative CSP over Γ (denoted by c-CSP(Γ)) is a variant of CSP(Γ) where the domain of each variable can be restricted arbitrarily. In [5] a dichotomy has been proven for conservative CSP: for every fixed language Γ , c-CSP(Γ) is either in P or NP-complete. However, the characterization of conservatively tractable languages is of algebraic nature and the recognition algorithm provided in [5] is super-exponential in the domain size. The main contribution of this paper is a polynomial-time algorithm that, given a constraint language Γ as input, decides if c-CSP(Γ) is tractable. In addition, if Γ is proven tractable the algorithm also outputs its coloured graph, which contains valuable information on the structure of Γ .
Fichier principal
Vignette du fichier
dicho.pdf (322.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01413124 , version 1 (09-12-2016)

Identifiers

Cite

Clément Carbonnel. The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable. 22nd International Conference on Principles and Practice of Constraint Programming (CP'16), Sep 2016, Toulouse, France. pp.130 - 146, ⟨10.1007/978-3-319-44953-1_9⟩. ⟨hal-01413124⟩
130 View
98 Download

Altmetric

Share

Gmail Facebook X LinkedIn More