Termination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach

Simple item page
dc.creatorShen, Yi-Dong
dc.creatorDe Schreye, Danny
dc.date2005-12-14
dc.date.accessioned2026-07-07T06:53:50Z
dc.date.available2026-07-07T06:53:50Z
dc.descriptionThe termination problem of a logic program can be addressed in either a static or a dynamic way. A static approach performs termination analysis at compile time, while a dynamic approach characterizes and tests termination of a logic program by applying a loop checking technique. In this paper, we present a novel dynamic approach to termination analysis for general logic programs with moded queries. We address several interesting questions, including how to formulate an SLDNF-derivation for a moded query, how to characterize an infinite SLDNF-derivation with a moded query, and how to apply a loop checking mechanism to cut infinite SLDNF-derivations for the purpose of termination analysis. The proposed approach is very powerful and useful. It can be used (1) to test if a logic program terminates for a given concrete or moded query, (2) to test if a logic program terminates for all concrete or moded queries, and (3) to find all (most general) concrete/moded queries that are most likely terminating (or non-terminating).
dc.description24 Pages
dc.identifierhttps://arxiv.org/abs/cs/0512055
dc.identifierhttp://arxiv.org/abs/cs/0512055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105730
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectD.1.6
dc.titleTermination Analysis of General Logic Programs for Moded Queries: A Dynamic Approach
dc.typetext

Files

Collections

arXiv