Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446) - Image 1

£44.50

Springer Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446)

Name: Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446)
Brand: Springer
Price: 44.5 GBP
Availability: InStock

Architecture & Microprocessors

It has never been this cheap. We have no record of a lower price.

£45 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 71 days · 71 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 71 days • 1 price levels

Days at Price

Price Analysis

Most common price: £45 (71 days, 100.0%)

Price range: £45 - £45

Price levels: 1 different prices over 71 days

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3540528377
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 24 July 1990
Listed Since: 16 December 2006

Barcode

No barcode data available

Springer Termination Proofs for Logic Programs: 446 (Lecture Notes in Computer Science, 446)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Algebraic Approaches to Program Semantics (Monographs in Computer Science)

Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)

The Formal Semantics of Programming Languages: An Introduction (Foundations of Computing)

Programming with Higher-Order Logic

Logics for Computer Science: Classical and Non-Classical

Goal-Directed Proof Theory: 21 (Applied Logic Series, 21)

Lectures on the Logic of Computer Programming (CBMS-NSF Regional Conference Series in Applied Mathematics): 31 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 31)

Logic of Domains (Progress in Theoretical Computer Science)

Multiprocessor Execution of Logic Programs

Proof Theory and Automated Deduction: 6 (Applied Logic Series, 6)

Automated Deduction - A Basis for Applications Volume I Foundations - Calculi and Methods Volume II Systems and Implementation Techniques Volume III Applications: 9 (Applied Logic Series)

Cambridge University Press - Structural Proof Theory Book

Parallel and Distributed Logic Programming: Towards the Design of a Framework for the Next Generation Database Machines: 24 (Studies in Computational Intelligence, 24)

LOGIC: Lecture Notes for Philosophy, Mathematics, and Computer Science (Springer Undergraduate Texts in Philosophy)

Comparative Metric Semantics of Programming Languages: Nondeterminism and Recursion (Progress in Theoretical Computer Science)

Cambridge Logical Foundations of Proof Complexity Book

Solving Higher-Order Equations: From Logic to Programming (Progress in Theoretical Computer Science)

LOGIC PROGRAMMING THEORY PRACTICES A: Theory, Practices and Challenges (Computer Science, Technology and Applications)

Systems and Software Verification: Model-Checking Techniques and Tools

Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach (Princeton Series in Computer Science)

Specification and Verification of Multi-agent Systems

Prolog by Example: How to Learn, Teach and Use It (Symbolic Computation)

Computational Semantics with Functional Programming

A Defeasible Logic Programming-Based Framework to Support Argumentation in Semantic Web Applications (Springer Theses)