An Almost Perfect Abstraction Operatorfor Partial DeductionMichael Leuschel

@inproceedings{De1994AnAP,
  title={An Almost Perfect Abstraction Operatorfor Partial DeductionMichael Leuschel},
  author={Danny De and SchreyeK},
  year={1994}
}
  • Danny De, SchreyeK
  • Published 1994
A partial deduction strategy for logic programs usually uses an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are produced. Finding an abstraction operator which guarantees niteness and still does not loose relevant information (with respect to the partial deduction) is a diicult problem. In 4] and 7… CONTINUE READING