Model theory of XPath on data trees. I: Bisimulation and characterization

DOI10.1613/JAIR.4658MaRDI QIDQ2941736zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15)

Recommendations

• Model theory of XPath on data trees. II: Binary bisimulation and definability
• Axiomatizations for downward XPath on data trees
• Definability for downward and vertical XPath on data trees
• Bisimulations on Data Graphs
• Alternating automata on data trees and XPath satisfiability

Cited in

(13)

• On regular paths with counting and data tests
• Hennessy-Milner and van Benthem for instantial neighbourhood logic
• Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\)
• A quantified coalgebraic van Benthem theorem
• 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
• Definability for downward and vertical XPath on data trees
• Logics of repeating values on data trees and branching counter systems
• scientific article; zbMATH DE number 7407777 (Why is no real title available?)
• A sequent calculus for a modal logic on finite data trees
• Data-aware hybrid tableaux
• Modal logic with relations over paths: a theoretical development through comonadic semantics

Describes a project that uses

Uses Software

• XPath

This page was built for publication: Model theory of XPath on data trees. I: Bisimulation and characterization

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