Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science
Universal Algebra and Applications in Theoretical Computer Science
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Homomorphism Closed vs. Existential Positive
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On Digraph Coloring Problems and Treewidth Duality
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Symmetric Datalog and Constraint Satisfaction Problems in Logspace
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Affine systems of equations and counting infinitary logic
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
Robust satisfiability of constraint satisfaction problems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Meditations on quantified constraint satisfaction
Logic and Program Semantics
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Robust Satisfiability for CSPs: Hardness and Algorithmic Results
ACM Transactions on Computation Theory (TOCT)
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM (JACM)
| Hi-index | 5.23 |
We present algebraic conditions on constraint languages @C that ensure the hardness of the constraint satisfaction problem CSP(@C) for complexity classes L, NL, P, NP and Mod"pL. These criteria also give non-expressibility results for various restrictions of Datalog. Furthermore, we show that if CSP(@C) is not first-order definable then it is L-hard. Our proofs rely on tame congruence theory and on a fine-grain analysis of the complexity of reductions used in the algebraic study of CSP. The results pave the way for a refinement of the dichotomy conjecture stating that each CSP(@C) lies in P or is NP-complete and they match the recent classification of [E. Allender, M. Bauland, N. Immerman, H. Schnoor, H. Vollmer, The complexity of satisfiability problems: Refining Schaefer's theorem, in: Proc. 30 th Math. Found. of Comp. Sci., MFCS'05, 2005, pp. 71-82] for Boolean CSP. We also infer a partial classification theorem for the complexity of CSP(@C) when the associated algebra of @C is the full idempotent reduct of a preprimal algebra.