Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
From MaRDI portal
Publication:6166576
Recommendations
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 7561597 (Why is no real title available?)
- scientific article; zbMATH DE number 7297854 (Why is no real title available?)
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- scientific article; zbMATH DE number 7650892 (Why is no real title available?)
- scientific article; zbMATH DE number 7650987 (Why is no real title available?)
- A trichotomy for regular simple path queries on graphs
- Deterministic automata and extensions of weak MSO
- Expressiveness and static analysis of extended conjunctive regular path queries
- Finding Regular Simple Paths in Graph Databases
- Graph logics with rational relations
- Graph logics with rational relations: the role of word combinatorics
- Handbook of weighted automata
- Limitedness theorem on finite automata with distance functions
- Parametrized complexity theory.
- Querying Graphs with Data
- Regular queries on graph databases
- Semantic acyclicity on graph databases
- The Theory of Stabilisation Monoids and Regular Cost Functions
- When is the evaluation of conjunctive queries tractable?
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)