|
|
|
|
| LEADER |
02370nmm a2200373 u 4500 |
| 001 |
EB000657678 |
| 003 |
EBX01000000000000000510760 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540471639
|
| 100 |
1 |
|
|a Plümer, Lutz
|
| 245 |
0 |
0 |
|a Termination Proofs for Logic Programs
|h Elektronische Ressource
|c by Lutz Plümer
|
| 250 |
|
|
|a 1st ed. 1990
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1990, 1990
|
| 300 |
|
|
|a VIII, 142 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Software engineering
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Software Engineering
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/3-540-52837-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-52837-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 006.3
|
| 520 |
|
|
|a 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
|