Termination Proofs for Logic Programs Image close
Termination Proofs for Logic Programs by Lutz Plumer
Termination Proofs for Logic Programs by Lutz Plumer
Show Hide Adult Content
Termination Proofs for Logic Programs close

Computers & Internet Books:

Home  
Books  
Computers & Internet  
Computer Programming  
Programming languages

Termination Proofs for Logic Programs

Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$150.00
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley
Free Delivery with Primate
Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $37.50 with Afterpay Learn more

6 weekly interest-free payments of $25.00 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 25 Jun - 5 Jul using International Courier

Explore more Lecture Notes in Computer Science,

See all products in this series

Fast, Low-resource, and Accurate Organ and Pan-cancer Segmentation in Abdomen CT
$200.00
Fast, Low-resource, and Accurate Organ and Pan-cancer Segmentation in...
Paperback / softback
Pre-order - out 14 Jul 2024
Directions in Human Factors for Interactive Systems by Henry Ledgard
$140.00
Directions in Human Factors for Interactive Systems
by Henry Ledgard ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Processes, Terms and Cycles: Steps on the Road to Infinity
$321.00
Processes, Terms and Cycles: Steps on the Road to Infinity
Paperback / softback
Available - Usually ships in 3-4 weeks
Functional and Constraint Logic Programming
$150.00
Functional and Constraint Logic Programming
Paperback / softback
Available - Usually ships in 3-4 weeks
Database and Expert Systems Applications
$238.00
Database and Expert Systems Applications
Paperback / softback
Available - Usually ships in 3-4 weeks
Computational Science and Its Applications – ICCSA 2020
$289.00
Computational Science and Its Applications – ICCSA 2020
Paperback / softback
Available - Usually ships in 3-4 weeks
The Semantic Web: ESWC 2019 Satellite Events
$150.00
The Semantic Web: ESWC 2019 Satellite Events
Paperback / softback
Available - Usually ships in 3-4 weeks
Advanced Information Systems Engineering
$150.00
Advanced Information Systems Engineering
Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithmic Game Theory
$263.00
Algorithmic Game Theory
Paperback / softback
Available - Usually ships in 3-4 weeks
Database Systems for Advanced Applications
$314.00
Database Systems for Advanced Applications
Paperback / softback
Available - Usually ships in 3-4 weeks
Pattern Recognition. ICPR International Workshops and Challenges
$289.00
Pattern Recognition. ICPR International Workshops and Challenges
Paperback / softback
Available - Usually ships in 3-4 weeks
Computer Vision – ECCV 2022
$314.00
Computer Vision – ECCV 2022
Paperback / softback
Available - Usually ships in 3-4 weeks
Chatbot Research and Design
$188.00
Chatbot Research and Design
Paperback / softback
Available - Usually ships in 3-4 weeks
Learning and Intelligent Optimization
$152.00
Learning and Intelligent Optimization
Paperback / softback
Available - Usually ships in 3-4 weeks
Computational Data and Social Networks
$150.00
Computational Data and Social Networks
Paperback / softback
Available - Usually ships in 3-4 weeks
Collaboration Technologies and Social Computing
$175.00
Collaboration Technologies and Social Computing
Paperback / softback
Available - Usually ships in 3-4 weeks

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.
Release date NZ
July 24th, 1990
Author
Audiences
  • Postgraduate, Research & Scholarly
  • Professional & Vocational
  • Undergraduate
Illustrations
VIII, 142 p.
Pages
142
Dimensions
155x235x8
ISBN-13
9783540528371
Product ID
2836174

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Computers & Internet >
Computer Programming >
Programming languages
Books >
Computers & Internet >
Computer Applications >
Artificial intelligence
Books >
Computers & Internet >
Computer programming / software development >
Programming & scripting languages: general
Books >
Computers & Internet >
Computer science >
Artificial intelligence