The Community for Technology Leaders
Green Image
Issue No. 01 - February (1995 vol. 7)
ISSN: 1041-4347
pp: 137-149
ABSTRACT
<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>
INDEX TERMS
Datalog program, chain rule program, linear program, fixpoint, semantics, rational languages and functions, linearization.
CITATION

J. Pin and I. Guessarian, "Linearizing Some Recursive Logic Programs," in IEEE Transactions on Knowledge & Data Engineering, vol. 7, no. , pp. 137-149, 1995.
doi:10.1109/69.368513
90 ms
(Ver 3.3 (11022016))