This PDF covers the
following topics related to Prolog : Introduction, How Do You Learn A
Programming Language, Defining your own procedures, Variables,
Tests, Returning results by instantiation, “Facts”, Simple tracing, Backtracking
in more detail, Summary so far, Circularity and loops.
The contents include:
Introduction, Knowledge Representation, Prolog’s Search Strategy, Unification, Recursion and Lists, The
Box Model of Execution, Programming Techniques and List Processing, Control and Negation,
Parsing in Prolog, Modifying the Search Space, Prolog Syntax, Operators, Advanced Features.
These
lecture notes introduce the declarative programming language Prolog. The
emphasis is on learning how to program, rather than on the theory of logic
programming. Topics covered includes: Prolog Syntax, Working with Lists, Working
with Numbers, Working with Operators, Backtracking, Cuts and Negation, Logic
Foundations of Prolog and Recursive Programming.
The purpose of this note is to evaluate the suitability of Prolog
in the implementation of a graphic tool for design and specification of Ada
programs.