Counting Trees Along Multidirectional Regular Paths - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Counting Trees Along Multidirectional Regular Paths

Everardo Barcenas-Patino
  • Function : Author
  • PersonId : 857785
Pierre Genevès
Nabil Layaïda


We propose a tree logic capable of expressing simple cardinality constraints on the number of nodes selected by an arbitrarily deep regular path with backward navigation. Specifically, a sublogic of the alternation-free mu-calculus with converse for finite trees is extended with a counting operator in order to reason on the cardinality of node sets. Also, we developed a bottom-up tableau-based satisfiability-checking algorithm, which resulted to have the same complexity than the logic without the counting operator: a simple exponential in the size of a formula. This result can be seen as an extension of the so-called graded-modalities, which allows counting constraints only on immediate successors, with conditions on the number of nodes accessible by an arbitrary recursive and multidirectional path. This work generalizes the optimal complexity bound 2^O(n) where n is the length of the formula, shown by Geneves et al. in PLDI'07, for satisfiability of the logic extended with such counting constraints. Finally, we identify a decidable XPath fragment featuring cardinality constraints on paths with upward/downward recursive navigation, in the presence of XML types.
Fichier principal
Vignette du fichier
counting.pdf (233.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00358797 , version 1 (04-02-2009)


  • HAL Id : inria-00358797 , version 1


Everardo Barcenas-Patino, Pierre Genevès, Nabil Layaïda. Counting Trees Along Multidirectional Regular Paths. PLAN-X 2009, Jan 2009, Savannah, United States. ⟨inria-00358797⟩
252 View
142 Download


Gmail Facebook Twitter LinkedIn More