FO model checking on posets of bounded width

DOI10.1109/FOCS.2015.63MaRDI QIDQ6946848zbMATH OpenFDO

Authors Petr Hliněný, Sebastian Ordyniak, Jakub Gajarský, M. S. Ramanujan, Daniel Lokshtanov, Saket Saurabh, Jan Obdrálek

Publication date 5 August 2025

Full work available at URL http://wrap.warwick.ac.uk/97713/7/WRAP-FO-model-checking-Posets-Ramanujan-2015.pdf

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(6)

• First order logic and twin-width in tournaments and dense oriented graphs
• Partition strategies for the maker-breaker domination game
• Twin-width. IV: Ordered graphs and matrices
• First order logic on pathwidth revisited again
• Minimizing maximum dissatisfaction in the allocation of indivisible items under a common preference graph
• Twin-width. VIIIa: Delineation

This page was built for publication: FO model checking on posets of bounded width

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