scientific article; zbMATH DE number 7278115
From MaRDI portal
Publication:5136335
DOI10.4230/LIPIcs.FSTTCS.2017.43zbMath1491.68061arXiv1710.04419MaRDI QIDQ5136335
Jan Otop, Piotr Wieczorek, Jakub Michaliszyn
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.04419
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Data complexity of query answering in description logics
- Synchronized rational relations of finite and infinite words
- Low-complexity aggregation in GraphLog and Datalog
- Rewriting of regular expressions and regular path queries
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Synchronizing relations on words
- Finite-memory automata
- Two-variable logic on data words
- What’s Decidable about Weighted Automata?
- Querying Graphs with Data
- Expressive Path Queries on Graph with Data
- Complexity of Subcases of Presburger Arithmetic
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
- Finding Regular Simple Paths in Graph Databases
- Finite state machines for strings over infinite alphabets
- On Relations Defined by Generalized Finite Automata
