Decidability of downward XPath
From MaRDI portal
Recommendations
Cited in
(15)- Alternating automata on data trees and XPath satisfiability
- scientific article; zbMATH DE number 7407777 (Why is no real title available?)
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- On regular paths with counting and data tests
- An extension of data automata that captures XPath
- Decidable classes of documents for XPath
- Complexity of two-variable logic on finite trees
- Hilbert-style axiomatization for hybrid XPath with data
- Logics of repeating values on data trees and branching counter systems
- Axiomatizations for downward XPath on data trees
- Data-aware hybrid tableaux
- Database Programming Languages
- XPath satisfiability in the presence of DTDs
- Data graphs with incomplete information (and a way to complete them)
This page was built for publication: Decidability of downward XPath
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946683)