By Topic

An automatic partial deduction system for constraint logic programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tao, Y. ; Dept. of Comput. Sci., Wayne State Univ., Detroit, MI, USA ; Grosky, William I. ; Chunnian Liu

Presents a new procedure of partial deduction of various constraint logic programs. The procedure takes a program-goal pair (P 0, Q0) as input and outputs a 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. Our procedure is based on the idea of program transformation, using transformation rules such as unfolding, constraint simplification, code deletion with respect to a goal, introduction of a newly defined clause, and folding. We have implemented the procedure in an integrated partial deduction system, which can work with Prolog, CLP(Bool), and CLP(R) programs. Our results are compared with those resulting from other partial deduction methods, and it is shown that our method generates more succinct and efficient resultant programs in general

Published in:

Tools with Artificial Intelligence, 1997. Proceedings., Ninth IEEE International Conference on

Date of Conference:

3-8 Nov 1997