CDN$ 93.14
  • List Price: CDN$ 103.72
  • You Save: CDN$ 10.58 (10%)
In Stock.
Ships from and sold by Gift-wrap available.
Clause and Effect: Prolog... has been added to your Cart
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Clause and Effect: Prolog Programming for the Working Programmer Paperback – Oct 4 2013

See all 2 formats and editions Hide other formats and editions
Amazon Price
New from Used from
"Please retry"
CDN$ 93.14
CDN$ 39.38 CDN$ 55.35

Harry Potter and the Cursed Child
click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Product Details

  • Paperback: 143 pages
  • Publisher: Springer; 1997 edition (April 29 2003)
  • Language: English
  • ISBN-10: 354065237X
  • ISBN-13: 978-3540652373
  • ASIN: 3540629718
  • Product Dimensions: 15.5 x 0.9 x 23.5 cm
  • Shipping Weight: 299 g
  • Average Customer Review: Be the first to review this item
  • Amazon Bestsellers Rank: #2,613,748 in Books (See Top 100 in Books)
  •  Would you like to update product info, give feedback on images, or tell us about a lower price?

  • See Complete Table of Contents

Customer Reviews

There are no customer reviews yet on
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on (beta) HASH(0x998d2078) out of 5 stars 6 reviews
24 of 24 people found the following review helpful
HASH(0x99d9ec9c) out of 5 stars Serves its purpose well June 19 2001
By Dr. Lee D. Carlson - Published on
Format: Paperback
For those who have experience in logic programming, either with Prolog or some other language, such as Lisp, or even a high-level symbolic programming language like Mathematica or Maple, this book could serve as a first course or a summary of Prolog programming. Research in logic programming is still an active area, and the approach taken in logic programming languages seems more natural from the standpoint of mathematical (predicate) logic. The author, in this short book, gives the reader an appreciation of Prolog and the philosophy and constructions behind logic programming. Many examples are employed that illustrate how to code in Prolog and how useful it can be in real-world applications.
In the first chapter, the author gives some justification for programming in Prolog, such as its symbol manipulation capability, automatic backtracking, the view that data structures and programs are of the same form, and the relational form of clauses. The syntax of Prolog is then discussed, and examples given of the three kinds of terms in Prolog. Readers with some background in category theory will appreciate the discussion more, as the author does employ some of this in the discussion, for example the view of addition as being a functor of a term. Terms are drawn in tree form in this chapter and throughout the book. The author then characterizes a Prolog program as a set of procedures, with each defining a predicate, and consisting of one or more (Horn) clauses. Unification of terms is discussed as a basic operation that determines when two clauses can be made equivalent by a substitution of variables. The execution of a program is viewed as a querying of the clauses, and the goal or e nd of the program is a proof that the goal is true.
Data structures in Prolog are discussed in chapter 2 as generalizations of programs using compound terms instead of just constants and variables. Lists are defined and their syntax discussed, along with dot and bracket notation. The implementation of simple arithmetic in Prolog is discussed. Several effective examples are given to illustrate arithmetic and list manipulation in Prolog.
Mappings, which are relations between two data structures, are the topic of chapter 3, and the author gives many examples illustrating how it is used to compose Prolog programs and how they act an both lists and more general trees.
The built-in predicate "cut" is discussed in the next chapter as a predicate to allow backtracking control of the program. The author gives many examples illustrating the problems involved with the use of "cut".
Difference structures are discussed in chapter 5 as a tool to simplify and increase program efficiency. A generalization of the idea of an accumulator, they allow one to work with "holes" in data structures during actual program execution. A list for example, can be viewed as "open" with its elements known only up to a point. It can then be filled in with an empty or a proper list. A difference list, discussed in the chapter, is then a list represented as a pair of "front" and "back", with the back being variable.
Applications of term rewriting are given in chapter 6, with symbolic differentiation launching the discussion. This is the more popular example of what Prolog-type languages can do, and is usually the reason given for beginning the use of symbolic programming languages. The author also discussed matrix multiplication in this chapter.
The next two chapters discuss the representation and manipulation of logical circuits using Prolog, including shift registers and coding circuits. This is followed in chapter 9 by an interesting discussion on how to write a compiler in Prolog, with the author discussing compilation for a single-accumulator computer, a RISC machine, and a stack machine. This is followed in chapter 10 by an even more interesting discussion on how to write a Fast Fourier transform in Prolog.
The last chapter of the book discusses how to use higher-order functional programming techniques in Prolog. For individuals, like myself, who are convinced that functional and logic programming are the most effective programming paradigms, this chapter is very interesting reading. The author defines an evaluator written in Prolog for these higher-order functional programs. Functional programming views computation as a collection of function applications on an expression representing a particular problem, and these functions can then be viewed as arguments to other functions. The lambda calculus from mathematical logic serves as the foundation for functional programming, and the author reviews this quickly, along with the technique of currying, in order to obtain facilities for functional programming in Prolog. Although short, this chapter introduces the reader to a fascinating area, and helpful references are given at the end of the chapter.
11 of 11 people found the following review helpful
HASH(0x99d9eccc) out of 5 stars Ideal for a short course on Prolog April 25 2001
By A Customer - Published on
Format: Paperback
For years I've tried to find a short Prolog text for my Computer languages course. I cover Prolog in 4 weeks and so didn't want a huge 400+ page text. Clause and Effect comes in at about 1/2 inch thick. I've come to love this one for what it does. It introduces some basic topics, then includes a number of "worksheets" at the end of each chapter. It offers a "learning by doing" approach (the worksheets are short "lab exercises"). A word of warning - don't expect to learn everything about Prolog from this text. It does not go into the philosophy and theory of Prolog and logic programming. But for my needs it's perfect.
8 of 8 people found the following review helpful
HASH(0x99d9eea0) out of 5 stars The Little Prologer Dec 30 2006
By Michael Vanier - Published on
Format: Paperback
I really like this book. It serves roughly the same purpose for the Prolog language that "The Little Schemer" serves for Scheme. It presents the Prolog language through a series of examples (called "worksheets" here), each about a page long. In each example the author walks through the solution of some problem, discussing the issues that come up. Later in the book, the examples give way to larger "case studies" of five or ten pages each, in which a more substantial problem is tackled. In my opinion, this is a very effective way to teach a language like Prolog, and I now understand a lot about the language I didn't understand before. Prolog is one of those languages that can't be learned simply by memorizing new syntax and referring to what you already know, because its execution model (logic programming using unification and backtracking) is so drastically different from that of most other languages. Therefore, one needs to walk through a lot of examples slowly, and this is where "Clause and Effect" really shines. I was particularly impressed at how trivially easy it is to do symbolic algebra in Prolog; I've written programs of this type in Scheme, but the Prolog versions are much shorter and easier to understand.

This book is not perfect, however, and I can't in good faith give it five stars (though I really want to). There are a fair number of typos scattered through the text (the author has an errata sheet on his website). Most of these are obvious, but on occasion I had to spend a lot of time puzzling over whether some bit of code had a typo or not (most of the time, there was no typo; it was just my understanding that was deficient). When in doubt, entering the code into a Prolog interpreter works wonders; I really wish the author would make a zip file of all the code examples available for download. A more significant problem than the typos is that the author writes in a very condensed style and either doesn't explain the meaning of some critical terms at all (like tail recursion) or doesn't explain them well enough (like backtracking). Coming from a functional programming background, and having already read a book on Prolog, I could fill in the gaps without much trouble, but many readers will have a harder time than I did. For these readers, I recommend that they use this book as a complement to a book with a more extended discussion of the language; the author's book "Programming in Prolog" is a fine choice for this.

I think that all serious programmers owe it to themselves to learn about logic programming just to see how easy it makes some problems which are quite difficult to solve in more conventional languages (try writing a symbolic differentiation program in a single page of C++, for instance). I heartily recommend this book for this purpose; it will stretch your mind and make you a better programmer.
2 of 2 people found the following review helpful
HASH(0x99ab7504) out of 5 stars Ambivalent review Dec 5 2006
By Charlesbalpha - Published on
Format: Paperback Verified Purchase
I am of two minds about this book. On the one hand, it suggests surprisingly diverse applications of the language, some of which I never would have imagined, taking advantage of the language's unusual features. My main complaint is with the explicit source code, which is supplied without comments and where variables are often represented by obscure single letters rather than descriptive names, as would normally be the case with textbook examples. If you don't mind this shortcoming, I would recommend this book to anybody interested in Prolog.
HASH(0x99ab748c) out of 5 stars Get to speed on writing real-world Prolog March 29 2014
By Yakov Zaytsev - Published on
Format: Paperback Verified Purchase
Insightful-reading which can be accompanied by Algebra Of Programming by Bird & De Moor.

Clause and Effect delivers well on promise to get professional programer up to speed on writing practical Prolog.