PDL for ordered trees

Journal of Applied Non-Classical Logics 15 (2):115-135 (2005)
  Copy   BIBTEX

Abstract

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 the language. This renewed interest comes with a special focus on complexity and expressivity aspects of the language, aspects that have so far largely been ignored. We survey and derive complexity results, and spend most of the paper on the most important open question concerning the language: what is its expressive power? We approach this question from two angles: Which first-order properties can be expressed? And which second-order properties? While we are still some way from definitive answers to these questions, we discuss two first-order fragments of the PDL language for ordered trees, and show how the language can be used to express some typical (second-order) problems, like the boolean circuit and the frontier problem.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,271

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Game Trees For Decision Analysis.Prakash P. Shenoy - 1998 - Theory and Decision 44 (2):149-171.
Gregory trees, the continuum, and Martin's axiom.Kenneth Kunen & Dilip Raghavan - 2009 - Journal of Symbolic Logic 74 (2):712-720.
Canonical simplification of finite objects, well quasi-ordered by tree embedding.Thomas C. Brown - 1979 - Urbana, Ill.: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
Editors' Introduction.Patrick Blackburn & Maarten de Rijke - 1996 - Notre Dame Journal of Formal Logic 37 (2):161-166.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
Trees of life: a visual history of evolution.Theodore W. Pietsch - 2012 - Baltimore: Johns Hopkins University Press.

Analytics

Added to PP
2013-10-30

Downloads
119 (#146,501)

6 months
18 (#131,436)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Patrick Blackburn
Roskilde University

References found in this work

Modal Logic: Graph. Darst.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - New York: Cambridge University Press. Edited by Maarten de Rijke & Yde Venema.
Dynamic Logic.Lenore D. Zuck & David Harel - 1989 - Journal of Symbolic Logic 54 (4):1480.

View all 11 references / Add more references