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_1zbMATH Open1524.68115OpenAlexW4210378659MaRDI QIDQ6166576FDOQ6166576
Authors: Diego Figueira
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
Recommendations
Cites Work
- Parametrized complexity theory.
- Title not available (Why is that?)
- Handbook of weighted automata
- When is the evaluation of conjunctive queries tractable?
- Limitedness theorem on finite automata with distance functions
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Finding Regular Simple Paths in Graph Databases
- Expressiveness and static analysis of extended conjunctive regular path queries
- Title not available (Why is that?)
- Deterministic automata and extensions of weak MSO
- Semantic acyclicity on graph databases
- Graph logics with rational relations: the role of word combinatorics
- Querying Graphs with Data
- A trichotomy for regular simple path queries on graphs
- Regular queries on graph databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph logics with rational relations
- Title not available (Why is that?)
This page was built for publication: Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166576)