Work

Complexity of Existential Positive First-Order Logic

Year: 2010

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1011.4757

Authors: Bodirsky, Manuel, Hermann, Miki, Richoux, Florian

Institutions: Centre National de la Recherche Scientifique, École Polytechnique, Laboratoire d'Informatique de l'École Polytechnique, Japanese-French Laboratory for Informatics, The University of Tokyo

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2950098176

Cites: 7

Cited by: 1

Related to: 20