On the satisfiability of local first-order logics with data
From MaRDI portal
Publication:6597951
DOI10.46298/lmcs-20(3:1)2024MaRDI QIDQ6597951
Unnamed Author, Benedikt Bollig, Arnaud Sangnier
Publication date: 4 September 2024
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal construction of Hanf sentences
- Elements of finite model theory.
- The complexity of hybrid logics over equivalence relations
- An automata-theoretic approach to the verification of distributed algorithms
- Identifiers in registers. Describing network algorithms with logic
- First-order logic with two variables and unary temporal logic
- Two variable first-order logic over ordered domains
- Temporal Logics on Words with Multiple Data Values.
- Two-variable logic on data words
- Two-Variable Logic on 2-Dimensional Structures.
- Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk).
- What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms
- Ordered Navigation on Multi-attributed Data Words
- Two-variable logic on data trees and XML reasoning
- Shuffle Expressions and Words with Nested Data
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Decidability of Parameterized Verification
- Computer Science Logic
- Extending two-variable logic on data trees with order on data values and its automata
- On Reasoning About Rings
- Undecidability of some simple formalized theories
- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract)
- Two-Variable First-Order Logic with Equivalence Closure
- Hybrid logic and its proof-theory
- A Note on C² Interpreted over Finite Data-Words
This page was built for publication: On the satisfiability of local first-order logics with data
