Holant clones and the approximability of conservative holant problems

11/02/2018
by   Miriam Backens, et al.
0

We construct a theory of holant clones to capture the notion of expressibility in the holant framework. Their role is analogous to the role played by functional clones in the study of weighted counting Constraint Satisfaction Problems. We explore the landscape of conservative holant clones and determine the situations in which a set F of functions is "universal in the conservative case", which means that all functions are contained in the holant clone generated by F together with all unary functions. When F is not universal in the conservative case, we give concise generating sets for the clone. We demonstrate the usefulness of the holant clone theory by using it to give a complete complexity-theory classification for the problem of approximating the solution to conservative holant problems. We show that approximation is intractable exactly when F is universal in the conservative case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2020

Network satisfaction for symmetric relation algebras with a flexible atom

Robin Hirsch posed in 1996 the Really Big Complexity Problem: classify t...
research
12/19/2013

Conservative, Proportional and Optimistic Contextual Discounting in the Belief Functions Theory

Information discounting plays an important role in the theory of belief ...
research
02/11/2022

Conservative Extensions for Existential Rules

We study the problem to decide, given sets T1,T2 of tuple-generating dep...
research
04/13/2018

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

We analyse the complexity of approximate counting constraint satisfactio...
research
11/19/2020

Conservative Extensions in Horn Description Logics with Inverse Roles

We investigate the decidability and computational complexity of conserva...
research
12/14/2019

Formal Definitions of Conservative PDFs

Under ideal conditions, the probability density function (PDF) of a rand...
research
04/04/2019

Complexity of Counting Weighted Eulerian Orientations with ARS

Unique prime factorization of integers is taught in every high school. W...

Please sign up or login with your details

Forgot password? Click here to reset