Transformation Rules for Locally Stratified Constraint Logic Programs
Transformation Rules for Locally Stratified Constraint Logic Programs
复制标题
局部分层约束逻辑程序的转换规则
DOI：
10.1007/978-3-540-25951-0_10
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
M. Proietti
中科院分区：
文献类型：
--
作者：
F. Fioravanti;A. Pettorossi;M. Proietti
我们提出了一组带有否定的约束逻辑程序的转换规则。我们假设每个程序都是局部分层的，因此它有一个独特的完美模型。我们给出了充分的条件，确保所提出的转换规则集保留了程序的完美模型。我们的规则在某些方面扩展了文献中已经考虑的逻辑程序和约束逻辑程序的规则，特别是，它们包括用于展开关于否定文字的子句的规则。
We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. We give sufficient conditions which ensure that the proposed set of transformation rules preserves the perfect model of the programs. Our rules extend in some respects the rules for logic programs and constraint logic programs already considered in the literature and, in particular, they include a rule for unfolding a clause with respect to a negative literal.