This note
covers the following topics in prolog: Facts about prolog, query in Prolog
system, prolog Programs, Matching, Programming Style, Internal Representation,
The Bar Notation, Appending Lists, Arithmetic Expressions in Prolog, Matching
vs. Arithmetic Evaluation, Relations, Defining Operators, Backtracking, Cuts and
Negation.
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.
This note
covers the following topics in prolog: Facts about prolog, query in Prolog
system, prolog Programs, Matching, Programming Style, Internal Representation,
The Bar Notation, Appending Lists, Arithmetic Expressions in Prolog, Matching
vs. Arithmetic Evaluation, Relations, Defining Operators, Backtracking, Cuts and
Negation.
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.