Termination proofs for logic programs /
Plümer, Lutz.
Termination proofs for logic programs / Lutz Plümer. - 1 online resource (viii, 142 pages) : illustrations - Lecture notes in computer science ; Lecture notes in artificial intelligence 446. . - Lecture notes in computer science ; 446. Lecture notes in computer science. Lecture notes in artificial intelligence. .
Includes bibliographical references (pages 132-139) and index.
Basic notions -- Static program properties and transformations -- Terminating logic programs -- The problem of local variables -- And/or dataflow graphs -- A termination proof procedure -- Integration of unfolding techniques -- Conclusions.
Use copy
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.
Electronic reproduction.
[Place of publication not identified] :
HathiTrust Digital Library,
2010.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
http://purl.oclc.org/DLF/benchrepro0212
9783540471639 3540471634
Logic programming.
Artificial intelligence.
Artificial Intelligence
Programmation logique.
Intelligence artificielle.
artificial intelligence.
Artificial intelligence
Logic programming
Logische Programmierung
Terminierung
Automatisches Beweisverfahren
Halteproblem
Kontrolltheorie
Beweis
Logisch programmeren.
Programma-generatoren.
Recursie.
Programmation logique.
QA76.63 / .P58 1990
006.3
Termination proofs for logic programs / Lutz Plümer. - 1 online resource (viii, 142 pages) : illustrations - Lecture notes in computer science ; Lecture notes in artificial intelligence 446. . - Lecture notes in computer science ; 446. Lecture notes in computer science. Lecture notes in artificial intelligence. .
Includes bibliographical references (pages 132-139) and index.
Basic notions -- Static program properties and transformations -- Terminating logic programs -- The problem of local variables -- And/or dataflow graphs -- A termination proof procedure -- Integration of unfolding techniques -- Conclusions.
Use copy
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.
Electronic reproduction.
[Place of publication not identified] :
HathiTrust Digital Library,
2010.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
http://purl.oclc.org/DLF/benchrepro0212
9783540471639 3540471634
Logic programming.
Artificial intelligence.
Artificial Intelligence
Programmation logique.
Intelligence artificielle.
artificial intelligence.
Artificial intelligence
Logic programming
Logische Programmierung
Terminierung
Automatisches Beweisverfahren
Halteproblem
Kontrolltheorie
Beweis
Logisch programmeren.
Programma-generatoren.
Recursie.
Programmation logique.
QA76.63 / .P58 1990
006.3