Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
First-Order Model Checking Problems Parameterized by the Model
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
The Complexity of Positive First-order Logic without Equality
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
The complexity of positive first-order logic without equality II: the four-element case
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic counterparts to sets of relations closed under definability in positive first-order (fo) logic without equality. Specifically, for a countable set of relations (forming the finite-domain structure) B, the set of relations definable over B in positive fo logic without equality consists of exactly those relations that are invariant under the surjective hyper-endomorphisms (shes) of B. The evaluation problem for this logic on a fixed finite structure is a close relative of the quantified constraint satisfaction problem (QCSP). We study in particular an inverse operation that specifies an automorphism of our lattice. We use our results to give a dichotomy theorem for the evaluation problem of positive fo logic without equality on structures that are she-complementative, i.e. structures B whose set of shes is closed under inverse. These problems turn out either to be in L or to be Pspace-complete. We go on to apply our results to certain digraphs. We prove that the evaluation of positive fo without equality on a semicomplete digraph is always Pspace-complete. We go on to prove that this problem is NP-hard for any graph of diameter at least 3. Finally, we prove a tetrachotomy for antireflexive and reflexive graphs, modulo a known conjecture as to the complexity of the QCSP on connected non-bipartite graphs. Specifically, these problems are either in L, NP-complete, co-NP-complete or Pspace-complete.