约束逻辑程序部分演绎过程的研究

A PARTIAL DEDUCTION PROCEDURE FOR CONSTRAINT LOGIC PROGRAMS

约束逻辑程序（ＣＬＰ）的部分演绎是一个新兴的研究领域．本文提出一个新的基于程序变换的ＣＬＰ部分演绎的过程．该过程以程序一目标对（ＰＯ，Ｑ０）为输入，经过一系列程序变换后终止，输出结果程序一目标对（Ｐｎ，Ｑｎ）．该过程保证结果程序－目标对（Ｐｎ，Ｑｎ）和输入程序－目标对（ＰＯ，Ｑ０）计算等价，并且程序Ｐｎ解目标Ｑｎ比程序Ｐ０解目标Ｑ０效率更高．本文提出的方法已经实现，文中给出了一个ＣＬＰ（ＢＯＯＬ）程序部分演绎的运行实例．

Partial deduction of constraint logic programs is a newly emerging research field. This paper presents a new procedure of partial deduction of various constraint logic programming languages. The procedure inputs a program-goal pair (P0, Q0) and outputs the resultant program-goal pair (Pn, Qn). The procedure always terminates and the computational equivalence of the program-goal pairs (P0,Q0) and (Pn, Qn) is preserved. Pn is more efficient in solving Qn than P0 in solving Q0. A partial evaluator based on the procedure had been implemented, and a running example of partial deduction of a CLP(BOOL) program is given.