Title: Sound and complete partial deduction with unfolding based on well-founded measures
Authors: Martens, Bern ×
De Schreye, Danny
Horvath, T #
Issue Date: Jan-1994
Publisher: Elsevier science bv
Series Title: Theoretical computer science vol:122 issue:1-2 pages:97-117
Abstract: We present a procedure for partial deduction of logic programs, based on an automatic unfolding algorithm which guarantees the construction of sensibly and strongly expanded, finite SLD-trees. We prove that the partial deduction procedure terminates for all definite logic programs and queries. We show that the resulting program satisfies important soundness and completeness criteria with respect to the original program, while retaining the essentially desired amount of specialisation.
ISSN: 0304-3975
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science