Abstract
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE or complete for the class CSP(Γ)NP under deterministic polynomial-time many-one reductions. Here, CSP(Γ)NP is the class of problems that can be reduced to the constraint satisfaction problem of Γ under non-deterministic polynomial-time many-one reductions. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Bodirsky, M., Hermann, M., & Richoux, F. (2009). Complexity of existential positive first-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5635 LNCS, pp. 31–36). Springer Verlag. https://doi.org/10.1007/978-3-642-03073-4_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
