Decidability of Downward XPath

DOI10.1145/2362355.2362362zbMath1351.68116OpenAlexW2005612348MaRDI QIDQ2946683

Diego Figueira

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2362355.2362362

zbMATH Keywords

XMLsatisfiabilityXPathemptinessinfinite alphabetdata treedata valuesDD automatadownward data automataextensible language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Formal languages and automata (68Q45)

Related Items (6)

Complexity of Two-Variable Logic on Finite Trees ⋮ Axiomatizations for downward XPath on data trees ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ On regular paths with counting and data tests ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Unnamed Item

Uses Software

• XPath

This page was built for publication: Decidability of Downward XPath