Under Consideration for Publication in Theory and Practice of Logic Programming Automatic Generation of Chr Constraint Solvers
Under Consideration for Publication in Theory and Practice of Logic Programming Automatic Generation of Chr Constraint Solvers
复制标题
正在考虑在逻辑编程理论与实践中发表 Chr 约束求解器的自动生成
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
C. Rigotti
中科院分区：
文献类型：
--
作者：
Slim Abdennadher;C. Rigotti
在本文中，我们提出了一个在给定约束逻辑规范的情况下自动生成 CHR 求解器的框架。这种方法利用表格解析的强大功能进行约束逻辑编程，以检查规则的有效性。在已经提出了自动生成约束求解器的不同方法的情况下，我们的方法能够生成更具表现力的规则（甚至是递归和分裂规则），可以直接用作 CHR 求解器。
In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules., where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.