Similar Items: Decidability of Querying First-Order Theories via Countermodels of Finite Width
- Tree-width for first order formulae
- On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
- Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
- Craig Interpolation for Decidable First-Order Fragments
- Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
- First-order query evaluation on structures of bounded degree