Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs

نویسندگان

  • Kord Eickmeyer
  • Ken-ichi Kawarabayashi
چکیده

We show that the model-checking problem for successorinvariant first-order logic is fixed-parameter tractable on graphs with excluded topological subgraphs when parameterised by both the size of the input formula and the size of the exluded topological subgraph. Furthermore, we show that model-checking for order-invariant first-order logic is tractable on coloured posets of bounded width, parameterised by both the size of the input formula and the width of the poset. Results of this form, i.e. showing that model-checking for a certain logic is tractable on a certain class of structures, are often referred to as algorithmic meta-theorems since they give a unified proof for the tractability of a whole range of problems. First-order logic is arguably one of the most important logics in this context since it is powerful enough to express many computational problems (e.g. the existence of cliques, dominating sets etc.) and yet its model-checking problem is tractable on rich classes of graphs. In fact, Grohe et al. [21] have shown that model-checking for FO is tractable on all nowhere dense classes of graphs. Successor-invariant FO is a semantic extension of FO by allowing the use of an additional binary relation which is interpreted as a directed Hamiltonian cycle, restricted to formulae whose truth value does not depend on the specific choice of a Hamiltonian cycle. While this is very natural in the context of model-checking (after all, storing a structure in computer memory usually brings with it a linear order on the structure), the question of how the computational complexity of the model-checking problem for this richer logic compares to that of plain FO is still open. Our result for successor-invariant FO extends previous results for this logic on planar graphs [14] and graphs with excluded minors [13], further narrowing the gap between what is known for FO and what is known for successor-invariant FO. The proof uses Grohe and Marx’s structure theorem for graphs with excluded topological subgraphs [22]. For order-invariant FO we show that Gajarský et al.’s recent result for FO carries over to order-invariant FO. 1 ar X iv :1 60 5. 01 19 8v 1 [ cs .L O ] 4 M ay 2 01 6 2 KORD EICKMEYER AND KEN-ICHI KAWARABAYASHI

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Generalised Colouring Numbers on Classes of Bounded Expansion

The generalised colouring numbers admr(G), colr(G), and wcolr(G) were introduced by Kierstead and Yang as generalisations of the usual colouring number, also known as the degeneracy of a graph, and have since then found important applications in the theory of bounded expansion and nowhere dense classes of graphs, introduced by Nešetřil and Ossona de Mendez. In this paper, we study the relation ...

متن کامل

Successor-invariant first-order logic on finite structures

We consider successor-invariant first-order logic (FO+ succ)inv, consisting of sentences Φ involving an “auxiliary” binary relation S such that (A, S1) |= Φ ⇐⇒ (A, S2) |= Φ for all finite structures A and successor relations S1, S2 on A. A successorinvariant sentence Φ has a well-defined semantics on finite structures A with no given successor relation: one simply evaluates Φ on (A, S) for an a...

متن کامل

Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs

We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological ordering, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula φ and are the union of k directed paths, in time f(φ, k, z) · n. Our result implies the polynomial time solvabilit...

متن کامل

Successor-Invariance in the Finite

A first-order sentence θ of vocabulary σ ∪ {S} is successor-invariant in the finite if for every finite σ-structure M and successor relations S1 and S2 on M, (M, S1) |= θ ⇐⇒ (M, S2) |= θ. In this paper I give an example of a non-first-order definable class of finite structures which is, however, defined by a successor-invariant first-order sentence. This strengthens a corresponding result for o...

متن کامل

Parameterized complexity of finding small degree-constrained subgraphs

In this article we study the parameterized complexity of problems consisting in finding degree-constrained subgraphs, taking as the parameter the number of vertices of the desired subgraph. Namely, given two positive integers d and k, we study the problem of finding a d-regular (induced or not) subgraph with at most k vertices and the problem of finding a subgraph with at most k vertices and of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016