Complexity of Existential Positive First-Order Logic
Computational Complexity
2011-01-13 v2 Logic in Computer Science
Abstract
Let gamma be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in gamma is in Logspace or complete for the class CSP(gamma)_NP under deterministic polynomial-time many-one reductions. Here, CSP(gamma)_NP is the class of problems that can be reduced to the Constraint Satisfaction Problem of gamma under non-deterministic polynomial-time many-one reductions.
Cite
@article{arxiv.1011.4757,
title = {Complexity of Existential Positive First-Order Logic},
author = {Manuel Bodirsky and Miki Hermann and Florian Richoux},
journal= {arXiv preprint arXiv:1011.4757},
year = {2011}
}
Comments
8 pages