Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

11/03/2022
by   Petr A. Golovach, et al.
0

The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate dp_k(x_1,y_1,…,x_k,y_k), expressing the existence of internally vertex-disjoint paths between x_i and y_i, for i∈{1,…, k}. This logic can express a wide variety of problems that escape the expressibility potential of FOL. We prove that for every proper minor-closed graph class, model-checking for FOL+DP can be done in quadratic time. We also introduce an extension of FOL+DP, namely the scattered disjoint paths logic, FOL+SDP, where we further consider the atomic predicate s -sdp_k(x_1,y_1,…,x_k,y_k), demanding that the disjoint paths are within distance bigger than some fixed value s. Using the same technique we prove that model-checking for FOL+SDP can be done in quadratic time on classes of graphs with bounded Euler genus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2023

Model Checking Disjoint-Paths Logic on Topological-Minor-Free Graph Classes

Disjoint-paths logic, denoted 𝖥𝖮+𝖣𝖯, extends first-order logic (𝖥𝖮) with...
research
07/13/2021

First-Order Logic with Connectivity Operators

First-order logic (FO) can express many algorithmic problems on graphs, ...
research
10/06/2020

QCTL model-checking with QBF solvers

Quantified CTL (QCTL) extends the temporal logic CTL with quantification...
research
11/04/2021

A Compound Logic for Modification Problems: Big Kingdoms Fall from Within

We introduce a novel model-theoretic framework inspired from graph modif...
research
02/02/2020

Excluding a ladder

Which graph classes C exclude a fixed ladder as a minor? We show that th...
research
01/07/2019

Baker game and polynomial-time approximation schemes

Baker devised a technique to obtain approximation schemes for many optim...
research
06/01/2018

Extension Complexity of the Correlation Polytope

We prove that for every n-vertex graph G, the extension complexity of th...

Please sign up or login with your details

Forgot password? Click here to reset