Limiting Until in ordered tree query languages

DOI10.1145/2856104MaRDI QIDQ5277915zbMATH OpenOpenAlexFDO

Authors Michael Benedikt, Clemens Ley

Publication date 12 July 2017

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:ad100836-30c0-45ad-8f1a-052644a6fd93

zbMATH Keywords

XMLhierarchytreestemporal logic

Mathematics Subject Classification ID

Database theory (68P15) Temporal logic (03B44)

Recommendations

• Database Theory - ICDT 2005
• Highly expressive query languages for unordered data trees
• The complexity of query containment in expressive fragments of XPath 2.0
• Complete axiomatizations for XPath fragments
• Transitive closure logic, nested tree walking automata, and XPath

Cites work

• scientific article; zbMATH DE number 4027441 (Why is no real title available?)
• scientific article; zbMATH DE number 1142326 (Why is no real title available?)
• scientific article; zbMATH DE number 1927553 (Why is no real title available?)
• scientific article; zbMATH DE number 1759449 (Why is no real title available?)
• An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
• Counting on CTL^*: On the expressive power of monadic path logic
• Database Theory - ICDT 2005
• Efficient and Expressive Tree Filters
• Elements of finite model theory.
• Nesting until and since in linear temporal logic
• Reasoning about XML with Temporal Logics and Automata

Cited in

(3)

• Highly expressive query languages for unordered data trees
• scientific article; zbMATH DE number 7577575 (Why is no real title available?)
• Database Theory - ICDT 2005

Describes a project that uses

Uses Software

• XPath

This page was built for publication: Limiting Until in ordered tree query languages

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