Artificial Intelligence Course
Sunday, 18 January 2009
Lists
›
The list is a simple data structure widely used in non-numeric programming. A list is a sequence of any number of items, such as ann, tennis...
Unification Rules
›
Unification rules A constant unifies only with itself. Two structures unify if and only if they have the same functor and the same number of...
Unification
›
How do we ask: ''what does Fred eat ?'‘ eats(fred,oranges). How do we ask: “what Fred eats” ? ?- eats(fred,what). But Prolog wil...
Monkey and Banana
›
A monkey is in a room. Suspended from the ceiling is a bunch of bananas, beyond the monkey's reach. In the corner of the room is a box. ...
Order of Clauses and Goals: Infinite Loops
›
Consider the following clause: P:-p. This means ‘p is true if p is true’. This is declaratively perfectly correct, but procedurally is quite...
Procedural Meaning
›
The procedural meaning specifies how Prolog answers questions. Input: a program and a goal list. Output: a success/failure indicator and an ...
Declerative Meaning
›
Declarative reading of the clause “P:-Q,R” are: P is true if Q and R are true. From Q and R follows P. Procedural readings of this clause ar...
›
Home
View web version