Search Results for author:
Found 3 papers, 0 papers with code
Tractable Combinations of Temporal CSPs
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 \cup T_2)$ where $T_1$ and $T_2$ are theories with disjoint finite relational signatures.
Logic Computational Complexity Logic in Computer Science 06A05, 68Q25, 08A70 F.4.1; F.2.2; G.2.1
ω-categorical structures avoiding height 1 identities
The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable if the model-complete core of the template has a pseudo-Siggers polymorphism, and NP-complete otherwise.
Logic Logic in Computer Science Rings and Algebras
Complexity Classification in Infinite-Domain Constraint Satisfaction
It turns out that the universal-algebraic approach can also be applied to study large classes of infinite-domain CSPs, yielding elegant complexity classification results.
