Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
From MaRDI portal
Publication:2941736
DOI10.1613/jair.4658zbMath1336.68057OpenAlexW2213813753MaRDI QIDQ2941736
Diego Figueira, Santiago Figueira, Carlos Areces
Publication date: 25 August 2015
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4658
Related Items (9)
Hennessy-Milner and van Benthem for instantial neighbourhood logic ⋮ 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 ⋮ Logics of Repeating Values on Data Trees and Branching Counter Systems ⋮ A quantified coalgebraic van Benthem theorem ⋮ On regular paths with counting and data tests ⋮ Hilbert-Style Axiomatization for Hybrid XPath with Data ⋮ Unnamed Item
Uses Software
This page was built for publication: Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
