PDL for ordered trees
@article{Afanasiev2005PDLFO, 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}, year={2005}, volume={15}, pages={115 - 135} }
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
Topics from this paper
71 Citations
References
SHOWING 1-10 OF 64 REFERENCES
Expressive and efficient pattern languages for tree-structured data (extended abstract)
- Computer Science
- PODS '00
- 2000
- 84
Monadic datalog and the expressive power of languages for web information extraction
- Computer Science
- PODS '02
- 2002
- 101
- PDF