The complexity of positive first-order logic without equality II: The four-element case
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of the non-uniform quantified constraint satisfaction problem QCSP(B). Extending the algebraic methods of a previous paper, we derive a complete complexity classification for these problems as B ranges over structures of domain size 4. Specifically, each problem is either in Logspace, is NP-complete, is co-NP-complete or is Pspace-complete.
Quantified constraints
Galois connection
1-12
Regular Paper
Barnaby
Martin
Barnaby Martin
Jos
Martin
Jos Martin
10.4230/DagSemProc.09441.5
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode