Termination Proofs for Logic Programs [electronic resource] / by Lutz Plümer.
Material type: TextSeries: Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence ; 446Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1990Description: VIII, 142 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540471639Subject(s): Computer science | Software engineering | Logic design | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Software Engineering | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK5991 |
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.
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.
There are no comments on this title.