Directed st-Connectivity Is Not Expressible in Symmetric Datalog
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Dualities for Constraint Satisfaction Problems
Complexity of Constraints
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
CSP duality and trees of bounded pathwidth
Theoretical Computer Science
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
| Hi-index | 0.00 |
We introduce symmetric Datalog, a syntactic restriction of linear Datalog and show that its expressive power is exactly that of restricted symmetric Krom monotone SNP. The deep result of Reingold [17] on the complexity of undirected connectivity suffices to show that symmetric Datalog queries can be evaluated in logarithmic space. We show that for a number of constraint languages \Gamma, the complement of the constraint satisfaction problem CSP(\Gamma) can be expressed in symmetric Datalog. In particular, we show that if CSP(\Gamma) is first-order definable and \Lambda is a finite subset of the relational clone generated by \Gamma then 卢CSP(\Lambda) is definable in symmetric Datalog. Over the two-element domain and under standard complexity-theoretic assumptions, expressibility of 卢CSP(\Gamma) in symmetric Datalog corresponds exactly to the class of CSPs computable in logarithmic space. Finally, we describe a fairly general subclass of implicational (or 0/1/all) constraints for which the complement of the corresponding CSP is also definable in symmetric Datalog. Our results provide preliminary evidence that symmetric Datalog may be a unifying explanation for families of CSPs lying in L.