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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
