License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09441.5
URN: urn:nbn:de:0030-drops-23670
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2367/
Go to the corresponding Portal |
Martin, Barnaby ;
Martin, Jos
The complexity of positive first-order logic without equality II: The four-element case
Abstract
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.
BibTeX - Entry
@InProceedings{martin_et_al:DagSemProc.09441.5,
author = {Martin, Barnaby and Martin, Jos},
title = {{The complexity of positive first-order logic without equality II: The four-element case}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {9441},
editor = {Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2010/2367},
URN = {urn:nbn:de:0030-drops-23670},
doi = {10.4230/DagSemProc.09441.5},
annote = {Keywords: Quantified constraints, Galois connection}
}
Keywords: |
|
Quantified constraints, Galois connection |
Collection: |
|
09441 - The Constraint Satisfaction Problem: Complexity and Approximability |
Issue Date: |
|
2010 |
Date of publication: |
|
07.01.2010 |