Skip to content
ISBN: 0262041421
ISBN13: 9780262041423

From Logic to Logic Programming

ISBN: 0262041421
ISBN13: 9780262041423
Formats

Conditions

Formats

Conditions

See all 1 editions

Book Overview

This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn- clause logics, together with an analysis of the semantic aspects of the method. It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.
Format:
Hardcover
Language:
English
ISBN:
0262041421
ISBN13:
9780262041423
Release Date:
January 1994
Publisher:
MIT Press
Length:
228 Pages
Weight:
1.25 lbs.
Dimensions:
0.7″ × 7.2″ × 9.4″
Age Range:
18 years and up
Grade Range:
Postsecondary and higher
ComputersComputers & Technology

More by Kees Doets

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.