Conjunctive visibly-pushdown path queries

DOI10.1007/978-3-319-22177-9_25MaRDI QIDQ2947891zbMATH OpenOpenAlexFDO

Authors Martin Lange, Etienne Lozes

Publication date 29 September 2015

Published in Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-22177-9_25

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Recommendations

• Expressiveness and static analysis of extended conjunctive regular path queries
• scientific article; zbMATH DE number 2241907
• On decidability of boundedness property for regular path queries
• Query Automata for Nested Words
• Conjunctive query containment over trees

Cites work

• scientific article; zbMATH DE number 3696500 (Why is no real title available?)
• scientific article; zbMATH DE number 2241907 (Why is no real title available?)
• Conjunctive-query containment and constraint satisfaction
• Deciding Equivalence of Finite Tree Automata
• Expressiveness and static analysis of extended conjunctive regular path queries
• Graph logics with rational relations
• Visibly pushdown languages

Cited in

(6)

• Local higher-order fixpoint iteration
• Exploring non-regular extensions of propositional dynamic logic with description-logics features
• Context-free path querying by Kronecker product
• scientific article; zbMATH DE number 7455743 (Why is no real title available?)
• Expressiveness and static analysis of extended conjunctive regular path queries
• Beyond \(\mathcal{ALC}_{\textsf{reg}} \): exploring non-regular extensions of PDL with description logics features

This page was built for publication: Conjunctive visibly-pushdown path queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947891)