PDL for ordered trees - Archive ouverte HAL Access content directly
Journal Articles Journal of Applied Non-Classical Logics Year : 2005

PDL for ordered trees

Loredana Afanasiev
  • Function : Author
Ioanna Dimitriou
  • Function : Author
Evan Goris
  • Function : Author
Maarten Marx
  • Function : Author
Maarten Rijke
  • Function : Author

Abstract

This paper investigates the complexity and expressive power of a language of propositional dynamic logic proposed by Marcus Kracht. The language has four basic programs, corresponding to the child, parent, and left- and right- sibling relations in trees. The paper concentrates on expressivity issues. In particular, it investigates which first-order and second-order properties the language can express.
Not file

Dates and versions

inria-00001206 , version 1 (05-04-2006)

Identifiers

  • HAL Id : inria-00001206 , version 1

Cite

Loredana Afanasiev, Patrick Blackburn, Ioanna Dimitriou, Bertrand Gaiffe, Evan Goris, et al.. PDL for ordered trees. Journal of Applied Non-Classical Logics, 2005, 15 (2), pp.115--135. ⟨inria-00001206⟩
121 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More