| Home > Publications > Reports > Informatics (CW) |
CW 243
M. Leuschel, M.H. Sorensen
Redundant argument filtering of logic programs
Abstract
This paper is concerned with the problem of removing, from a given logic program, redundant arguments. These are arguments which can be removed without affecting correctness. Most program specialisation techniques, even through they perform argument filtering and redundant clause removal, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient residual programs. We formalise the notion of a redundant argument and show that one cannot decide effectively whether a given argument is redundant. We then give a safe, effective approximation of the notion of a redundant argument and describe several simple and efficient algorithms calculating based on the approximation notion.
report.pdf / mailto: M. Leuschel