Affiliation:
1. University of Bremen, Germany
Abstract
First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size. However, FO cannot express the very simple algorithmic question whether two vertices are connected. We enrich FO with connectivity predicates that are tailored to express algorithmic graph problems that are commonly studied in parameterized algorithmics. By adding the atomic predicates conn
k
(
x,y,z_1,..., z
k
) that hold true in a graph if there exists a path between (the valuations of)
x
and
y
after (the valuations of)
z
1
,..., z
k
have been deleted, we obtain
separator logic
FO + conn. We show that separator logic can express many interesting problems, such as the feedback vertex set problem and elimination distance problems to first-order definable classes. Denote by FO + conn
k
the fragment of separator logic that is restricted to connectivity predicates with at most
k + 2
variables (that is, at most
k
deletions), we show that FO + conn
k + 1
is strictly more expressive than FO + conn
k
for all
k ≥ 0
. We then study the limitations of separator logic and prove that it cannot express planarity, and, in particular, not the disjoint paths problem. We obtain the stronger
disjoint-paths logic
FO + DP by adding the atomic predicates disjoint-paths
k
[(
x
1
, y
1
),..., (
x
k
, y
k
) that evaluate to true if there are internally vertex-disjoint paths between (the valuations of)
x
i
and
y
i
for all
1 ≤ i ≤ k
. Disjoint-paths logic can express the disjoint paths problem, the problem of (topological) minor containment, the problem of hitting (topological) minors, and many more. Again, we show that the fragments FO + DP
k
that use predicates for at most
k
disjoint paths form a strict hierarchy of expressiveness. Finally, we compare the expressive power of the new logics with that of transitive-closure logics and monadic second-order logic.
Funder
German Research Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference40 articles.
1. Akanksha Agrawal, Lawqueen Kanesh, Fahad Panolan, M. S. Ramanujan, and Saket Saurabh. 2021. An FPT algorithm for elimination distance to bounded degree graphs. In Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS’21). Schloss Dagstuhl-Leibniz-Zentrum für Informatik.
2. László Babai. 1996. Automorphism Groups, Isomorphism, Reconstruction. MIT Press, Cambridge, MA, 1447–1540.
3. Mikołaj Bojańczyk. 2021. Separator logic and star-free expressions for graphs. Retrieved from https://arXiv:2107.13953.
4. Twin-width IV: ordered graphs and matrices
5. Jannis Bulian. 2017. Parameterized Complexity of Distances to Sparse Graph Classes. Technical Report. University of Cambridge, Computer Laboratory.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A categorical account of composition methods in logic;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26