Argument reduction by factoring

J. F. Naughton*, R. Ramakrishnana, Y. Sagiv, J. D. Ullman

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We identify a useful property of a program with respect to a predicate, calledfactoring. While we prove that detecting factorability is undecidable in general, we show that for a large class of programs, the program obtained by applying the Magic Sets transformation is factorable with respect to the recursive predicate. When the factoring property holds, a simple optimization of the program generated by the Magic Sets transformation results in a new program that is never less efficient than the Magic Sets program and is often dramatically more efficient, due to the reduction of the arity of the recursive predicate. We show that the concept of factoring generalizes some previously identified special cases of recursions, including separable recursions and right- and left-linear recursions.

Original languageEnglish
Pages (from-to)269-310
Number of pages42
JournalTheoretical Computer Science
Volume146
Issue number1-2
DOIs
StatePublished - 24 Jul 1995

Fingerprint

Dive into the research topics of 'Argument reduction by factoring'. Together they form a unique fingerprint.

Cite this