eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-01-07
1
12
10.4230/DagSemProc.09441.5
article
The complexity of positive first-order logic without equality II: The four-element case
Martin, Barnaby
Martin, Jos
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol09441/DagSemProc.09441.5/DagSemProc.09441.5.pdf
Quantified constraints
Galois connection