Some modal aspects of XPath
From MaRDI portal
Publication:2901192
DOI10.3166/jancl.20.139-171zbMath1242.68010MaRDI QIDQ2901192
Tadeusz Litak, Balder ten Cate, Gaëlle Fontaine
Publication date: 17 July 2012
Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3166/jancl.20.139-171
68P15: Database theory
03B45: Modal logic (including the logic of norms)
03B70: Logic in computer science
68M11: Internet topics
Related Items
Constructive Modalities with Provability Smack, Modal characterisation theorems over special classes of frames, Complete axiomatizations for XPath fragments, Axiomatizations for downward XPath on data trees
Uses Software
Cites Work
- Unnamed Item
- Structural properties of XPath fragments
- Modal characterisation theorems over special classes of frames
- A note on the characterization of TL [EF]
- Complete axiomatizations for XPath fragments
- On modal \(\mu \)-calculus and Gödel-Löb logic
- Dynamic algebras: Examples, constructions, applications
- An axiomatization for until and since over the reals without the IRR rule
- Propositional dynamic logic of regular programs
- A completeness theorem for Kleene algebras and the algebra of regular events
- An algebraic theory of normal forms
- An equational axiomatization of dynamic negation and relational composition
- Program constructions that are safe for bisimulation
- Past is for free: On the complexity of verifying linear temporal properties with past
- Axiomatizing the logical core of XPath 2.0
- Modal frame correspondences and fixed-points
- Finite models constructed from canonical formulas
- Characterizing EF and EX tree logics
- First-order logic with two variables and unary temporal logic
- Normal forms in modal logic
- The complexity of query containment in expressive fragments of XPath 2.0
- Conjunctive queries over trees
- XPath satisfiability in the presence of DTDs
- The complexity of propositional linear temporal logics
