Sciweavers

90
Voted
CIE
2009
Springer
15 years 6 months ago
Complexity of Existential Positive First-Order Logic
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...
Manuel Bodirsky, Miki Hermann, Florian Richoux