Evaluation of functional linear recursions: a compilation approach

Abstract A compilation approach is developed for the evaluation of functional linear recursions (linear recursions with function symbols) in deductive databases. A functional linear recursion is transformed to a function-free one by a function-predicate transformation and compiled into a highly regular compiled formula which can be analyzed and evaluated efficiently by the incorporation of finiteness, monotonicity and query constraints. Moreover, a chain-splitting technique is developed for the evaluation of functional linear recursions whose compiled chains consist of infinitely evaluable functions.