Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages. A technique for the automatic derivation of termination proofs is presented in detail. The discussion of several nontrivial examples illustrates its range of applicability. The approach is based on the concept of declarative semantics, and thus makes use of an important feature of logic programming.

Bibliographic Information

Book Title: Termination Proofs for Logic Programs
Authors: Lutz Plümer
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-52837-7
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1990
Softcover ISBN: 978-3-540-52837-1Published: 24 July 1990
eBook ISBN: 978-3-540-47163-9Published: 02 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 142
Topics: Artificial Intelligence, Programming Languages, Compilers, Interpreters, Software Engineering, Logics and Meanings of Programs, Mathematical Logic and Formal Languages

Publish with us

Policies and ethics

Termination Proofs for Logic Programs

Overview

Access this book

Other ways to access

Table of contents (9 chapters)

Front Matter

Back Matter

Keywords

About this book

Bibliographic Information

Publish with us

Search

Navigation