A Logic You Can Count On - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

A Logic You Can Count On

Denis Lugiez
  • Function : Author
Charles Meyssonnier
  • Function : Author


We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression language for semistructured data. The essence of this result is a surprising connection between formulas of the ambient logic and counting constraints on (nested) vectors of integers. Our proof method is based on a new class of tree automata for unranked, unordered trees, which may result in practical algorithms for deciding the satisfiability of a formula. A benefit of our approach is to naturally lead to an extension of the logic with recursive definitions, which is also decidable. Finally, we identify a simple syntactic restriction on formulas that improves the effectiveness of our algorithms on large examples.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5022.pdf (446.11 Ko) Télécharger le fichier

Dates and versions

inria-00071562 , version 1 (23-05-2006)


  • HAL Id : inria-00071562 , version 1


Silvano Dal Zilio, Denis Lugiez, Charles Meyssonnier. A Logic You Can Count On. RR-5022, INRIA. 2003. ⟨inria-00071562⟩
135 View
129 Download


Gmail Facebook Twitter LinkedIn More