Faster Existential FO Model Checking on Posets

DOI10.2168/LMCS-11(4:8)2015zbMath1448.68298OpenAlexW2949788841MaRDI QIDQ5899632

Jan Obdržálek, Petr Hliněný, Jakub Gajarský, Sebastian Ordyniak

Publication date: 7 January 2016

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2168/lmcs-11(4:8)2015

zbMATH Keywords

first-order logicmodel checkingpartially ordered setsparameterized complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Partial orders, general (06A06) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Reducing CMSO model checking to highly connected graphs