A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Linearizing some recursive logic programs
1995
IEEE Transactions on Knowledge and Data Engineering
We give in this paper a sufficient condition under which the least fixpoint of the equation X = a + f (X)X equals the least fixpoint of the equation X = a + f (a)X. 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 n ≥ 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
doi:10.1109/69.368513
fatcat:vkztqzhqrfey5fzdqqg64j7nja