Lec07 AI Introduction To Prolog

Prolog:
Programming in Logic
with some mention of Datalog and

Constraint Logic Programming
600.325/425 Declarative Methods

- J. Eisner 1
Artificial Intelligence
■Course and exercises web site

http://www2.kbs.uni-hannover.de/ki.html
■About the AI exercises (Prolog)
❑ Taught in English
❑ Thursdays morning 11:00-11:45
© Patrick Blackburn,
Johan Bos & Kristina
Striegnitz
Artificial Intelligence
Introduction to Prolog
■Exercises Teaching Material
❑ Learn Prolog Now! http://www.learnprolognow.org
❑ SWI Prolog interpreter http://www.swi-prolog.org/
Striegnitz
The original declarative
programming
■
language
Courses in programming languages …
❑ Prolog is always the declarative language they teach.
❑ (imperative, functional, object-oriented, declarative)
■ Alain Colmeraeur & Philippe Roussel, 1971-1973

❑ With help from theorem proving folks such as Robert Kowalski
❑ Original project: Type in French statements & questions
■ Computer needed NLP and deductive reasoning
❑ Efficiency by David Warren, 1977 (compiler, virtual machine)
❑ Colmerauer & Roussel wrote 20 years later:
“Prolog is so simple that one has the sense that sooner or
later someone had to discover it … that period of our lives
remains one of the happiest in our memories.
❑ “We have had the pleasure of recalling it for this paper over
almonds accompanied by a dry martini.”
- J. Eisner 4
SWI Prolog
■Freely available Prolog interpreter

■Works with
❑ Linux,
❑ Windows, or
❑ Mac OS
■There are many more Prolog interpreters
■Not all are ISO compliant
Striegnitz
Distributions of Prolog
■ Most common free Prolog implementation is SWI Prolog.

❑ Very nice, though faster ones are for sale (e.g., SICSTUS Prolog).
■ To run Prolog, you can just run ECLiPSe!
❑ ECLiPSe is a perfectly good Prolog implementation,
although so far we’ve concentrated only on its “extra” features.
http://www.swi-prolog.org/ http://eclipseclp.org/

- J. Eisner 6
Aim of this lecture
■Give some simple examples of Prolog programs

■Discuss the three basic constructs in Prolog:
❑ Facts
❑ Rules
❑ Queries
■Introduce other concepts, such as
❑ the role of logic
❑ unification with the help of variables
■Begin the systematic study of Prolog by defining
terms, atoms, and variables
Striegnitz
Prolog
■"Programming with Logic"

■Declarative
■Very different from other (procedural)
programming languages
■Good for knowledge-rich tasks
Striegnitz
History of Prolog
first Prolog interpreter by

Colmerauer and Roussel
1972 1977 1980 1980s/1990s 2005
Striegnitz
History of Prolog
implementation of DEC10
compiler by Warren
1972 1977 1980 1980s/1990s 2005
Striegnitz
History of Prolog
Definite Clause Grammars

implementation by Pereira and
Warren
1972 1977 1980 1980s/1990s 2005
Striegnitz
History of Prolog
Prolog grows in popularity especially in
Europe and Japan
1972 1977 1980 1980s/1990s 2005
Striegnitz
History of Prolog
Prolog used to program
natural language interface
in International Space
Station by NASA
1972 1977 1980 1980s/1990s 2005
Striegnitz
Basic idea of Prolog
■Describe the situation of interest

■Ask a question
■Prolog logically deduces new facts about the
situation we described
■Prolog gives us its deductions back as
answers
Striegnitz
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
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
playsAirGuitar(jody).
party.
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- woman(mia).
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- woman(mia).
yes
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- woman(mia).
yes
?- playsAirGuitar(jody).
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- woman(mia).
yes
yes
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- woman(mia).
yes
yes
?- playsAirGuitar(mia).
no
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- tattoed(jody).
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- tattoed(jody).
no
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- tattoed(jody).
ERROR: predicate tattoed/1 not defined.
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- party.
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- party.
yes
?-
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- rockConcert.
Striegnitz
Knowledge Base 1
woman(mia).
woman(jody).
woman(yolanda).
party.
?- rockConcert.
no
?-
Striegnitz
Knowledge Base 2
happy(yolanda).
listens2music(mia).
listens2music(yolanda):- happy(yolanda).
playsAirGuitar(mia):- listens2music(mia).
playsAirGuitar(yolanda):- listens2music(yolanda).
Striegnitz
Knowledge Base 2
fact
happy(yolanda).
listens2music(mia).
Striegnitz
Knowledge Base 2
fact
happy(yolanda).
fact
listens2music(mia).
Striegnitz
Knowledge Base 2
fact
happy(yolanda).
fact
listens2music(mia).
rule
Striegnitz
Knowledge Base 2
fact
happy(yolanda).
fact
listens2music(mia).
rule
rule
Striegnitz
Knowledge Base 2
fact
happy(yolanda).
fact
listens2music(mia).
rule
rule
rule
Striegnitz
Knowledge Base 2
happy(yolanda).
listens2music(mia).
head body
Striegnitz
Knowledge Base 2
happy(yolanda).
listens2music(mia).
?-
Striegnitz
Knowledge Base 2
happy(yolanda).
listens2music(mia).
yes
?-
Striegnitz
Knowledge Base 2
happy(yolanda).
listens2music(mia).
yes
?- playsAirGuitar(yolanda).
yes
Striegnitz
Clauses
happy(yolanda).
listens2music(mia).
There are five clauses in this knowledge base:

two facts, and three rules.
The end of a clause is marked with a full stop.
Striegnitz
Predicates
happy(yolanda).
listens2music(mia).
There are three predicates

in this knowledge base:
happy, listens2music, and playsAirGuitar
Striegnitz
Knowledge Base 3
happy(vincent).
listens2music(butch).
playsAirGuitar(vincent):- listens2music(vincent), happy(vincent).
playsAirGuitar(butch):- happy(butch).
playsAirGuitar(butch):- listens2music(butch).
Striegnitz
Expressing Conjunction
happy(vincent).
The comma “," expresses conjunction in Prolog
Striegnitz
Knowledge Base 3
happy(vincent).
?- playsAirGuitar(vincent).
no
?-
Striegnitz
Knowledge Base 3
happy(vincent).
?- playsAirGuitar(butch).
yes
?-
Striegnitz
Expressing Disjunction
happy(vincent).
happy(vincent).
playsAirGuitar(butch):- happy(butch); listens2music(butch).
Striegnitz
Prolog and Logic
■Clearly Prolog has something to do with logic

■Operators
❑ Implication :-
❑ Conjunction ,
❑ Disjunction ;
■Use of modus ponens
■Negation
Striegnitz
Knowledge Base 4
woman(mia).
woman(jody).
woman(yolanda).
loves(vincent, mia).
loves(marsellus, mia).
loves(pumpkin, honey_bunny).
loves(honey_bunny, pumpkin).
Striegnitz
Prolog Variables
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
Striegnitz
Variable Instantiation
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
X=mia
Striegnitz
Asking Alternatives
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
X=mia;
Striegnitz
Asking Alternatives
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
X=mia;
X=jody
Striegnitz
Asking Alternatives
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
X=mia;
X=jody;
X=yolanda
Striegnitz
Asking Alternatives
woman(mia).
woman(jody).
woman(yolanda).
?- woman(X).
X=mia;
X=jody;
X=yolanda;
© Patrick Blackburn, no
Striegnitz
Knowledge Base 4
woman(mia).
woman(jody).
woman(yolanda).
?- loves(marsellus,X), woman(X).
Striegnitz
Knowledge Base 4
woman(mia).
woman(jody).
woman(yolanda).
?- loves(marsellus,X), woman(X).
X=mia
yes
?-
Striegnitz
Knowledge Base 4
woman(mia).
woman(jody).
woman(yolanda).
?- loves(pumpkin,X), woman(X).
Striegnitz
Knowledge Base 4
woman(mia).
woman(jody).
woman(yolanda).
?- loves(pumpkin,X), woman(X).
no
?-
Striegnitz
Knowledge Base 5
loves(vincent,mia).
loves(marsellus,mia).
jealous(X,Y):- loves(X,Z), loves(Y,Z).
Striegnitz
Knowledge Base 5
loves(vincent,mia).
?- jealous(marsellus,W).
Striegnitz
Knowledge Base 5
loves(vincent,mia).
?- jealous(marsellus,W).
W=vincent
?-
Striegnitz
Prolog Syntax
■What exactly are facts, rules and queries

built out of?
Terms
Terms
Simple
SimpleTerms
Terms Complex
ComplexTerms
Terms
Constants
Constants Variables
Variables
Atoms
Atoms
Numbers
Numbers
Striegnitz
Atoms
■A sequence of characters of upper-case letters,

lower-case letters, digits, or underscore, starting
with a lowercase letter
● Examples: butch, big_kahuna_burger, playGuitar
■An arbitrary sequence of characters enclosed in

single quotes
● Examples: 'Vincent', 'Five dollar shake', '@$%'
■A sequence of special characters

● Examples: : , ; . :-
Striegnitz
Numbers
■Integers: 12, -34, 22342

■Floats: 34573.3234
Striegnitz
Variables
■A sequence of characters of upper-case

letters, lower-case letters, digits, or
underscore, starting with either an uppercase
letter or an underscore
■Examples:
X, Y, Variable, Vincent, _tag
Striegnitz
Complex Terms
■Atoms, numbers and variables are building

blocks for complex terms
■Complex terms are built out of a functor
directly followed by a sequence of arguments
■Arguments are put in round brackets,
separated by commas
■The functor must be an atom
Striegnitz
Examples of complex terms
■Examples we have seen before:

❑ playsAirGuitar(jody)
❑ loves(vincent, mia)
❑ jealous(marsellus, W)
■Complex terms inside complex terms:

❑ hide(X,father(father(father(butch))))
Striegnitz
Arity
■The number of arguments a complex term

has is called its arity
■Examples:
woman(mia) is a term with arity 1

loves(vincent,mia) has arity 2
father(father(butch)) arity 1
Striegnitz
Arity is important
■In Prolog you can define two predicates with

the same functor but with different arity
■Prolog would treat this as two different
predicates
■In Prolog documentation arity of a predicate
is usually indicated with the suffix "/" followed
by a number to indicate the arity
Striegnitz
Example of Arity
happy(yolanda).
listens2music(mia).
■This knowledge base defines

❑ happy/1
❑ listens2music/1
❑ playsAirGuitar/1
Striegnitz
Summary of this lecture
■Simple examples of Prolog programs

■Introduced three basic constructs in Prolog:
❑ Facts
❑ Rules
❑ Queries
■Discussed other concepts, such as
❑ the role of logic
❑ unification with the help of variables
■Definition of Prolog constructs:
terms, atoms, and variables
Striegnitz

Lec07 AI Introduction To Prolog

Cargado por

Información del documento

Título original

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

Lec07 AI Introduction To Prolog

Cargado por

Copyright:

Formatos disponibles

Prolog:

with some mention of Datalog and

600.325/425 Declarative Methods

■Course and exercises web site

■ Alain Colmeraeur & Philippe Roussel, 1971-1973

■Freely available Prolog interpreter

■ Most common free Prolog implementation is SWI Prolog.

600.325/425 Declarative Methods

■Give some simple examples of Prolog programs

■"Programming with Logic"

first Prolog interpreter by

1972 1977 1980 1980s/1990s 2005

1972 1977 1980 1980s/1990s 2005

Definite Clause Grammars

1972 1977 1980 1980s/1990s 2005

1972 1977 1980 1980s/1990s 2005

1972 1977 1980 1980s/1990s 2005

■Describe the situation of interest

■Think declaratively, not procedurally

There are five clauses in this knowledge base:

The end of a clause is marked with a full stop.

There are three predicates

The comma “," expresses conjunction in Prolog

■Clearly Prolog has something to do with logic

jealous(X,Y):- loves(X,Z), loves(Y,Z).

jealous(X,Y):- loves(X,Z), loves(Y,Z).

jealous(X,Y):- loves(X,Z), loves(Y,Z).

■What exactly are facts, rules and queries

■A sequence of characters of upper-case letters,

■An arbitrary sequence of characters enclosed in

■A sequence of special characters

■Integers: 12, -34, 22342

■A sequence of characters of upper-case

X, Y, Variable, Vincent, _tag

■Atoms, numbers and variables are building

■Examples we have seen before:

■Complex terms inside complex terms:

■The number of arguments a complex term

woman(mia) is a term with arity 1

■In Prolog you can define two predicates with

■This knowledge base defines

■Simple examples of Prolog programs

También podría gustarte