On the complexity of H-coloring
Journal of Combinatorial Theory Series B
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Towards a trichotomy for quantified H-coloring
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Complexity of Existential Positive First-Order Logic
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
The lattice structure of sets of surjective hyper-operations
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
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
The Complexity of Positive First-Order Logic without Equality
ACM Transactions on Computational Logic (TOCL)
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
| Hi-index | 0.00 |
We study the complexity of the model checking problem, for fixed models A, over certain fragments $\mathcal{L}$ of first-order logic, obtained by restricting which of the quantifiers and boolean connectives we permit. These are sometimes known as the expression complexities of $\mathcal{L}$. We obtain various full and partial complexity classification theorems for these logics $\mathcal{L}$ as each ranges over models A, in the spirit of the dichotomy conjecture for the Constraint Satisfaction Problem --- which itself may be seen as the model checking problem for existential conjunctive positive first-order logic.