Termination proofs for logic programs
Author(s)
Bibliographic Information
Termination proofs for logic programs
（Lecture notes in computer science, 446 . Lecture notes in artificial intelligence）
Springer-Verlag, c1990
- : gw
- : us
Available at / 62 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||44690062350
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:446901004350
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
Table of Contents
Basic notions.- Static program properties and transformations.- Terminating logic programs.- The problem of local variables.- And/or dataflow graphs.- A termination proof procedure.- Integration of unfolding techniques.- Conclusions.
by "Nielsen BookData"
