Get the book as a 537KB gzipped pdf file using Type one fonts!

Get the book as a 367KB gzipped postscript file!

Get the book as a 1.6MB postscript file

**Paul Brna**

At the end of the course, the students should
have enough familiarity with ** Prolog**
to be able to pursue any undergraduate course which makes use
of ** Prolog**.

This is a rather ambitious undertaking for a course of only twelve lectures so the lectures are supplemented with exercises and small practical projects wherever possible.

*
The Prolog implementation used is SICStus Prolog which is closely
modelled on Quintus Prolog (SICS is the Swedish Institute of Computer Science).
The reference manual should also be available for consultation
[SICStus, 1988].
© Paul Brna 1988
*

- Contents
- List of Figures
- Preface
- Introduction
- Knowledge Representation
- Prolog's Search Strategy
- Unification, Recursion and Lists
- The Box Model of Execution
- Interlude: Practical Matters
- Programming Techniques and List Processing
- Control and Negation
- Parsing in Prolog
- Modifying the Search Space
- Prolog Syntax
- Another Interlude: Input/Output
- Operators
- Advanced Features
- Powerful Features
- Open Lists and Difference Lists
- Prolog Layout
- Prolog Style
- Prolog and Logic Programming
- What You Should Be Able To Do

- A Short Prolog Bibliography
- References
- Details of the SICStus Prolog Tracer
- Solutions and Comments on Exercises for Chapter 2 on Knowledge Representation
- Solutions and Comments on Exercises for Chapter 3 on Search
- Solutions and Comments on Exercises for Chapter 4 on Unification and Recursion
- Solutions and Comments on Exercises for Chapter 6 on Techniques
- Solutions and Comments on Exercises for Chapter 8 on Parsing
- Solutions and Comments on Exercises for Chapter9 on Extralogical Features
- Solutions and Comments on Exercises for Chapter 11 on Operators
- Solutions and Comments on Exercises for Chapter #advanced#6594>

Mon May 24 20:14:48 BST 1999