Termination Proofs for Logic Programs by LUTZ PLÜMERTermination Proofs for Logic Programs by LUTZ PLÜMER

Termination Proofs for Logic Programs


Paperback | July 24, 1990

Pricing and Purchase Info

$104.20 online 
$116.95 list price save 10%
Earn 521 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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.
Title:Termination Proofs for Logic ProgramsFormat:PaperbackDimensions:150 pages, 9.25 × 6.1 × 0.68 inPublished:July 24, 1990Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540528377

ISBN - 13:9783540528371

Look for similar items by category: