Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering Non-transformational Termination Analysis of Logic Programs, Based on General Term-ordering

Abstract

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in trans-formational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics