Complexity of Existential Positive First-Order Logic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Logic and Computation Année : 2013

Complexity of Existential Positive First-Order Logic

Résumé

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 LOG SPACE 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.
Fichier principal
Vignette du fichier
expos-final.pdf (105.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00870985 , version 1 (21-10-2013)

Identifiants

Citer

Manuel Bodirsky, Miki Hermann, Florian Richoux. Complexity of Existential Positive First-Order Logic. Journal of Logic and Computation, 2013, 23 (4), pp.753-760. ⟨10.1093/logcom/exr043⟩. ⟨hal-00870985⟩
282 Consultations
158 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More