Redundant Argument Filtering of Logic Programs

Redundant Argument Filtering of Logic Programs (1996)

by Michael Leuschel , Morten Heine Sørensen

Venue:	Logic Program Synthesis and Transformation. Proceedings of LOPSTR’96, LNCS 1207
Citations:	40 - 17 self

Datum	Value	Source
TITLE	Redundant Argument Filtering of Logic Programs	SVM HeaderParse 0.1
AUTHOR NAME	Michael Leuschel	SVM HeaderParse 0.1
AUTHOR NAME	Morten Heine S��rensen	SVM HeaderParse 0.1
AUTHOR ADDR	; Celestijnenlaan 200A, B-3001, Heverlee, Belgium,; Science, University of Copenhagen,; Universitetsparken 1, DK-2100 Copenhagen, Denmark.	SVM HeaderParse 0.1
ABSTRACT	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 though 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 approximative notion. We conduct extensive experiments with our algorithms on mechanically generated programs illustrating the practical benefits of our approach. 1	SVM HeaderParse 0.1
CITATIONS	35 found	ParsCit 1.0