Termination proofs of well-moded logic programs via conditional rewrite systems

Harald Ganzinger and Uwe Waldmann

In Michaël Rusinowitch and Jean-Luc Rémy, editors, Conditional Term Rewriting Systems, Third International Workshop, LNCS 656, pages 430-437, Pont-à-Mousson, France, July 8-10, 1992. Springer-Verlag.

Abstract: In this paper, it is shown that a translation from logic programs to conditional rewrite rules can be used in a straightforward way to check (semi-automatically) whether a program is terminating under the prolog selection rule.


Previous | Up | Next
Uwe Waldmann <uwe@mpi-inf.mpg.de>, 2003-02-06.
Imprint | Data Protection