An Almost Perfect Abstraction Operator for Partial Deduction (1994)
| Citations: | 13 - 9 self |
BibTeX
@TECHREPORT{Leuschel94analmost,
author = {Michael Leuschel and Danny De Schreye},
title = {An Almost Perfect Abstraction Operator for Partial Deduction},
institution = {},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ion Operator for Partial Deduction Michael Leuschel and Danny De Schreye K.U. Leuven, Department of Computer Science Celestijnenlaan 200 A, B-3001 Heverlee, Belgium e-mail: fmichael,dannydg@cs.kuleuven.ac.be January 18, 1995 Abstract A partial deduction strategy for logic programs usually uses 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 still does not loose relevant information (with respect to the partial deduction) is a difficult problem. In [4] and [7] Gallagher and Bruynooghe proposed to base the abstraction operator on characteristic paths and trees. A characteristic tree captures the structure of the generated partial SLDNF-tree for a given goal, i.e. it captures the relevant information for partial deduction. The generation of more general atoms having the same characteristic tree would lead to an almost perfect abstraction operator. Unfortunate...
