Asking the metaquestions in constraint tractability

04/04/2016
by   Hubie Chen, et al.
0

The constraint satisfaction problem (CSP) involves deciding, given a set of variables and a set of constraints on the variables, whether or not there is an assignment to the variables satisfying all of the constraints. One formulation of the CSP is as the problem of deciding, given a pair (G,H) of relational structures, whether or not there is a homomorphism from the first structure to the second structure. The CSP is in general NP-hard; a common way to restrict this problem is to fix the second structure H, so that each structure H gives rise to a problem CSP(H). The problem family CSP(H) has been studied using an algebraic approach, which links the algorithmic and complexity properties of each problem CSP(H) to a set of operations, the so-called polymorphisms of H. Certain types of polymorphisms are known to imply the polynomial-time tractability of CSP(H), and others are conjectured to do so. This article systematically studies---for various classes of polymorphisms---the computational complexity of deciding whether or not a given structure H admits a polymorphism from the class. Among other results, we prove the NP-completeness of deciding a condition conjectured to characterize the tractable problems CSP(H), as well as the NP-completeness of deciding if CSP(H) has bounded width.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2020

No-Rainbow Problem is NP-Hard

Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
research
05/19/2014

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a relational structure B is...
research
01/23/2014

Tractable Triangles and Cross-Free Convexity in Discrete Optimisation

The minimisation problem of a sum of unary and pairwise functions of dis...
research
06/30/2011

A Maximal Tractable Class of Soft Constraints

Many researchers in artificial intelligence are beginning to explore the...
research
06/04/2021

On Classifying Continuous Constraint Satisfaction problems

A continuous constraint satisfaction problem (CCSP) is a constraint sati...
research
01/18/2018

Complexity of Combinations of Qualitative Constraint Satisfaction Problems

The CSP of a first-order theory T is the problem of deciding for a given...
research
05/22/2020

Algebraic Global Gadgetry for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a finite relational structu...

Please sign up or login with your details

Forgot password? Click here to reset