Study Glance
🤖
B.TECH II YEAR • II SEMESTER • R22

Skill Development Course - Lab Manual

PROLOG / LISP / PySWIP • Program 1 Solution

📘 R22 Regulation 🎓 II Year 📚 II Semester 🤖 Skill Development Course 🧪 Lab Program 1
Aim

Write simple fact for following: A. Ram likes mango. B. Seema is a girl. C. Bill likes Cindy. D. Rose is red. E. John owns gold

← All Programs

💻 Solution

week1.pl 
% Facts

1. Ram likes mango.
2. Seema is a girl.
3. Bill likes Cindy.
4. Rose is red.
5. John owns gold.

% Clauses

 likes(ram ,mango).
 girl(seema).
 red(rose).
 likes(bill ,cindy).
 owns(john ,gold).

📤 Output

w1.txt 
% Queries

 ?-likes(ram,What).
 What= mango
 ?-likes(Who,cindy).
 Who= cindy

 ?-red(What).
 What= rose
 ?-owns(Who,What).
 Who= john
 What= gold
Program 2 →

Related Skill Development Course (Prolog) Lab Programs

🤖

Prolog / LISP / PySWIP Lab Programs

1. Write simple fact for following: A. Ram likes mango. B. Seema is a girl. C. Bill likes Cindy. D. Rose is red. E. John owns gold Current
2. Write predicates one converts centigrade temperatures to Fahrenheit, the other checks if a temperature is below freezing. View Solution →
3. Write a program to solve the Monkey Banana problem View Solution →
4. WAP in turbo prolog for medical diagnosis and show the advantages and disadvantages of green and red cuts. View Solution →
5. Write a program to solve 4-Queens problem View Solution →
6. Write a program to solve Traveling salesman problems View Solution →
7. Write a program to solve water jug problems using Prolog View Solution →
8. Write simple Prolog functions such as the following. Take into account lists which are too short. -- remove the Nth item from the list. -- insert as the Nth item. View Solution →
9. Assume the prolog predicate gt(A, B) is true when A is greater than B. Use this predicate to define the predicate addLeaf(Tree, X, NewTree) which is true if NewTree is the Tree produced by adding the item X in a leaf node. Tree and NewTree are binary search trees. The empty tree is represented by the atom nil. View Solution →
10. Write a Prolog predicate, countLists(Alist, Ne, Nl), using accumulators, that is true when Nl is the number of items that are listed at the top level of Alist and Ne is the number of empty lists. Suggestion: First try to count the lists, or empty lists, then modify by adding the other counter. View Solution →
11. Define a predicate memCount(AList,Blist,Count) that is true if Alist occurs Count times within Blist. Define without using an accumulator. Use "not" as defined in utilities.pro, to make similar cases are unique, or else you may get more than one count as an answer. View Solution →
← Back to Skill Development Course Lab Programs 📚 All Lab Manuals