PDL for ordered trees

  title={PDL for ordered trees},
  author={Loredana Afanasiev and P. Blackburn and I. Dimitriou and B. Gaiffe and E. Goris and maarten marx and M. Rijke},
  journal={Journal of Applied Non-Classical Logics},
  pages={115 - 135}
  • Loredana Afanasiev, P. Blackburn, +4 authors M. Rijke
  • Published 2005
  • Computer Science
  • Journal of Applied Non-Classical Logics
  • This paper is about a special version of PDL, proposed by Marcus Kracht, for reasoning about sibling ordered trees. It has four basic programs corresponding to the child, parent, left- and right-sibling relations in such trees. The original motivation for this language is rooted in the field of model-theoretic syntax. Motivated by recent developments in the area of semi-structured data, and, especially, in the field of query languages for XML (eXtensible Markup Language) documents, we revisit… CONTINUE READING
    71 Citations
    Combining Temporal Logics for Querying XML Documents
    • 16
    • PDF
    A system for the static analysis of XPath
    • 48
    • PDF
    A System for the Static Analysis of XPath
    • 3
    Comparing XML Path Expressions
    Comparing XML path expressions
    • 1
    • PDF
    Logics for XML
    • 25
    • PDF
    Efficient static analysis of XML paths and types
    • 103
    • PDF


    Conditional XPath, the first order complete XPath dialect
    • 85
    • PDF
    Conditional XPath
    • 136
    On the power of tree-walking automata
    • 36
    • PDF
    First Order Paths in Ordered Trees
    • 59
    • PDF
    Extensible Markup Language (XML)
    • 5,508
    • PDF
    Variable free reasoning on finite trees
    • 11
    XML Path Language (XPath) Version 1.0
    • 1,921
    • PDF