Abstract
Partial deduction (or evaluation) is an important issue in the research on logic programming. An essential ingredient in any partial deduction method is a good unfolding strategy. Indeed, finite, possibly incomplete, SLD-trees have to be built to serve as a basis for synthesising specialised clauses. It is essential that finite SLD-trees are constructed, and yet they should be non-trivial if we want the partial deduction to bring us any substantial gain. In previous work, we have shown how a general framework for devising terminating unfolding strategies can be based on well-founded measures ([1]) and we have demonstrated its use as a basic ingredient for partial deduction ([4]). Experiments with a prototype implementation show satisfactory behaviour for large classes of programs ([2]). However, in some cases, the generated SLD-trees, although finite, can sensibly be further expanded. This abstract briefly indicates some of the main issues. A full technical treatment with a particular stress on the development of completely automatic algorithms can be found in [3].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
