Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
From MaRDI portal
Publication:6166576
DOI10.1007/978-3-030-95481-9_1zbMath1524.68115OpenAlexW4210378659MaRDI QIDQ6166576
Publication date: 3 August 2023
Published in: Reasoning Web. Declarative Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-95481-9_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expressiveness and static analysis of extended conjunctive regular path queries
- Handbook of weighted automata
- Limitedness theorem on finite automata with distance functions
- A trichotomy for regular simple path queries on graphs
- Regular queries on graph databases
- Parametrized complexity theory.
- Graph Logics with Rational Relations
- Querying Graphs with Data
- Semantic Acyclicity on Graph Databases
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Finding Regular Simple Paths in Graph Databases
- When is the evaluation of conjunctive queries tractable?
- Graph Logics with Rational Relations
This page was built for publication: Foundations of graph path query languages. Course notes for the reasoning web summer school 2021