A general framework for automatic termination analysis of logic programs

N. Dershowitz, N. Lindenstrauss, Y. Sagiv, A. Serebrenik

    Research output: Contribution to journalArticleAcademicpeer-review

    49 Citations (Scopus)

    Abstract

    This paper describes a general framework for automatic termination analysis of logic programs, where we understand by "termination" the finiteness of the LD-tree constructed for the program and a given query. A general property of mappings from a certain subset of the branches of an infinite LD-tree into a finite set is proved. From this result several termination theorems are derived, by using different finite sets. The first two are formulated for the predicate dependency and atom dependency graphs. Then a general result for the case of the query-mapping pairs relevant to a program is proved (cf. [29, 21]). The correctness of the TermiLog system described in [22] follows from it. In this system it is not possible to prove termination for programs involving arithmetic predicates, since the usual order for the integers is not well-founded. A new method, which can be easily incorporated in TermiLog or similar systems, is presented, which makes it possible to prove termination for programs involving arithmetic predicates. It is based on combining a finite abstraction of the integers with the technique of the query-mapping pairs, and is essentially capable of dividing a termination proof into several cases, such that a simple termination function suffices for each case. Finally several possible extensions are outlined. Keywords: Termination of logic programs, Abstract interpretation, Constraints.
    Original languageEnglish
    Pages (from-to)117-156
    Number of pages40
    JournalApplicable Algebra in Engineering, Communication and Computing
    Volume12
    Issue number1-2
    DOIs
    Publication statusPublished - 2001

    Fingerprint Dive into the research topics of 'A general framework for automatic termination analysis of logic programs'. Together they form a unique fingerprint.

    Cite this