Complexity of Existential Positive First-Order Logic - Computer Science > Computational ComplexityReportar como inadecuado




Complexity of Existential Positive First-Order Logic - Computer Science > Computational Complexity - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Let gamma be a not necessarily finite structure with a finite relationalsignature. We prove that deciding whether a given existential positive sentenceholds in gamma is in Logspace or complete for the class CSPgamma NP underdeterministic polynomial-time many-one reductions. Here, CSPgamma NP is theclass of problems that can be reduced to the Constraint Satisfaction Problem ofgamma under non-deterministic polynomial-time many-one reductions.



Autor: Manuel Bodirsky, Miki Hermann, Florian Richoux

Fuente: https://arxiv.org/







Documentos relacionados