Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes

Model checking problems for first- and monadic second-order logic on graphs have received considerable attention in the past, not the least due to their connections to problems in algorithmic graph structure theory. While the model checking problem for these logics on general graphs is computational...

Ausführliche Beschreibung