Termination Proofs for Logic Programs (Paperback, 1990 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 446
Release date:	July 1990
First published:	1990
Authors:	Lutz Plumer
Dimensions:	235 x 155 x 8mm (L x W x T)
Format:	Paperback
Pages:	142
Edition:	1990 ed.
ISBN-13:	978-3-540-52837-1
Categories:	Books > Computing & IT > Computer programming > Programming languages > General Books > Computing & IT > Applications of computing > Artificial intelligence > General Promotions
LSN:	3-540-52837-7
Barcode:	9783540528371

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!