---

＜電子ブック＞
Termination Proofs for Logic Programs / by Lutz Plümer
(Lecture Notes in Artificial Intelligence. ISSN:29459141 ; 446)

版	1st ed. 1990.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1990
本文言語	英語
大きさ	VIII, 142 p : online resource
著者標目	*Plümer, Lutz author SpringerLink (Online service)
件　名	LCSH:Artificial intelligence LCSH:Compilers (Computer programs) LCSH:Software engineering LCSH:Computer science LCSH:Machine theory FREE:Artificial Intelligence FREE:Compilers and Interpreters FREE:Software Engineering FREE:Computer Science Logic and Foundations of Programming FREE:Formal Languages and Automata Theory
一般注記	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 HTTP:URL=https://doi.org/10.1007/3-540-52837-7

 類似資料