indexINTERACTIVE PROLOG GUIDE
© Roman Barták 1997


Table of Contents

Previous Chapter
(examples)

Next Chapter
(references)


LEARNING PROLOG VIA EXAMPLES

I designed this subsite to enable novices to Prolog to learn basics of this language. I use examples of "real" programs to show features of Prolog. The lessons start with trivial examples to learn basic program structures and methodology, and continue with more advanced programs which show how to implement algorithms in Prolog and how to solve problems using Prolog.

I welcome your comments and suggestions to this site.


TABLE OF CONTENTS (click on the title of chosen lesson to get there)

  1. Genealogy database (you first steps with Prolog)
  2. Data Structures (Basics-Dates example; Lists)
  3. Data Flow and Recursion (working with recursive data structures)
  4. Combinatorics (permutations, combinations, variations)
  5. Arithmetics Expressions (evaluation and compilation)
  6. Sorting (sorting algorithms)
  7. Terms and Operators (basic Prolog data structure)
  8. Sets (representation and operations)
  9. Graphs (representation, coloring, isomorfism, search)
  10. Meta-Programming (meta-interpreters etc.)
  11. How does it work? (some "difficult" features of Prolog)
  12. ??? (the further contents depends on your reactions)

If you cannot decide, start here.


Comment:
I optimize the pages for fast download so there are no bells and whistles.


Table of Contents

Previous Chapter
(examples)

Next Chapter
(references)


Last update 26nd December 1997
Designed and maintained by Roman Bartak
© December 1997