The complexity of infinite H-colouring
Journal of Combinatorial Theory Series B
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
A shorter model theory
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A Graph of a Relational Structure and Constraint Satisfaction Problems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Tractability and learnability arising from algebras with few subpowers
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Understanding the Complexity of Induced Subgraph Isomorphisms
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Complexity of Existential Positive First-Order Logic
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computational complexity of linear constraints over the integers
Artificial Intelligence
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem Lan 茂戮驴-categoricaltemplate Γsuch that Lreduces to CSP(Γ) and CSP(Γ) is in coNPL(i.e., the class coNP with an oracle for L). CSPs with 茂戮驴-categorical templates are of special interest, because the universal-algebraic approach can be applied to study their computational complexity.Furthermore, we prove that there are 茂戮驴-categorical templates with coNP-complete CSPs and 茂戮驴-categorical templates with coNP- intermediate CSPs, i.e., problems in coNP that are neither coNP- complete nor in P (unless P=coNP). To construct the coNP-intermediate CSP with 茂戮驴-categorical template we modify the proof of Ladner's theorem. A similar modification allows us to also prove a non-dichotomy result for a class of left-hand side restricted CSPs, which was left open in [10]. We finally show that if the so-called local-global conjecturefor infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraint satisfaction problem for infinite constraint languages.