• DOI:10.3166/jancl.15.115-135
Corpus ID: 1979330

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}
}

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

View on Taylor & Francis

mashup2.science.uva.nl

Save to Library

Create Alert

Cite

Launch Research Feed