Matching with Regular Constraints

机译：与常规约束匹配

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

We describe a sound, terminating, and complete matching algorithm for terms built over flexible arity function symbols and context, function, sequence, and individual variables. Context and sequence variables allow matching to move in term trees to arbitrary depth and breadth, respectively. The values of variables can be constrained by regular expressions which are not necessarily linear. We describe heuristics for optimization, and discuss applications.

机译：我们针对在灵活的arity函数符号以及上下文，函数，序列和单个变量上构建的术语描述一种声音，终结和完整的匹配算法。上下文和序列变量允许匹配项分别在术语树中移动到任意深度和宽度。变量的值可以受不一定是线性的正则表达式约束。我们描述了用于优化的启发式方法，并讨论了应用程序。

著录项

来源
《International Conference on Logic for Programming, Artificial Intelligence, and Reasoning(LPAR 2005); 20051202-06; Montego Bay(JM)》|2005年|P.215-229|共15页
会议地点 Montego Bay(JM)
作者
Temur Kutsia; Mircea Marin;
展开▼
作者单位

Research Institute for Symbolic Computation, Johannes Kepler University, A-4040 Linz, Austria;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类人工智能理论;
关键词

相似文献

外文文献
中文文献
专利

1. Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms [J] . Sebastian Bala Theory of computing systems . 2006,第1期

机译：常规语言匹配的复杂性以及常规开放术语之间的约束可满足性问题的其他可判定案例
2. Maximum Matching in Regular and Almost Regular Graphs [J] . Raphael Yuster Algorithmica . 2013,第1期

机译：正则和几乎正则图中的最大匹配
3. Smallest regular and almost regular triangle-free graphs without perfect matchings [J] . Lutz Volkmann Ars Combinatoria: An Australian-Canadian Journal of Combinatorics . 2013,第Null期

机译：最小的正则和几乎正则无三角形图，没有完美的匹配
4. Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms [C] . Sebastian Bala Annual Symposium on Theoretical Aspects of Computer Science(STACS 2004); 20040325-20040327; Montpellier; FR . 2004

机译：常规语言匹配和常规开放术语之间的约束可满足性问题的其他可判定情况
5. Beyond regular: Pattern matching with extended regular expressions. [D] . Carle, Benjamin. 2010

机译：超越正则：与扩展正则表达式匹配的模式。
6. Exploring efficient grouping algorithms in regular expression matching [O] . Chengcheng Xu, Jinshu Su, Shuhui Chen 2012

机译：在正则表达式匹配中探索有效的分组算法
7. Regular Expression Matching for Reconfigurable Constraint Repetition Inspection [O] . Miad Faezipour, Mehrdad Nourani, A. Background 2015

机译：可重构约束重复检验的正则表达式匹配
8. Learning SAS's Perl Regular Expression Matching the Easy Way: By Doing. [R] . Genovesi, P. 2015

机译：学习sas的perl正则表达式匹配简单方法：通过做。

Matching with Regular Constraints

摘要

著录项

相似文献

相关主题

期刊订阅