The Meta-Problem for Conservative Mal'tsev Constraints
THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, pp. 3376-3382, 2016.
In the algebraic approach to CSP (Constraint Satisfaction Problem), the complexity of constraint languages is studied using closure operations called polymorphisms. Many of these operations are known to induce tractability of any language they preserve. We focus on the meta-problem: given a language Gamma, decide if Gamma has a polymorphi...More
PPT (Upload PPT)