基于CHR的已知弧一致性的实现
A CHR-based Implementation of Known Arc-Consistency
摘要：
在经典的CLP（FD）系统中，变量的域在约束传播过程的开始是完全已知的。然而，在与外部环境交互的系统中，在约束传播开始之前获取变量的整个域可能导致计算时间的浪费，或者甚至导致所获取的数据在使用时过时。对于这样的情况，交互式约束满足问题（ICSP）模型已经被提出作为CSP模型的扩展，以使得即使在域不完全已知时也可以开始约束传播，仅在必要时执行域元素的获取，并且不需要在每次获取之后重新开始传播。在本文中，我们将展示如何求解器的两个排序CLP语言，在以前的工作中定义，表达ICSP，已实施的约束处理规则（约束处理规则）语言，声明性语言特别适合于高层次的约束求解器的实现。
英文摘要：
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external environment, acquiring the whole domains of variables before the beginning of constraint propagation may cause waste of computation time, or even obsolescence of the acquired data at the time of use. For such cases, the Interactive Constraint Satisfaction Problem (ICSP) model has been proposed as an extension of the CSP model, to make it possible to start constraint propagation even when domains are not fully known, performing acquisition of domain elements only when necessary, and without the need for restarting the propagation after every acquisition. In this paper, we show how a solver for the two sorted CLP language, defined in previous work, to express ICSPs, has been implemented in the Constraint Handling Rules (CHR) language, a declarative language particularly suitable for high level implementation of constraint solvers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
