246 research outputs found

    Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification

    Get PDF
    Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential second-order logic (ESO logic) if, and only if, it is in NP. A natural question, from the theory's point of view, is which syntactic fragments of ESO logic also still characterize NP. Research on this question has culminated in a dichotomy result by Gottlob, Kolatis, and Schwentick: for each possible quantifier prefix of an ESO formula, the resulting prefix class either contains an NP-complete problem or is contained in P. However, the exact complexity of the prefix classes inside P remained elusive. In the present paper, we clear up the picture by showing that for each prefix class of ESO logic, its reduction closure under first-order reductions is either FO, L, NL, or NP. For undirected, self-loop-free graphs two containment results are especially challenging to prove: containment in L for the prefix ∃R1⋯∃Rn∀x∃y\exists R_1 \cdots \exists R_n \forall x \exists y and containment in FO for the prefix ∃M∀x∃y\exists M \forall x \exists y for monadic MM. The complex argument by Gottlob, Kolatis, and Schwentick concerning polynomial time needs to be carefully reexamined and either combined with the logspace version of Courcelle's Theorem or directly improved to first-order computations. A different challenge is posed by formulas with the prefix ∃M∀x∀y\exists M \forall x\forall y: We show that they express special constraint satisfaction problems that lie in L.Comment: Technical report version of a STACS 2015 pape

    A Nice Labelling for Tree-Like Event Structures of Degree 3 (Extended Version)

    Get PDF
    We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3
    • …
    corecore