Q9: Knowledge Representation Consider the following statements: 1. All children have a favourite toy. 2. Whoever likes dolls or soft toys is a child. 3. Fuzzy is a soft toy: SOFT-TOY (Fuzzy). 4. Ellen likes Fuzzy: LIKES (Ellen, Fuzzy). (a) Using only the following predicates CHILD(*), HAS-FAV-TOY(*), LIKES (*,*), DOLL(*) and SOFT-TOY(*), represent the two statements as predicate calculus well formed formulas (Wffs) Notes: The asterisks indicate the number of arguments in each predicate; keep your representation consistent with the predicates in statements 3 and 4 above.) (b) Convert these statements into clauses. (c) Use resolution refutation to prove that Ellen has a favourite toy. state the goal, and indicate clearly the number of the clause you are using, and any substitutions you make. Goal 5: HAS-FAV-TOY (Ellen). Negated goal: -HAS-FAV-TOY(Ellen).

Prime Function A prime number is a positive integer that is evenly divisible only by 1 and itself. Write a predicate function called is_prime that accepts an integer parameter and returns true if that number is prime and false otherwise. Assume that the parameter is a positive integer. 57°F Clear 1 def is prime (num): 2 3 4 Check My Solution for i in range (2, num): if num % i == 0: return False return True Test Results: ✓ You are defining a function called is_prime. x The function does not return the correct value when the argument is 2. V Load My Latest Solution Reset The function correctly returns False for the number 6. The function correctly returns True for the number 29. Search

PLEASE TYPE ANSWE*** Exercise 1.7.4: Translating quantified statements from English to logic, part 3.   In the following question, the domain is a set of employees who work at a company. Ingrid is one of the employees at the company. Define the following predicates: S(x): x was sick yesterday W(x): x went to work yesterday V(x): x was on vacation yesterday Translate the following English statements into a logical expression with the same meaning.   (g) Someone who missed work was neither sick nor on vacation. (h) Each person missed work only if they were sick or on vacation (or both). (i) Ingrid was sick yesterday but she went to work anyway.

Use of the modifier private and the encapsulation

Programming homework1) Simulated waiting queue in an Indian post office: In an Indian post office that not only distributes mail but also performs some financial activities like a savings bank, a lone postal worker attends to a single lineup of clients. As soon as a consumer enters the line, they are given a token # (serial number). After receiving assistance, the consumer exits the queue while the postal worker receives the token back. The employee could inquire as to how many consumers are still unattended at any one time.i) Put the system into practise using a suitable queue data structure, simulating the arrival and departure of consumers at random when the service is finished.

3. Let S(x) be the statement "x studied for the exam" and H(x, y) be the statement "x scored higher than y in the exam," where the domain of x and y consists of all students in this class. Which logical expression corresponds to the following statement? "Every student in this class who studied for the exam scored higher in the exam than every student who did not study for the exam." a. VxVy (H (x, y) → (S(x) ^ ¬S(y))) b. VxVy(S(x)^¬S(y) ^ H (x, y)) c. VxVy((S(x) ^ ¬S(y)) → H (x, y)) d. VxVy((S(x) → ¬S(y)) → H (x, y))

2. Let A(x) be the statement "x has apples," C(x) be the statement "x has cherries," and B(x, y) be the statement "x is better than y," where the domain of x and y consists of all pies. Which logical expression corresponds to the following statement? "There is some pie that has apples that is better than every pie that has cherries." a. 3xVy(A(x) ^ (C(y) → B (x, y))) b. xvy(A(x)^C(y) ^ B (x, y)) c. xvy((A(x) ^ C(y)) → B (x, y)) d. 3xVy(A(x) → (C(y) ^ B (x, y)))

There are no limitations on the implementation of an overloaded operator. Falsely Precise