Title: Constrained partial deduction and the preservation of characteristic trees
Authors: Leuschel, M ×
De Schreye, Danny #
Issue Date: 1998
Publisher: Springer verlag
Series Title: New generation computing vol:16 issue:3 pages:283-342
Abstract: Partial deduction strategies for logic programs often use an abstraction operator to guarantee the finiteness of the set of goals for which partial deductions are produced. Finding an abstraction operator which guarantees finiteness and does not lose relevant information is a difficult problem. In earlier work Gallagher and Bruynooghe proposed to base the abstraction operator on characteristic paths and trees, which capture the structure of the generated incomplete SLDNF-tree for a given goal.
ISSN: 0288-3635
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
art%3A10.1007%2FBF03037483.pdf Published 3218KbAdobe PDFView/Open


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

© Web of science