Abstract.
In transformational approaches to proving termination of logic programs, one transforms well-moded logic programs into (conditional) term rewriting systems. If termination of the rewrite system implies termination of the logic program, then termination techniques for rewrite systems can be employed for showing termination of logic programs. In this paper, we revisit the transformational approaches of Ganzinger & Waldmann, Chtourou & Rusinowitch, and Arts & Zantema. We will show the surprising result that all three methods are equally powerful. Moreover, it will be shown that the methods are complete for the class of simply moded logic programs. Our implementation uses the dependency pair technique in combination with polynomial interpretations to automatically prove termination of the resulting rewrite system. The empirical results show that the system can compete with sophisticated norm-based approaches to proving termination of logic programs.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Author information
Authors and Affiliations
Additional information
Received: October 4, 1999; revised version: May 12, 2000
Rights and permissions
About this article
Cite this article
Ohlebusch, E. Termination of Logic Programs: Transformational Methods Revisited. AAECC 12, 73–116 (2001). https://doi.org/10.1007/s002000100064
Issue Date:
DOI: https://doi.org/10.1007/s002000100064