Guide to Prolog Programming	© Roman Barták, 1998
Home	Previous | Next
Table of Contents

This page contains Table of Contents for On-line Guide to Prolog Programming. As you noticed surely, many chapters are still missing. Nevertheless, I include their titles so know what I would like to add to the Guide.

• Introduction
• Prolog in Examples
  tutorial part of the Guide
  • First Steps in Prolog
    • Genealogy Database
    • Representing Data Structures
    • Data Flow and Recursion
    • Recursion in Detail
    • Top Down vs. Bottom Up Computation
  • Prolog Data Structures
    terms, unification and operators
    • List Processing
      • Combinatorics
      • Sorting
      • Sets in Prolog
      • Generalized List Processor
    • Arithmetic Expressions
    • Boolean Expressions
    • Graphs in Prolog
      representation, coloring, search (including Dijkstra)
      • Generalized Algorithm for Graph Search
        based on sets of open & closed nodes, coloring, Dijkstra
      • Graph Library
  • Special features
    • Cut and if-then-else constructs
    • Negation
      Negation-as-Failure or Constructive Negation?
    • Working with database of clauses
      assert and retract operations
  • How does it work?
    some "difficult" features of Prolog
• Advanced Techniques
  • Meta-Programming
    • Meta-interpreters
    • Attributed variables
  • Compiling Prolog
    • BinWAM Compiler
  • Datalog
    simplified version of Prolog used as a database query language
  • Prolog and Constraints
    • CLP (Constraint Logic Programming)
    • CHR (Constraint Handling Rules)
• Frequently Asked Questions
• Implementations
  growing list of commercial and free Prolog implementations
• Resources
  books, journals, conferences and web links
• Test Zone
  test your Prolog programs here

---

See also:

• Additions and Corrections for list of changes in the guide.
• Home Page of the guide.

Designed and maintained by Roman Barták	Previous | Next