Title: A new approach to non-termination analysis of Logic Programs
Authors: Voets, Dean ×
De Schreye, Danny #
Issue Date: 14-Jul-2009
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:5649 pages:220-234
Conference: International Conference on Logic Programming (ICLP) edition:25 location:Pasadena, CA, USA date:14-17 July 2009
Abstract: In this paper, we present a new approach to non-termination analysis of logic programs, based on moded SLDNF-resolution. Moded SLDNF-resolution is a symbolic execution for moded goals, developed for termination prediction. To prove non-termination, we use a complete loop checker to create a finite symbolic derivation tree of a logic program for a moded query. Then, we check if this derivation tree contains an infinite loop, using a new non-termination condition. We implemented this approach and tested it on the benchmark from the Termination Competition of 2007. The results are very satisfactory: our tool is able to prove non-termination and construct non-terminating queries for all non-terminating benchmark programs, and thus, significantly improves on the results of the only other non-termination analyzer, NTI.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
fulltext.pdfMain article Published 551KbAdobe PDFView/Open


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

© Web of science