# Parameterized Complexity Of Representing Models Of MSO Formulas

arXiv: https://arxiv.org/abs/2604.08707 · HTML: https://mlsanity.com/paper/2604.08707/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 4 of its 20 references that are in the map.
- First posted on arXiv 9 Apr 2026.

## Builds on (most cited first, 4 of 4)

- [SDDs are Exponentially More Succinct than OBDDs](https://mlsanity.com/paper/1601.00501/) (2016)
- [QBF as an Alternative to Courcelle's Theorem](https://mlsanity.com/paper/1805.08456/) (2018)
- [On OBDDs for CNFs of bounded treewidth](https://mlsanity.com/paper/1308.3829/) (2013)
- [Connecting Width and Structure in Knowledge Compilation (Extended Version)](https://mlsanity.com/paper/1709.06188/) (2017)

## Abstract (arXiv)

Monadic second order logic (MSO2) plays an important role in parameterized complexity due to the Courcelle's theorem. This theorem states that the problem of checking if a given graph has a property specified by a given MSO2 formula can be solved by a parameterized linear time algorithm with respect to the treewidth of the graph and the size of the formula. We extend this result by showing that models of MSO2 formula with free variables can be represented with a decision diagram whose size is parameterized linear in the above mentioned parameter. In particular, we show a parameterized linear upper bound on the size of a sentential decision diagram (SDD) when treewidth is considered and a parameterized linear upper bound on the size of an ordered binary decision diagram (OBDD) when considering the pathwidth in the parameter. In addition, building on a lower bound on the size of OBDD by Razgon (2014), we show that there is an MSO2 formula and a class of graphs with bounded treewidth which do not admit an OBDD with the size parameterized by the treewidth. Our result offers a new perspective on the Courcelle's theorem and connects it to the area of knowledge representation.