Title: Acceptability with general orderings
Authors: De Schreye, Danny ×
Serebrenik, Alexander #
Issue Date: 2002
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2407 pages:187-210
Abstract: We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but 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 orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants.
Description: Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
ISBN: 3-540-43959-5
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 Description Status SizeFormat
39478.pdf Published 261KbAdobe PDFView/Open


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

© Web of science