The Meta-Problem for Conservative Mal'tsev Constraints - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2016

The Meta-Problem for Conservative Mal'tsev Constraints

Abstract

In the algebraic approach to CSP (Constraint Satisfaction Problem), the complexity of constraint languages is studied using closure operations called poly-morphisms. Many of these operations are known to induce tractability of any language they preserve. We focus on the meta-problem: given a language Γ, decide if Γ has a polymorphism with nice properties. We design an algorithm that decides in polynomial-time if a constraint language has a conservative Mal'tsev poly-morphism, and outputs one if one exists. As a corollary we obtain that the class of conservative Mal'tsev constraints is uniformly tractable, and we conjecture that this result remains true in the non-conservative case.
Fichier principal
Vignette du fichier
conspoly_preprint.pdf (282.68 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01230681 , version 1 (18-11-2015)

Identifiers

  • HAL Id : hal-01230681 , version 1

Cite

Clément Carbonnel. The Meta-Problem for Conservative Mal'tsev Constraints. Thirtieth AAAI Conference on Artificial Intelligence (AAAI-16), Feb 2016, Phoenix, Arizona, United States. ⟨hal-01230681⟩
136 View
78 Download

Share

Gmail Mastodon Facebook X LinkedIn More