arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.5073cs.DB
收藏

关于树木的计数

On the Count of Trees

Everardo Barcenas, Pierre Geneves, Nabil Layaida, Alan Schmitt

摘要:

正则树文法和正则路径表达式构成了程序设计语言和类型系统中广泛使用的核心构造。然而,到目前为止,很少有研究框架的推理路径表达式中的节点基数约束发生沿路径的树。我们提出了一个逻辑能够表达沿路径,其中可能包括任意递归向前和向后导航的深度计数。计数扩展可以被看作是对直接后继节点进行计数的分级模态的推广。虽然组合的分级模态,名义,和逆模态产生不可判定的逻辑图,我们表明,这些功能可以结合在一个可判定的树逻辑,其主要功能可以决定在指数时间。我们的逻辑在否定下是封闭的,它可以用来决定可满足性,与常规类型有关的类型检查,包含或等价等查询上的典型问题。

英文摘要:

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions where node cardinality constraints occur along a path in a tree. We present a logic capable of expressing deep counting along paths which may include arbitrary recursive forward and backward navigation. The counting extensions can be seen as a generalization of graded modalities that count immediate successor nodes. While the combination of graded modalities, nominals, and inverse modalities yields undecidable logics over graphs, we show that these features can be combined in a decidable tree logic whose main features can be decided in exponential time. Our logic being closed under negation, it may be used to decide typical problems on XPath queries such as satisfiability, type checking with relation to regular types, containment, or equivalence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑