Optimal union-find in Constraint Handling Rules

TOM SCHRIJVERS; THOM FRUEHWIRTH

首页> 外文期刊>Theory and Practice of Logic Programming >Optimal union-find in Constraint Handling Rules

【24h】

Optimal union-find in Constraint Handling Rules

机译：约束处理规则中的最优联合发现

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

Constraint Handling Rules (CHR) is a committed-choice rule-based language that was originally intended for writing constraint solvers. In this paper we show that it is also possible to write the classic union-find algorithm and variants in CHR. The programs neither compromise in declarativeness nor efficiency. We study the time complexity of our programs: they match the almost-linear complexity of the best known imperative implementations. This fact is illustrated with experimental results.

机译：约束处理规则（CHR）是基于承诺选择规则的语言，最初旨在编写约束求解器。在本文中，我们证明了有可能在CHR中编写经典的联合查找算法和变体。这些程序既不影响声明性也不影响效率。我们研究程序的时间复杂度：它们与最著名的命令式实现的几乎线性的复杂度匹配。实验结果说明了这一事实。

著录项

来源
《Theory and Practice of Logic Programming》 |2006年第2期|p.213-224|共12页
作者
TOM SCHRIJVERS; THOM FRUEHWIRTH;
展开▼
作者单位

Department of Computer Science, K. U. Leuven, Belgium;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词
declarative algorithms; time complexity analysis; disjoint-set problem; union-find algorithm; constraint handling rules;

机译：声明性算法;时间复杂度分析;不交集问题;联合发现算法;约束处理规则;

相似文献

外文文献
中文文献
专利

1. Program Verification using Constraint Handling Rules and Array Constraint Generalizations [J] . De Angelis Emanuele, Pettorossi Alberto, Fioravanti Fabio, Fundamenta Informaticae . 2017,第1期

机译：使用约束处理规则和数组约束归纳进行程序验证
2. SOFT CONSTRAINT PROPAGATION AND SOLVING IN CONSTRAINT HANDLING RULES [J] . S. BISTARELLI, T. FRUEHWIRTH, M. MARTE, Computational Intelligence . 2004,第2期

机译：约束处理规则中的软件约束传播和求解
3. Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities [J] . LESLIE DE KONINCK Theory and Practice of Logic Programming . 2009,第2期

机译：逻辑算法符合CHR：具有规则优先级的约束处理规则的元复杂性结果
4. Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis [C] . Thom Fruehwirth International Conference on Logic Programming(ICLP 2005); 20051002-05; Sitges(ES) . 2005

机译：使用融合分析并行化联合查找约束处理规则
5. Analysis and Evaluation of Efficient Dispatching Rules for Multi-Device Handling Systems with Random Move Requests [D] . Eamrungroj, Chate. 2017

机译：具有随机移动请求的多设备处理系统的有效调度规则分析与评估
6. Optimal Synthesis of Four-Bar Linkage Path Generation through Evolutionary Computation with a Novel Constraint Handling Technique [O] . Suwin Sleesongsom, Sujin Bureerat 2018

机译：新型约束处理技术通过进化计算优化四连杆机构路径生成
7. Optimal union-find in Constraint Handling Rules [O] . Schrijvers Tom, Fruehwirth Thom 2006

机译：约束处理规则中的最优联合发现
8. Generalized Optimality Criteria for Frequency Constraints, Buckling Constraints and Bending Elements [R] . Fleury, C., Sander, G. 1979

机译：频率约束，屈曲约束和弯曲单元的广义最优性判据

Optimal union-find in Constraint Handling Rules

摘要

著录项

相似文献

相关主题

期刊订阅