Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446) - Tapa blanda

Pl??mer, Lutz

 
9783540528371: Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446)
Tapa blanda
ISBN 10: 3540528377 ISBN 13: 9783540528371
Editorial: Springer, 2008

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2008
Idioma
Inglés
ISBN 10 
3540528377
ISBN 13 
9783540528371
Encuadernación
Tapa blanda
Número de páginas
156
Contacto del fabricante
ProductSafety@springernature.com
ProductSafety@springernature.com

Poststr. 9
Darmstadt
64293
Alemania

Otras ediciones populares con el mismo título

9780387528373: Termination Proofs for Logic Programs (Lecture Notes in Computer Science)

Edición Destacada

ISBN 10:  0387528377 ISBN 13:  9780387528373
Editorial: Springer-Verlag, 1990
Tapa blanda