DeepAI AI Chat
Log In Sign Up

Tractable Combinations of Temporal CSPs

by   Manuel Bodirsky, et al.

The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP(T_1 ∪ T_2) where T_1 and T_2 are theories with disjoint finite relational signatures. We prove that if T_1 and T_2 are the theories of temporal structures, i.e., structures where all relations have a first-order definition in (ℚ;<), then CSP(T_1 ∪ T_2) is in P or NP-complete. To this end we prove a purely algebraic statement about the structure of the lattice of locally closed clones over the domain ℚ that contain Aut(ℚ;<).


page 1

page 2

page 3

page 4


Tractable Combinations of Theories via Sampling

For a first-order theory T, the Constraint Satisfaction Problem of T is ...

Complexity of Combinations of Qualitative Constraint Satisfaction Problems

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

Complexity Classification Transfer for CSPs via Algebraic Products

We study the complexity of infinite-domain constraint satisfaction probl...

Embedded Finite Models beyond Restricted Quantifier Collapse

We revisit evaluation of logical formulas that allow both uninterpreted ...

Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems

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

An order out of nowhere: a new algorithm for infinite-domain CSPs

We consider constraint satisfaction problems whose relations are defined...

On amenability of constraint satisfaction problems

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