A Logic You Can Count On - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2003

A Logic You Can Count On

Denis Lugiez
  • Fonction : Auteur
Charles Meyssonnier
  • Fonction : Auteur

Résumé

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.

Domaines

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

Dates et versions

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

Identifiants

  • HAL Id : inria-00071562 , version 1

Citer

Silvano Dal Zilio, Denis Lugiez, Charles Meyssonnier. A Logic You Can Count On. RR-5022, INRIA. 2003. ⟨inria-00071562⟩
135 Consultations
130 Téléchargements

Partager

Gmail Facebook X LinkedIn More