Speedup of Logic Programs by Binarization and Partial Deduction

Details Speedup of Logic Programs by Binarization and Partial Deduction Speedup of Logic Programs by Binarization and Partial Deduction

2003-12-15

arxiv.org/abs/cs/0312026v1

Computer Science

Programming Languages

15 pages; to appear in Theory and Practice of Logic Programming

Scientific paper

Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given.

Affiliated with

Also associated with

No associations

Rating

Speedup of Logic Programs by Binarization and Partial Deduction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Speedup of Logic Programs by Binarization and Partial Deduction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speedup of Logic Programs by Binarization and Partial Deduction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-102297