Issue No.01 - February (1995 vol.7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.368513
<p><it>Abstract</it>—We give in this paper a sufficient condition under which the least fixpoint of the equation <it>X</it>=<it>a</it>+<it>f</it>(<it>X</it>)<it>X</it> equals the least fixpoint of the equation <it>X</it>=<it>a</it>+<it>f</it>(<it>a</it>)<it>X</it>. We then apply that condition to recursive logic programs containing chain rules: we translate it into a sufficient condition under which a recursive logic program containing <it>n</it>≥ 2 recursive calls in the bodies of the rules is equivalent to a linear program containing at most one recursive call in the bodies of the rules. We conclude with a discussion comparing our condition with the other approaches to linearization studied in the literature.</p>
Datalog program, chain rule program, linear program, fixpoint, semantics, rational languages and functions, linearization.
Irène Guessarian, "Linearizing Some Recursive Logic Programs", IEEE Transactions on Knowledge & Data Engineering, vol.7, no. 1, pp. 137-149, February 1995, doi:10.1109/69.368513