Model theory of XPath on data trees. II: Binary bisimulation and definability

DOI10.1016/j.ic.2017.01.002zbMath1372.68078OpenAlexW2571828207MaRDI QIDQ2401631

María Emilia Descotte, Santiago Figueira, Sergio Abriola

Publication date: 4 September 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.01.002

Mathematics Subject Classification ID

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

Related Items (5)

Hennessy-Milner and van Benthem for instantial neighbourhood logic ⋮ Characterizations for \(\mathrm{XPath}_{\mathcal{R}}(\downarrow)\) ⋮ Axiomatizations for downward XPath on data trees ⋮ A quantified coalgebraic van Benthem theorem ⋮ Unnamed Item

Uses Software

• XPath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal characterisation theorems over special classes of frames
• A calculus of communicating systems
• Model theory.
• Bisimulations for temporal logic
• Modal logic over finite structures
• Characterization, definability and separation via saturated models
• Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization
• Two-variable logic on data trees and XML reasoning
• Simulating without Negation
• Similarity and bisimilarity notions appropriate for characterizing indistinguishability in fragments of the calculus of relations

This page was built for publication: Model theory of XPath on data trees. II: Binary bisimulation and definability