de.mpg.escidoc.pubman.appbase.FacesBean
English

Item

ITEM ACTIONSEXPORT

Released

Paper

A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons101767

Voigt,  Marco
Automation of Logic, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

arXiv:1704.02145.pdf
(Preprint), 474KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Voigt, M. (2017). A Fine-Grained Hierarchy of Hard Problems in the Separated Fragment. Retrieved from http://arxiv.org/abs/1704.02145.

Cite as: http://hdl.handle.net/11858/00-001M-0000-002C-EFA0-0
Abstract
Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time required to decide SF's satisfiability problem is formulated in terms of quantifier alternations: Given an SF sentence $\exists \vec{z} \forall \vec{x}_1 \exists \vec{y}_1 \ldots \forall \vec{x}_n \exists \vec{y}_n . \psi$ in which $\psi$ is quantifier free, satisfiability can be decided in nondeterministic $n$-fold exponential time. In the present paper, we conduct a more fine-grained analysis of the complexity of SF-satisfiability. We derive an upper and a lower bound in terms of the degree of interaction of existential variables (short: degree)}---a novel measure of how many separate existential quantifier blocks in a sentence are connected via joint occurrences of variables in atoms. Our main result is the $k$-NEXPTIME-completeness of the satisfiability problem for the set $SF_{\leq k}$ of all SF sentences that have degree $k$ or smaller. Consequently, we show that SF-satisfiability is non-elementary in general, since SF is defined without restrictions on the degree. Beyond trivial lower bounds, nothing has been known about the hardness of SF-satisfiability so far.