The complexity of general-valued CSPs seen from the other side

10/09/2017
by   Clement Carbonnel, et al.
0

General-valued constraint satisfaction problems (VCSPs) are generalisations of CSPs dealing with homomorphisms between two valued structures. We study the complexity of structural restrictions for VCSPs, that is, restrictions defined by classes of admissible left-hand side valued structures. As our main result, we show that for VCSPs of bounded arity the only tractable structural restrictions are those of bounded treewidth modulo valued equivalence, thus identifying the precise borderline of tractability. Our result generalises a result of Dalmau, Kolaitis, and Vardi [CP'02] and Grohe [JACM'07] showing that for CSPs of bounded arity the tractable restrictions are precisely those with bounded treewidth modulo homomorphic equivalence. All the tractable restrictions we identify are solved by the well-known Sherali-Adams LP hierarchy. We take a closer look into this hierarchy and study the power of Sherali-Adams for solving VCSPs. Our second result is a precise characterisation of the left-hand side valued structures solved to optimality by the k-th level of the Sherali-Adams LP hierarchy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2012

Phase Transition of Tractability in Constraint Satisfaction and Bayesian Network Inference

There has been great interest in identifying tractable subclasses of NP ...
research
06/13/2012

Complexity of Inference in Graphical Models

It is well-known that inference in graphical models is hard in the worst...
research
08/25/2017

Non-FPT lower bounds for structural restrictions of decision DNNF

We give a non-FPT lower bound on the size of structured decision DNNF an...
research
12/23/2020

PTAS for Sparse General-Valued CSPs

We study polynomial-time approximation schemes (PTASes) for constraint s...
research
05/06/2022

A Logic-based Tractable Approximation of Probability

We provide a logical framework in which a resource-bounded agent can be ...
research
06/10/2021

Valued Authorization Policy Existence Problem: Theory and Experiments

Recent work has shown that many problems of satisfiability and resilienc...
research
09/12/2023

CDL: A fast and flexible library for the study of permutation sets with structural restrictions

In this paper, we introduce CDL, a software library designed for the ana...

Please sign up or login with your details

Forgot password? Click here to reset