Similar Items: Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
- Order-invariant cluster first-order logic on graph classes of bounded degree
- Correct-by-Construction G-Code Generation: A Neuro-Symbolic Approach via Separation Logic
- 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
- On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic