Modular Acyclicity and Tail Recursion in Logic Programs

@inproceedings{Ross1991ModularAA,
  title={Modular Acyclicity and Tail Recursion in Logic Programs},
  author={Kenneth A. Ross},
  booktitle={PODS},
  year={1991}
}
In this paper we consider two problems. The first is related to the question of acyclicity, i.e., the absence of positive and negative loops. In the absence of loops, some desirable semantic properties hold, and certain program optimizations become possible. The second problem is related to the question of tail-recursion elimination for logic programs. By not representing intermediate results of a bottomup computation, substantial savings over magic sets can be realized. In Section 2 we… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…