Definability for downward and vertical XPath on data trees
From MaRDI portal
Recommendations
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Axiomatizations for downward XPath on data trees
- Model theory of XPath on data trees. I: Bisimulation and characterization
- scientific article; zbMATH DE number 5999538
- Bottom-up automata on data trees and vertical \(\mathsf{XPath}\)
Cited in
(11)- Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\)
- Model theory of XPath on data trees. II: Binary bisimulation and definability
- Axiomatizations for downward XPath on data trees
- Hilbert-style axiomatization for hybrid XPath with data
- Model theory of XPath on data trees. I: Bisimulation and characterization
- Decidability of downward XPath
- scientific article; zbMATH DE number 5999538 (Why is no real title available?)
- Bottom-up automata on data trees and vertical \(\mathsf{XPath}\)
- scientific article; zbMATH DE number 7407777 (Why is no real title available?)
- Database Theory - ICDT 2005
- Data-aware hybrid tableaux
This page was built for publication: Definability for downward and vertical XPath on data trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938128)