Termination analysis of logic programs (Extended abstract)

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    Abstract

    Termination is well-known to be one of the most intriguing aspects of program verification. Since logic programs are Turing-complete, it follows by the undecidability of the halting problem that there exists no algorithm which, given an arbitrary logic program, decides whether the program terminates. However, one can propose both conditions that are equivalent to termination and their approximations that imply termination and can be verified automatically. This paper briefly discusses these kinds of conditions that were studied in [2].
    Original languageEnglish
    Title of host publicationProceedings of the 19th International Conference on Logic Programming (ICLP'03), 9-13 December 2003, Mumbai, India
    EditorsC. Palamidessi
    Place of PublicationBerlin
    PublisherSpringer
    Pages507-508
    ISBN (Print)3-540-20642-6
    DOIs
    Publication statusPublished - 2003

    Publication series

    NameLecture Notes in Computer Science
    Volume2916
    ISSN (Print)0302-9743

    Cite this