Matches in Harvard for { <http://id.lib.harvard.edu/aleph/002055773/catalog> ?p ?o. }
Showing items 1 to 27 of
27
with 100 items per page.
- catalog abstract ""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."--PUBLISHER'S WEBSITE.".
- catalog contributor b2954049.
- catalog created "c1990.".
- catalog date "1990".
- catalog date "c1990.".
- catalog dateCopyrighted "c1990.".
- catalog description ""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."--PUBLISHER'S WEBSITE.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "viii, 142 p. :".
- catalog hasFormat "Termination proofs for logic programs.".
- catalog identifier "0387528377 (Springer-Verlag New York Berlin Heidelberg)".
- catalog identifier "3540528377 (Springer-Verlag Berlin Heildelberg New York) :".
- catalog isFormatOf "Termination proofs for logic programs.".
- catalog isPartOf "Lecture notes in computer science ; 446. Lecture notes in artificial intelligence".
- catalog isPartOf "Lecture notes in computer science ; 446.".
- catalog isPartOf "Lecture notes in computer science. Lecture notes in artificial intelligence.".
- catalog issued "1990".
- catalog issued "c1990.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer-Verlag,".
- catalog relation "Termination proofs for logic programs.".
- catalog subject "006.3 20".
- catalog subject "Artificial intelligence.".
- catalog subject "Logic programming.".
- catalog subject "QA76.63 .P58 1990".
- catalog title "Termination proofs for logic programs / Lutz Plümer.".
- catalog type "text".