The debugger will first creep - showing everything (trace) yes | ?- canget(state(atdoor, onfloor, atwindow, hasnot)). D:/TP Prolog/Sample_Codes/monkey_banana compiled, 17 lines read - 2167 bytes written, 19 ms (31 ms) yes | ?- canget(state(atdoor, onfloor, atwindow, hasnot)). AIM : 3) Write a program to implement Monkey Banana Problem STATE SPACE TREE: compiling D:/TP Prolog/Sample_Codes/monkey_banana for byte code. iv) Prolog program to implement multi (N1, N2, R) : where N1 and N denotes the numbers to be multiplied and R represents the result. Max = 40 iii) Write a Prolog program to implement power (Num,Pow, Ans) : where Num is raised to the power Pow to get Ans. Z = 9 ii) Write a Prolog program to implement max(X, Y, M)and min(X,Y,M) so that M is the maximum of two numbers X and Y A: max(X,Y,M):-X>Y,M is X. AIM : 2) Write a program to implement simple arithmetic Source code : i) Write a prolog program to calculate the sum of two numbers. For example, suppose our database consists of the following facts about a fictitious family. Whenever you run the Prolog interpreter, it will prompt you with ?. If it fails to prove the query true, it answers 'No'. If so, it answers 'yes' and displays any variable bindings that it made in coming up with the answer. In making a query you are asking Prolog whether it can prove that your query is true. The database is assumed to represent what is true about a particular problem domain. Queries The Prolog interpreter responds to queries about the facts and rules represented in its database. * John does not like pizza */ likes(john,susie) :- likes(john,mary)./* John likes Susie if John likes Mary. * John likes Susie or John likes Mary */ not(likes(john,pizza)). * John likes everybody and everybody likes John */ likes(john, susie) likes(john,mary).

* John likes everybody */ likes(john, Y), likes(Y, john). * Everyone likes Susie */ likes(john, Y).

Note that all Prolog sentences must end with a period.

Whenever a variable occurs in a Prolog expression, it is assumed to be universally quantified. Package de. import import import import import import de.AIM : 1)program in prolog to implement simple facts and queries? Source Code: FACTS: A fact is a predicate expression that makes a declarative statement about the problem domain.

Jpe Java Prolog Environment