The Resource Termination proofs for logic programs, Lutz Plümer
Termination proofs for logic programs, Lutz Plümer
Resource Information
The item Termination proofs for logic programs, Lutz Plümer represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Termination proofs for logic programs, Lutz Plümer represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
 Summary
 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
 Language
 eng
 Extent
 1 online resource (viii, 142 pages)
 Contents

 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
 Isbn
 9783540471639
 Label
 Termination proofs for logic programs
 Title
 Termination proofs for logic programs
 Statement of responsibility
 Lutz Plümer
 Subject

 Artificial intelligence
 Artificial intelligence
 Automatisches Beweisverfahren
 Beweis
 Halteproblem
 Kontrolltheorie
 Logic programming
 Logic programming
 Logic programming
 Logisch programmeren
 Logische Programmierung
 Programmageneratoren
 Programmation logique
 Recursie
 Terminierung
 Artificial intelligence
 Language
 eng
 Summary
 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
 Action
 digitized
 Cataloging source
 OCLCE
 http://library.link/vocab/creatorName
 Plümer, Lutz
 Dewey number
 006.3
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA76.63
 LC item number
 .P58 1990
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 Series statement

 Lecture notes in computer science
 Lecture notes in artificial intelligence
 Series volume
 446.
 http://library.link/vocab/subjectName

 Logic programming
 Artificial intelligence
 Artificial intelligence
 Logic programming
 Logisch programmeren
 Programmageneratoren
 Recursie
 Logische Programmierung
 Terminierung
 Automatisches Beweisverfahren
 Halteproblem
 Kontrolltheorie
 Beweis
 Programmation logique
 Label
 Termination proofs for logic programs, Lutz Plümer
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references (pages 132139) and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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
 Control code
 645354511
 Dimensions
 unknown
 Extent
 1 online resource (viii, 142 pages)
 Form of item
 online
 Isbn
 9783540471639
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)645354511
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
 Label
 Termination proofs for logic programs, Lutz Plümer
 Antecedent source
 file reproduced from original
 Bibliography note
 Includes bibliographical references (pages 132139) and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 black and white
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 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
 Control code
 645354511
 Dimensions
 unknown
 Extent
 1 online resource (viii, 142 pages)
 Form of item
 online
 Isbn
 9783540471639
 Level of compression

 lossless
 lossy
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other physical details
 illustrations.
 Reformatting quality

 preservation
 access
 Reproduction note
 Electronic reproduction.
 Specific material designation
 remote
 System control number
 (OCoLC)645354511
 System details
 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Subject
 Artificial intelligence
 Artificial intelligence
 Automatisches Beweisverfahren
 Beweis
 Halteproblem
 Kontrolltheorie
 Logic programming
 Logic programming
 Logic programming
 Logisch programmeren
 Logische Programmierung
 Programmageneratoren
 Programmation logique
 Recursie
 Terminierung
 Artificial intelligence
Member of
 Lecture notes in computer science, 446
 Lecture notes in computer science, Lecture notes in artificial intelligence
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/TerminationproofsforlogicprogramsLutz/p4lD9jtFOwY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/TerminationproofsforlogicprogramsLutz/p4lD9jtFOwY/">Termination proofs for logic programs, Lutz Plümer</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Termination proofs for logic programs, Lutz Plümer
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/TerminationproofsforlogicprogramsLutz/p4lD9jtFOwY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/TerminationproofsforlogicprogramsLutz/p4lD9jtFOwY/">Termination proofs for logic programs, Lutz Plümer</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>