Reasoning about XML with temporal logics and automata
From MaRDI portal
Publication:975873
DOI10.1016/j.jal.2009.09.005zbMath1192.68435OpenAlexW2139258089MaRDI QIDQ975873
Cristina Sirangelo, Leonid O. Libkin
Publication date: 11 June 2010
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17831759/Libkin_Sirangelo_2010_Reasoning_about_XML_with_Temporal_Logics_and_Automata.pdf
Related Items (3)
Efficiently Deciding μ-Calculus with Converse over Finite Trees ⋮ Static analysis of XML security views and query rewriting ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \textit{Once} and \textit{for all}
- Automata for XML -- a survey
- Reasoning about XML update constraints
- Automata-theoretic techniques for modal logics of programs
- Reasoning about infinite computations
- Query automata over finite trees
- Expressiveness of structured document query languages based on attribute grammars
- Two-variable logic on data trees and XML reasoning
- XPath satisfiability in the presence of DTDs
- Expressive completeness of temporal logic of trees
- Tools and Algorithms for the Construction and Analysis of Systems
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Inconsistency Tolerance
- Database Programming Languages
- Database Programming Languages
- Monadic datalog and the expressive power of languages for Web information extraction
- Reasoning about XML with Temporal Logics and Automata
- Automata, Languages and Programming
This page was built for publication: Reasoning about XML with temporal logics and automata
