Model-checking on ordered structures

DOI10.1145/3360011MaRDI QIDQ5121264zbMATH OpenOpenAlexFDO

Authors Kord Eickmeyer, Jan van den Heuvel, Ken-ichi Kawarabayashi, Stephan Kreutzer, P. Ossona de Mendez, Michał Pilipczuk, Roman Rabinovich, Sebastian Siebertz, Daniel A. Quiroz

Publication date 11 September 2020

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.08003

zbMATH Keywords

algorithmic meta-theoremsmodel checkingorder-invariancesuccessor-invariance

Mathematics Subject Classification ID

Logic in computer science (03B70) Structural characterization of families of graphs (05C75) Graph minors (05C83) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Abstract: We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but it does become tractable on interesting classes of structures, such as on classes whose Gaifman graphs have bounded treewidth. In this paper we continue this line of research and study model-checking for first- and monadic second-order logic in the presence of an ordering on the input structure. We do so in two settings: the general ordered case, where the input structures are equipped with a fixed order or successor relation, and the order invariant case, where the formulas may resort to an ordering, but their truth must be independent of the particular choice of order. In the first setting we show very strong intractability results for most interesting classes of structures. In contrast, in the order invariant case we obtain tractability results for order-invariant monadic second-order formulas on the same classes of graphs as in the unordered case. For first-order logic, we obtain tractability of successor-invariant formulas on classes whose Gaifman graphs have bounded expansion. Furthermore, we show that model-checking for order-invariant first-order formulas is tractable on coloured posets of bounded width.

Recommendations

• First-order and monadic second-order model-checking on ordered structures
• Model checking for successor-invariant first-order logic on minor-closed graph classes
• Successor-invariant first-order logic on graphs with excluded topological subgraphs
• scientific article; zbMATH DE number 7297863
• Order invariance on decomposable structures

Cited in

(7)

• Global model checking of ordered multi-pushdown systems
• On the ordered conjecture
• First-order and monadic second-order model-checking on ordered structures
• Model checking for successor-invariant first-order logic on minor-closed graph classes
• Successor-invariant first-order logic on graphs with excluded topological subgraphs
• Twin-width. VIII: Delineation and win-wins
• Advances in algorithmic meta theorems (invited paper)

This page was built for publication: Model-checking on ordered structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121264)