using Prolog ,,, Implement "is_friend" which makes the "friend" relation a symmetric relation (i.e., if X is friends with Y then Y is friends with X).
using Prolog <list , backtracking , recursion> ,,, Implement "is_friend" which makes the "friend" relation a symmetric relation
(i.e., if X is friends with Y then Y is friends with X).
Examples:
?- is_friend(ahmed, samy).
true.
?- is_friend(samy, ahmed).
true.
Note: In the knowledge base, we have only one relation for Ahmed and Samy.
example 2
Get the list of all friends of a given person.
Examples:
?- friendList(ahmed, L).
L = [samy, fouad].
?- friendList(huda, L).
L = [mariam, aisha, lamia].
example 3
Get the number of friends of a given person. (For the "count" rule, use tail recursion)
Examples:
?- friendListCount(ahmed, N).
N = 2.
?- friendListCount(huda, N).
N = 3.
example 4 :
Suggest possible friends to a person if they have at least one friend in common (at
least one mutual friend). Make sure that the suggested friend is not already a friend of
the person.
Examples:
?- peopleYouMayKnow(ahmed, X).
X = mohammed;
X = said;
…
?- peopleYouMayKnow(huda, X).
X = hagar;
X = zainab;
X = hend;
X = zainab;
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
