{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:07:01Z","timestamp":1775056021968,"version":"3.50.1"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2014,6,16]],"date-time":"2014-06-16T00:00:00Z","timestamp":1402876800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We introduce a logical foundation to reason on tree structures with\nconstraints on the number of node occurrences. Related formalisms are limited\nto express occurrence constraints on particular tree regions, as for instance\nthe children of a given node. By contrast, the logic introduced in the present\nwork can concisely express numerical bounds on any region, descendants or\nancestors for instance. We prove that the logic is decidable in single\nexponential time even if the numerical constraints are in binary form. We also\nillustrate the usage of the logic in the description of numerical constraints\non multi-directional path queries on XML documents. Furthermore, numerical\nrestrictions on regular languages (XML schemas) can also be concisely described\nby the logic. This implies a characterization of decidable counting extensions\nof XPath queries and XML schemas. Moreover, as the logic is closed under\nnegation, it can thus be used as an optimal reasoning framework for testing\nemptiness, containment and equivalence.<\/jats:p>","DOI":"10.2168\/lmcs-10(2:10)2014","type":"journal-article","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T09:40:42Z","timestamp":1415958042000},"source":"Crossref","is-referenced-by-count":6,"title":["Global Numerical Constraints on Trees"],"prefix":"10.46298","volume":"Volume 10, Issue 2","author":[{"given":"Everardo","family":"B\u00e1rcenas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Lavalle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"902:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/985\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/985\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:00:42Z","timestamp":1681243242000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-10(2:10)2014","relation":{"is-same-as":[{"id-type":"arxiv","id":"1405.1295","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1405.1295","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"arxiv","id":"1607.03354","asserted-by":"subject"},{"id-type":"doi","id":"10.4204\/eptcs.218.1","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arxiv.1607.03354","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]},"article-number":"985"}}