
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 nowThis is a popular solution!
Step by stepSolved in 4 steps

- Java data structurearrow_forwardTry to classify the following dataset with three classes by implementing a multiclass classification neural network from scratch using the NumPy library in Python:arrow_forward7 4 2 4 2 Tree #1 1 5 Tree #2 6 3 6 8 8 9 5 7 9 1 For parts a through g, implement the given method and demonstrate the method working with the two trees provided earlier. All code implemented in this assignment should be in a class called Homework 6. You may use the data structures and algorithm code from the lecture notes. Hint: Consider using recursion. To do so implement a private helper method that takes a Node and then recursively calls itself to traverse the tree. The public method would call the private method passing the tree's root as the Node.arrow_forward
- modify the event tree of the figure to determine the runaways per year if the loss of cooling initiating event is reduced to 0.80 occurrence per yeararrow_forwardImplement a generic priority queue in Java and test it with an abstract Cryptid class and two concrete Cryptid classes, Yeti and Bigfoot. Create a code package called pq and put all the code for this assignment in it. Write the abstract class Cryptid. A Cryptid has a name (a String) and a public abstract void attack() method. Name should be protected. The class implements Comparable<Cryptid>. The compareTo method returns a negative int if the instance Cryptid's name (that is, the name of the Cryptid you called the method on) is earlier in lexicographic order than the name of the other Cryptid (the one passed in as an argument; it returns a positive int if the other Cryptid's name is earlier in lex order, and returns 0 if they are equal (that is, if they have all the same characters.) This part is easy; just have the method call String's compareTo() method on the instance Cryptid's name, with the other Cryptid's name as the argument, and return the result. Extend Cryptid…arrow_forwardeinsteineruploading up to get together with. In many aspects, a contemporary Turkish individual differs from an 18th-century Turkish person.arrow_forward
- I need to implement a python code for Q learning and SARSA method. My example involves a cliff walking experiment where the rewards are -1 except for the region marked as cliff if the agent steps there the reward is -100 and the agent is sent back to the start. The values used are alpha = 0.1, y or gamma = 1 and the e- greedy action is 0.1. After using these values on both algorithm the results needs to be shown by using matplot. The graph should have episodes in the x axis and sum of rewards during episode on the y axis. It needs to be smoothed out by averaging over 10 runs and, plotting moving average over last 10 episodes. This needs to be done in python using numpy and panda but I'm not allowed to use gym library or any other library.arrow_forwardDiscrete mathematics. What is wrong with this proof?arrow_forwardExercise 1.3.4: Truth tables for logical expressions with conditional operations. info About Give a truth table for each expression. (a) (¬p ∧ q) → p (b) (p → q) → (q → p) (c) (p ∨ q) ↔ (q → ¬p) (d) (p ↔ q) ⊕ (p ↔ ¬q) (e) (p ∨ q) ↔ (q ∧ p)arrow_forward
- Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…arrow_forwardComputer Science A way to avoid overfitting in Deep Neural Networks is to add an additional term R to the loss function L (for example L can be the cross entropy loss) as follows: L(w) + λR(w). (1) You know that one choice for R is the L2 norm, i.e. R(w) = ||w||2 2 . One friend of yours from the School of Maths told you however that there’s no need to use squares (i.e. powers of two) and that you can achieve the same effect by using absolute values, i.e. the L1 norm: R(w) = ||w||1. Would you agree with him? i.e. is the use of the L2 norm equivalent to using the L1 norm for regularization purposes? Justify your answerarrow_forwardpls help fast will likearrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





