Similar Items: Tree-width for first order formulae
- Decidability of Querying First-Order Theories via Countermodels of Finite Width
- Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers
- The First-Order Theory of Ground Tree Rewrite Graphs
- Time and Parallelizability Results for Parity Games with Bounded Tree and DAG Width
- Hardness of monadic second-order formulae over succinct graphs