Title: Non-transformational termination analysis of logic programs, based on general term-orderings
Authors: Serebrenik, Alexander ×
De Schreye, Danny #
Issue Date: 2001
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2042 pages:69-85
Conference: 10th International Workshop on Logic Based Program Synthesis and Transformation location:London, United Kingdom date:July 24-28, 2000
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 transformational approaches to logic program termination analysis, but that we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general term-orderings, and show how they axe equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple term-orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together.
Description: Logic Based Program Synthesis and Transformation 10th International Workshop, Selected Papers
ISBN: 3-540-42127-0
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
35327.pdf Published 229KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science