0% found this document useful (0 votes)

3 views79 pages

Lecture 4 - Introduction To Prolog

Chapter 4 of TEB 2023 introduces Prolog, a logic programming language that emphasizes declarative programming and recursion. It covers the history of Prolog, its syntax, and how to create knowledge bases using facts and rules. The chapter also discusses the use of Prolog in various applications, including AI and natural language processing.

Uploaded by

watif16207

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

3 views79 pages

Lecture 4 - Introduction To Prolog

Uploaded by

watif16207

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 79

TEB 2023: Artificial Intelligence

Chapter 4
Logic Programming with PROLOG
Today: Course Objectives

 Theory:
 Introduction to Prolog
 Facts, Rules and Queries
 Prolog Syntax

 Begin study of Prolog by defining:

 Terms, atoms, and variables
SWI Prolog
 Freely available Prolog interpreter

 Works with
 Linux,
 Windows, or
 Mac OS

 There are many more Prolog interpreters

 Not all are ISO compliant/free

Prolog
 "Programming with Logic“
 Very different from other programming languages:
 Declarative (not procedural)
 Recursion (no “for” or “while” loops)
 Relations (no functions)
 Unification
History of
Prolog

first Prolog interpreter by

Alain Colmerauer and
Philippe Roussel

1972 1977 1980 1980s/1990s 2005

History of
Prolog

implementation of DEC10
compiler by David H.D. Warren

1972 1977 1980 1980s/1990s 2005

History of
Prolog

Definite Clause Grammars

implementation by
Pereira and Warren

1972 1977 1980 1980s/1990s 2005

History of
Prolog

Prolog grows in popularity

especially in Japan and Europe

1972 1977 1980 1980s/1990s 2005

History of
Prolog
Prolog used to
program natural
language interface in
International Space
Station by NASA

1972 1977 1980 1980s/1990s 2005

History of
Prolog
Parts of IBM’s
Watson QA
supercomputer
were coded in
Prolog

1972 1977 1980 1980s/1990s 2011

Prolog and Web Applications
• prolog programs are often smaller
• smallness encourages well written code
• hence, easier to maintain

Source:

http://www.pathwayslms.com/swipltuts/
Basic idea of
Prolog
• Describe the situation of interest

• Ask a question

• Prolog:
– logically deduces new facts about the situation
we described
– gives us its deductions back as answers
Consequences

• Think declaratively, not procedurally

– Challenging
– Requires a different mindset

• High-level language
– Not as efficient as, say, C
– Good for rapid prototyping
– Useful in many AI applications (knowledge
representation, inference)
“Hello World”

• The most striking feature of Prolog for the newcomer is

how much simpler the programs look than in other
languages.

• All the user has to do in Prolog is to enter

write('Hello World!').

?- write('Hello World'),nl,write('Welcome to
Prolog'),nl.
Example : Knowledge Base

• There are only two components to any program: facts

and rules.
• The Prolog system reads in the program and simply
stores it. The user then types in a series of questions
(strictly known as queries), which the system answers
using the facts and rules available to it.
• This is a simple example, a series of queries and
answers about animals.
Example : Knowledge Base

The first three lines are facts, with the obvious

dog(fido). interpretation that fido, rover and henry are all dogs.
dog(rover). The next three facts say that felix, michael and jane are all
dog(henry). cats.The final line is a rule saying that anything (let us call
it X) is an animal if it is a dog.
cat(felix).
Having loaded the program, the user is then faced with the
cat(michael). two character symbol ?- which is called the system
prompt.
cat(jane).
animal(X):-dog(X). To check whether fido is a dog all that is necessary is to
type the query dog(fido) followed by a full stop and press
the 'return' key, which indicates to the system that a
response is needed

Last line is a rule. The :- character (colon and hyphen) can

be read as 'if'. X is called a variable.
Example : Knowledge Base

?- dog(fido).
Yes

?-dog(jane).
No

?- dog(X).
X = fido ;
X = rover ;
X = henry
Example : Knowledge Base

?-halt. 'Exit from the Prolog system.'

/* Animals Program 1 */
Example : Knowledge Base

/* Animals Program 1 */
dog(fido).
cat(mary). dog(rover).
dog(tom). cat(harry).
dog(henry).
cat(bill). cat(steve).

?-cat(X),dog(Y).
Knowledge Base 1

woman(mia).
woman(jody).
woman(yolanda).
playsAirGuitar(jody).
party.
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
playsAirGuitar(jody).
party.

?-
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
playsAirGuitar(jody).
party.

?- woman(mia).
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
playsAirGuitar(jody).
party.

?- woman(mia).
yes
?-
Knowledge Base 1