Automated reasoning on trees with cardinality constraints

Ismael Barcenas Patino 1
1 WAM - Web, adaptation and multimedia
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Arithmetical constraints are widely used in formal languages like regular expressions, tree grammars and paths. In XML they are used to impose bounds on the number of occurrences described by content models of schema languages (XML Schema, RelaxNG). In query languages (XPath, XQuery), they allow selecting nodes that have a bounded number of nodes reachable by a given path expression. Counting types and paths are thus natural extensions of their countless counterparts already regarded as the core constructs in XML languages and type systems. One of the biggest challenges in XML is to develop automated techniques for ensuring static-type safety and optimization techniques. To this end, there is a need to solve some basic reasoning tasks that involve constructions such as counting XML schemas and XPath expressions. Every compiler of XML programs will have to routinely solve problems such as type and path type- checking, for ensuring at compile time that invalid documents can never arise as the output of XML processing code. This thesis studies efficient reasoning frameworks able to express counting constraints on tree structures. It was recently shown that the mu-calculus, when extended with counting constraints on immediate successor nodes is undecid able over graphs. Here we show that, when interpreted over finite trees, the logic with counting constraints is decidable in single exponential time. Furthermore, this logic allows more general counting operators. For example, the logic can pose numerical constraints on number of ancestors or descendants. We also present linear translations of counting XPath expressions and XML schemas into the logic.
Document type :
Other [cs.OH]. Université Grenoble Alpes, 2011. English. <NNT : 2011GRENM004>
Liste complète des métadonnées
Contributor : Everardo Barcenas <>
Submitted on : Wednesday, March 23, 2011 - 3:12:37 PM
Last modification on : Friday, June 16, 2017 - 10:22:21 AM
Document(s) archivé(s) le : Friday, June 24, 2011 - 2:32:24 AM


  • HAL Id : tel-00569058, version 2



Ismael Barcenas Patino. Automated reasoning on trees with cardinality constraints. Other [cs.OH]. Université Grenoble Alpes, 2011. English. <NNT : 2011GRENM004>. <tel-00569058v2>



Record views


Document downloads