Cover Image

Termination proofs for logic programs /

Show other versions (1)

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:
Logic programming.
Artificial intelligence.
déconvolution.
PROTOS.
stationnarité.
démonstration théorème.
programmation assistée.
calcul prédicat.
récursion.
programmation en logique.
PROLOG.
Programmation logique.
Intelligence artificielle.
Logisch programmeren.
Programma-generatoren.
Recursie.
Logische Programmierung.
Terminierung (Informatik)
Automatisches Beweisverfahren.
Halteproblem.
Kontrolltheorie.
Beweis.
Electronic books.
Online Access:Connect to the full text of this electronic book

Internet

Connect to the full text of this electronic book

Available Online

Holdings details from Available Online
Call Number: QA76.63 .P58 1990
 
Call Number Status Get It
QA76.63 .P58 1990 Available