AI 中文总结
研究广义高度约束绑定下无序项树模式的模式匹配问题，去除子端口对应绑定树叶子的限制，提出多项式时间匹配算法并实现，实验表明该方法有实际运行时间。
AI 中文摘要
无序树对于建模其中兄弟节点顺序无关紧要的层次结构很有用。为了表示此类数据中的灵活结构模式，具有高度约束变量的无序项树模式提供了一个自然框架。在之前的工作中，我们研究了在每个变量的子端口必须对应于绑定树的叶子的限制下，具有高度约束变量的有根无序项树模式的模式匹配问题。本文中，我们去除了此限制并推广了绑定模型，使得子端口可以对应于绑定树的任何非根顶点。在广义绑定下，我们制定了相应的成员问题并提出了一个多项式时间模式匹配算法。我们还实现了所提出的算法并进行了计算实验以评估其运行时间。实验结果表明所提出的方法实现了实际的运行时间。
英文摘要
Unordered trees are useful for modeling hierarchical structures in which the order among siblings is irrelevant. To represent flexible structural patterns in such data, unordered term tree patterns with height-constrained variables provide a natural framework. In our previous work, we studied the pattern matching problem for rooted unordered term tree patterns with height-constrained variables under the restriction that the child port of each variable must correspond to a leaf of a binding tree. In this paper, we remove this restriction and generalize the binding model so that the child port may correspond to any non-root vertex of a binding tree. Under generalized bindings, we formulate the corresponding membership problem and present a polynomial-time pattern matching algorithm. We also implement the proposed algorithm and conduct computational experiments to evaluate its running time. The experimental results show that the proposed method achieves practical running times.
Comments6 pages, 2 figures. Author preprint of a paper presented at ESKM 2026, IIAI-AAI 2026
