LECTURE 3 PROLOG Introduction Prolog program

LECTURE 3 PROLOG

Introduction • Prolog program consists of clauses which are facts and rules. • Predicate is the name given to the relation • likes(bill, tennis) arguments predicate name

Anonymous Variable • The anonymous variable ‘_’can be used in place of any other variable. It can’t be set to a value. • Goal: parent(Parent, _). • Finds all the parents • Anonymous variables can be used in facts. • owns(_, shoes). Everyone owns shoes • eats( _ ). Everyone eats

Constants start with a small letter. Variables start with a capital letter. /* Example CH 03 – 3 */ predicates likes(symbol, symbol) clauses likes(ellen, reading). likes(john, computers). likes(john, badminton). likes(leonard, badminton). likes(eric, swimming). likes(eric, reading). likes(X, reading). likes(Person, reading).

/* Ch 03 ex 04. pro */ predicates male(symbol) female(symbol) parent(symbol, symbol) clauses male(bill). male(joe). female(sue). female(tammy). parent(bill, joe). parent(sue, joe). parent(joe, tammy). Write a goal statement that finds the fathers Goal: parent(Person, _) and male(Person). Another way of defining father predicate father(X, Y): parent(X, Y), male(X).

/* Ch 03 ex 04. pro */ predicates male(symbol) female(symbol) parent(symbol, symbol) clauses male(bill). male(joe). female(sue). female(tammy). parent(bill, joe). parent(sue, joe). parent(joe, tammy). ØFirst solve the sub-goal parent(Person, _) ØThen bind the variable Person to a value returned by parent. ØThe value returned by parent is now used to satisfy the goal male(Person) ØCompound goals are composed of conjunction (AND) and disjunction (OR).

/* Ch 03 Ex 05 */ predicates car(symbol, real, integer, symbol, integer) truck(symbol, real, integer, symbol, integer) clauses car(chrysler, 130000, 3, red, 12000). car(ford, 90000, 4, gray, 25000). car(datsun, 8000, 1, red, 30000). truck(ford, 80000, 6, blue, 8000). truck(datsun, 50000, 5, orange, 20000). truck(toyota, 25000, 2, black, 25000). Goal: car(Make, Odometer, Years-on-road, Body, 25000) Goal: car(Make, Odometer, Years-on-road, Body, Cost) and cost < 25000.

PDC Prolog Programs • Type declaration: to speed up the running time • Clauses: facts and rules • Predicates: declare predicates and domains of the arguments. (If standard domains are used for the predicate they need not be declared in the domain section) • Domains: declare domains that aren’t PDC Prolog’s standard domain • Goal: When the program is to run independent of the PDC Prolog development environment. If standard domains are used for the predicates they need not be declared in the domain section.

A PDC Prolog program has the following basic structure Domain /* domain decleration*/ Predicates /*. . . */ Goal /* subgoal 1 Subgoal 2 …… */ Clauses /*… rules and facts …. . */

Rules are of the form HEAD: - , , …, For a rule to succeed, Prolog must satisfy all of its subgoals. Backtracking: If a subgoal fails prolog backs up and looks for alternatives for the earlier sub goals.

Unification When a clause is matched to the goal, it binds values to free variables so that the goal and the clause are identical. This matching operation is called unification.

/* Ch 04 Ex 01. pro */ domains product, sum = integer predicates add_em_up(sum, sum) multiply_em(product, product) clauses add_em_up(X, Y, Sum) : - Sum = X + Y. multiply_em(X, Y, Product) : - Product = X * Y. To double the product of 31 and 17 one may write multiply_em_up(31, 17, Sum) Add_em(Sum, Answer). Type error – Product and Sum are different domains

/* Ch 04 ex 02. pro – Domain declerations to catch type errors */ domains brand, color = symbol age, price = integer mileage = real predicates car(brand, mileage, color, price) clauses car(chrysler, 130000, 3, red, 12000). car(ford, 90000, 4, gray, 25000). car(datsun, 8000, 1, red, 30000). If the order of the arguments are mixed up in the goal statement ‘type error’ is produced.

/*Unification Ch 05 Ex 01. pro*/ domains title, author = symbol pages = integer Goal: written_by(X, Y) X=fleming, Y=DR NO X=melville, Y=MOBY DICK 2 Solutions Goal: predicates book(title, pages) written_by(author, title) long_novel(title) Trace CALL: written_by( _, _) RETURN: *written_by("fleming", "DR NO”) YES clauses written_by(fleming, "DR NO"). written_by(melville, "MOBY DICK"). book("MOBY DICK", 250). book("DR NO", 310). long_novel(Title) : Goal: long_novel(Title) written_by(_, Title), book(Title, Length), Length > 300.

/* Backtracking Cho 5 ex 02. pro */ predicates likes(symbol, symbol) tastes(symbol, symbol) food(symbol) clauses likes(bill, X) : food(X), tastes(X, good). tastes(pizza, good). tastes(brussels_sprouts, bad). food(brussels_sprouts). food(pizza). Goal: likes(bill, X) X=pizza 1 Solution CALL: likes("bill", _) CALL: food(_) RETURN: *food("brussels_sprouts") CALL: tastes("brussels_sprouts", "good") REDO: food(_) RETURN: food("pizza") CALL: tastes("pizza", "good") RETURN: likes("bill", "pizza")

Summary • When Prolog begins an attempt to satisfy a goal, it starts at the top of the program in search of a match. • When a new call is made, a search for a match to that call also begins at the top of the program. • When a call has found a successful match, the call is said to return, and the next subgoal in turn may be tried. • Once a variable has been bound in a clause, the only way to free that binding is through backtracking. • Backtracking always goes up to the last indeterministic call and tries to resatisfy that call.

/* Bactracking Ch 05 Ex 05 */ predicates type(symbol, symbol) is_a(symbol, symbol) lives(symbol, symbol) can_swim(symbol) goal can_swim(What) , write("A ", What, " can swim. "). clauses type(ungulate, animal). type(fish, animal). is_a(zebra, ungulate). is_a(herring, fish). is_a(shark, fish). lives(zebra, on_land). lives(frog, in_water). lives(shark, in_water). can_swim(Y) : type(X, animal) , is_a(Y, X) , lives(Y, in_water). CALL: _PROLOG_Goal() CALL: can_swim(_) CALL: type(_, "animal") RETURN: *type("ungulate", "animal") CALL: is_a(_, "ungulate") RETURN: is_a("zebra", "ungulate") CALL: lives("zebra", "in_water") REDO: lives("zebra", "in_water") FAIL: lives("zebra", "in_water") REDO: type(_, "animal") RETURN: type("fish", "animal") CALL: is_a(_, "fish") REDO: is_a(_, "fish") RETURN: *is_a("herring", "fish") CALL: lives("herring", "in_water") REDO: lives("herring", "in_water") FAIL: lives("herring", "in_water") REDO: is_a(_, "fish") RETURN: is_a("shark", "fish") CALL: lives("shark", "in_water") REDO: lives("shark", "in_water") RETURN: can_swim("shark") RETURN: write("A ") write("shark") write(" can swim. ")

Controlling the Search for Solutions • Deterministic call produces only one solution • Nondeterministic call may produce multiple solutions. • Fail – to force backtracking • Cut (!) – to prevent backtracking

/* use of fail - Ch 05 ex 06. pro */ domains name = symbol predicates father(name, name) everybody clauses father(leonard, katherine). father(carl, jason). father(carl, marilyn). everybody : father(X, Y), write(X, " is ", Y, "'s fathern"), fail. Goal: father(X, Y) X=leonard, Y=katherine X=carl, Y=jason X=carl, Y=marilyn 3 Solutions Goal: Without ‘fail’ Goal: everybody leonard is katherine’s father YES Goal: With ‘fail’ Goal: everybody leonard is katherine's father carl is jason's father carl is marilyn's father No Goal:

Cut Green Cut: When it is known in advance that certain possibilities will never give rise to meaningfull solutions (waste of time and storage) Red Cut. The logic of the program demands the cut to prevent considerations of alternate subgoals. Prevent backtracking to a previous subgoal in a rule Example Rl: - a, b, !, c. Shows the satisfaction with finding the first solution that prolog finds to the subgoals a and b.

/* Cut Example Ch 05 ex 07. pro */ predicates buy_car(symbol, symbol) car(symbol, integer) colors(symbol, symbol) clauses buy_car(Model, Color) : car(Model, Color, Price), colors(Color, sexy), !, Price < 25000. car(maserati, green, 25000). car(corvette, black, 24000). car(corvette, red, 26000). car(porsche, red, 24000). colors(red, sexy). colors(black, mean). colors(green, preppy). Goal: buy_car(X, Y) No Solution Goal: buy_car(X, red) No Solution CALL: buy_car(_, "red") CALL: car(_, "red", _) REDO: car(_, "red", _) RETURN: *car("corvette", "red", 26000) CALL: colors("red", "sexy") RETURN: colors("red", "sexy") 26000<25000 FAIL: buy_car(_, "red")

Use of cut to implement case structure r(X) : - X =1, ! , a, b, c. r(X) : - X =2, ! , d. r(X) : - X =3, ! , c. r(_) : - write(“This is a catch-all clause. ”). r(1) : - ! , a, b, c. r(2) : - ! , d. r(3) : - ! , c. r(_) : - write(“This is a catch-all clause. ”). Using the cut makes r a deterministic predicate

*/ The cut as a go to -- Ch 05 ex 14 --*/ predicates action(integer) clauses action(1) : - !, write("You typed 1. "). action(2) : - !, write("You typed two. "). action(3) : - !, write("Three was what you typed. "). action(_) : - !, write("I don't know that number!"). goal write("Type a number from 1 to 3: "), readreal(Choice), action(Choice).

The not predicate succeeds when the subgoal can’t be proven true. Free variables are not allowed in not. likes(bill, Anyone) : likes(sue, Anyone), not(hates(bill, Anyone)). Will work likes(bill, Anyone) : not(hates(bill, Anyone)), likes(sue, Anyone). Will not work

Simple and Compound Objects Simple Data Objects A simple data object is either a variable or a constant. If it is a constant, it is a character (a char), a number (an integer or a real), or an atom ( a string or a symbol). Variables as Data Objects Variables must begin with an upper case letter (A *Z) or an underscore (_). In prolog variables can bind with any legal Prolog argument or data object. Prolog variables are local not global. That is, if two clauses each contain a variable called X, these X’s are two distint Xs.

Simple and Compound Objects Constants as Data Objects Constants include characters, numbers, and atoms. A constan’s value is its name. That is, the constant 2 can olny stand for the number 2. Characters are char type; they consist of printable and unprintable ASCII characters. Numbers are either integer (-32, 768 to 32, 767) or real (1 e-308 to 1 e 308) types.

Simple and Compound Objects Atoms An atom is either a symbol or a string type. Symbol Atoms String Atoms food “Jesse James” rick_jones_2 “ 123 Pike street” new_york “a” a “New York”

/* Ch 06 ex 02 */ domains row, column, step = integer movement = up(step); down(step); left(step); right(step) predicates move_cursor(row, column, movement) clauses move_cursor(R, C, up(Step)) : cursor(R, C), R 1=R-Step, cursor(R 1, C). move_cursor(R, C, down(Step)) : cursor(R, C), R 1=R+Step, cursor(R 1, C). move_cursor(R, C, left(Step)) : cursor(R, C), C 1=C-Step, cursor(R, C 1). move_cursor(R, C, right(Step)) : cursor(R, C), C 1=C+Step, cursor(R, C 1). cursor(Row, Column) is a built in predicate. Two purposes: • denotes where the cursor is • places the cursor

/*Ch 06 ex 03*/ domains name = person(symbol, symbol) birthday = b_date(symbol, integer) ph_num = symbol predicates phone_list(name, symbol, birthday) get_months_birthdays convert_month(symbol, integer) check_birthday_month(integer, birthday) write_person(name) /* (First, Last) */ /* (Month, Day, Year) */ /* Phone_number */

/*Ch 06 ex 03 - continue*/ clauses get_months_birthdays : makewindow(1, 7, 7, " This Month's Birthday List ", 0, 0, 25, 80), write(" First namet Last Namen"), date(_, This_month, _), /* Get month from system clock (yy/mm/dd/ */ phone_list(Person, _, Date), check_birthday_month(This_month, Date), write_person(Person), fail. get_months_birthdays : write("nn Press any key to continue: "), readchar(_). write_person(First_name, Last_name)) : write(" ", First_name, "tt ", Last_name), nl. check_birthday_month(Mon, b_date(Month, _, _)) : convert_month(Month, Month 1), Mon = Month 1.

/*Ch 06 ex 03 - continue*/ phone_list(person(ed, willis), "767 -8463", b_date(jan, 3, 1955)). phone_list(person(benjamin, thomas), "438 -8400", b_date(feb, 5, 1985)). phone_list(person(ray, william), "555 -5653", b_date(mar, 3, 1935)). phone_list(person(thomas, alfred), "767 -2223", b_date(apr, 29, 1951)). phone_list(person(chris, grahm), "555 -1212", b_date(may, 12, 1962)). phone_list(person(dustin, robert), "438 -8400", b_date(jun, 17, 1980)). phone_list(person(anna, friend), "767 -8463", b_date(jun, 20, 1986)). phone_list(person(brandy, rae), "555 -5653", b_date(jul, 16, 1981)). convert_month(jan, 1). convert_month(feb, 2). convert_month(mar, 3). convert_month(apr, 4). convert_month(may, 5). convert_month(jun, 6). convert_month(jul, 7). convert_month(aug, 8). convert_month(sep, 9). convert_month(oct, 10). convert_month(nov, 11). convert_month(dec, 12).

Lists and Recursion based search in Prolog List specification: [1, 2, 3, 4] List representation: [H| T] /* Ch 08 ex 06 */ domains namelist = name* name = symbol predicates is_a_member_of(name, namelist) clauses is_a_member_of(Name, [Name|_]). is_a_member_of(Name, [_|Tail]) : - is_a_member_of(Name, Tail).

Members of a List domains list = symbol* predicates colours(list) member(symbol, list) clauses colours([red, orange, green, blue, yellow]). member(X, List) : - member (X, [X| - ]), member(X, [T]). goal colours(X), member (green, X).

3 x 3 Knight’s tour problem domains liste=integer* 1 2 3 predicates 4 5 6 path(integer, liste) member(integer, liste) 7 8 9 move(integer, integer) clauses move(1, 6). move(1, 8). path(Z, Z, L). move(2, 7). path(X, Y, L): - move(X, Z), not(member(Z, L)), move(2, 9). path(Z, Y, [Z|L]). move(3, 4). move(3, 8). member(X, [X|T]). move(4, 3). member(X, [Y|T]): - member(X, T). move(4, 9). move(6, 7). move(6, 1). move(7, 6). move(7, 2). Goal: path(1, 3, [1]). move(8, 3). move(8, 1). move(9, 4). move(9, 2).

Recursive Program that Adds the Elements of a List domains list = integer* predicates sum_of(list, integer) goal sum_of([1, 2, 3, 4], S). clauses sum_of([], 0). sum_of([H|T], S): - sum_of(T, Sum), S = Sum+H.