Termination Proofs for Logic Programs

Termination Proofs for Logic Programs by Lutz Plümer.

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

Saved in:
Bibliographic Details
Main Author: Plümer, Lutz (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1990.
Edition:1st ed. 1990.
Series:Lecture Notes in Artificial Intelligence ; 446
Springer eBook Collection.
Subjects:
Artificial intelligence.
Programming languages (Electronic computers).
Software engineering.
Computer logic.
Mathematical logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Login for hold information

‌

Click to view e-book

Online

Holdings details from Online
Call Number: E-Book
Status: Available

Similar Items