Similar Items: On Knowledge Compilation For Two-Variable First-Order Logic
- Knowledge Compilation for Quantification in Alternating Automata
- Order-invariant cluster first-order logic on graph classes of bounded degree
- Automaton-based Characterisations of First Order Logic over Infinite Trees
- Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
- Constant time testability of first-order logic with modulo counting on finitary graphs
- Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property