Termination proofs for logic programs /

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 compreh...

Full description

Bibliographic Details
Main Author: Plümer, Lutz
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin ; New York : Springer-Verlag, ©1990.
Series:Lecture notes in computer science ; 446.
Lecture notes in computer science. Lecture notes in artificial intelligence.
Subjects:
Online Access:Connect to the full text of this electronic book
Search Result 1
by Plümer, Lutz
Published 1990
Book