Extending Courcelle's Theorem with Optimality Predicates
A new logic is introduced, which extends $\mathsf{CMSO}$ with predicates for membership in the families of minimum- and maximum-cardinality sets satisfying a fixed formula $\phi(X)$, and algorithmic meta-theorems based on fixed-parameter tractable model checking are given.