关于CFLP中约束域H、R与FD的协同
On the Cooperation of the Constraint Domains H, R and FD in CFLP
摘要：
本文提出了一种约束域协作的计算模型，并针对一个具有实际意义的特殊情况给出了一种实现方法。该计算模型支持声明式编程与懒惰和可能更高阶的功能，谓词，并配备了各自的求解器的不同约束域的合作，依赖于所谓的约束功能逻辑编程（CFLP）计划。该实现已开发的CFLP系统TOY的顶部，支持合作的三个域H，R和FD，提供平等和不平等的限制，在符号项，算术约束的实数，和有限域的限制，分别在整数。该计算模型已被证明是合理和完整的w.r.t.的声明性语义所提供的$CFLP$计划，而实现的系统已经过测试，一组基准，并表现出相当有效的行为相比，最密切相关的方法，我们知道。逻辑程序设计理论与实践（Theory and Practice of Logic Programming，TPLP）
英文摘要：
This paper presents a computational model for the cooperation of constraint domains and an implementation for a particular case of practical importance. The computational model supports declarative programming with lazy and possibly higher-order functions, predicates, and the cooperation of different constraint domains equipped with their respective solvers, relying on a so-called Constraint Functional Logic Programming (CFLP) scheme. The implementation has been developed on top of the CFLP system TOY, supporting the cooperation of the three domains H, R and FD, which supply equality and disequality constraints over symbolic terms, arithmetic constraints over the real numbers, and finite domain constraints over the integers, respectively. The computational model has been proved sound and complete w.r.t. the declarative semantics provided by the $CFLP$ scheme, while the implemented system has been tested with a set of benchmarks and shown to behave quite efficiently in comparison to the closest related approach we are aware of. To appear in Theory and Practice of Logic Programming (TPLP)
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
