Name
Abstract | ||
|---|---|---|
We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of a given node. By contrast, the logic introduced in the present work can concisely express numerical bounds on any region, descendants or ancestors for instance. We prove that the logic is decidable in single exponential time even if the numerical constraints are in binary form. We also illustrate the usage of the logic in the description of numerical constraints on multi-directional path queries on XML documents. Furthermore, numerical restrictions on regular languages (XML schemas) can also be concisely described by the logic. This implies a characterization of decidable counting extensions of XPath queries and XML schemas. Moreover, as the logic is closed under negation, it can thus be used as an optimal reasoning framework for testing emptiness, containment and equivalence. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.2168/LMCS-10(2:10)2014 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | Field | DocType |
counting constraints,satisfiability,query reasoning,XML schemas | Discrete mathematics,Programming language,XML,Negation,Computer science,Description logic,Theoretical computer science,Decidability,XML schema,XPath,Tree structure,Regular language | Journal |
Volume | Issue | ISSN |
10 | 2 | 1860-5974 |
Citations | PageRank | References |
6 | 0.51 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Everardo Bárcenas | 1 | 23 | 9.15 |
| jesus lavalle | 2 | 10 | 2.32 |
| Maurizio Lenzerini | 3 | 9620 | 1522.63 |