A Note on C² Interpreted over Finite Data-Words
From MaRDI portal
Publication:6060103
DOI10.4230/lipics.time.2020.17zbMath1530.03049OpenAlexW3089668284MaRDI QIDQ6060103
Piotr Witkowski, Bartosz Bednarczyk
Publication date: 2 November 2023
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12985/pdf/LIPIcs-TIME-2020-17.pdf/
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Metric propositional neighborhood logic with an equivalence relation
- On temporal logics with data variable quantifications: decidability and complexity
- An algebraic approach to data languages and timed languages
- A logical characterization of data languages.
- On logics with two variables
- Presburger concept cardinality constraints in very expressive description logics. Allegro sexagenarioso ma non ritardando
- A note on the emptiness problem for alternating finite-memory automata
- First-order logic with two variables and unary temporal logic
- Weak and Nested Class Memory Automata
- Reasoning about Data Repetitions with Counter Systems
- An extension of data automata that captures XPath
- A Robust Class of Data Languages and an Application to Learning
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Algorithmic analysis of array-accessing programs
- An Automaton over Data Words That Captures EMSO Logic
- The two‐variable fragment with counting and equivalence
- Shuffle Expressions and Words with Nested Data
- Demystifying Reachability in Vector Addition Systems
- The Two-Variable Fragment with Counting Revisited
- The reachability problem for Petri nets is not elementary
- Two-variable First-Order Logic with Counting in Forests
- Two-variable Logic with Counting and a Linear Order
