Buch, Englisch, 142 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 248 g
Buch, Englisch, 142 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 248 g
Reihe: Lecture Notes in Artificial Intelligence
ISBN: 978-3-540-52837-1
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
Weitere Infos & Material
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.
