DeepAI AI Chat
Log In Sign Up

Tractable Combinations of Theories via Sampling

by   Manuel Bodirsky, et al.
TU Dresden

For a first-order theory T, the Constraint Satisfaction Problem of T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. In this article we develop sufficient conditions for polynomial-time tractability of the constraint satisfaction problem for the union of two theories with disjoint relational signatures. To this end, we introduce the concept of sampling for theories and show that samplings can be applied to examples which are not covered by the seminal result of Nelson and Oppen.


page 1

page 2

page 3

page 4


Complexity of Combinations of Qualitative Constraint Satisfaction Problems

The CSP of a first-order theory T is the problem of deciding for a given...

Tractable Combinations of Temporal CSPs

The constraint satisfaction problem (CSP) of a first-order theory T is t...

On amenability of constraint satisfaction problems

Recent results show that a constraint satisfaction problem (CSP) defined...

Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems

A temporal (constraint) language is a relational structure with a first-...

Tractability of Theory Patching

In this paper we consider the problem of `theory patching', in which we ...

Short definitions in constraint languages

A first-order formula is called primitive positive (pp) if it only admit...

M-best solutions for a class of fuzzy constraint satisfaction problems

The article considers one of the possible generalizations of constraint ...