For all parts of this problem, use the following set of
facts.
a. Olympic_Athlete(Bill)
b. Olympic_Athlete(Tom)
c. Olympic_Athlete(Jack)
d. Olympic_Athlete(John)
e. Teammates(Bill,Tom)
f. Teammates(Jack,Tom)
g. Won_Gold(Jack)
h. Vx,y: Teammates(x,y) -> Teammates(y,x)
i. Vx,y,z: Teammates(x,y) ^ Teammates(y,z) -> Teammates(x,z)
j. Vx: Olympic_Athlete(x) -> ~Teammates(x,Jack) v cheer_for(x,Jack)
k. Vx,y: Teammates(x,y) ^ Won_Gold(x) -> Won_Gold(y)
Convert the facts into clause form, then Use resolution to show that “Bill cheered for Jack”
Here i am proviiding the answer. Hope it helps. please give me a like. it helps me a lot.
If you have any doubts, please ask in comments, I will try to solve it as soon as possible. If you find my answer helpful, do UPVOTE.Thanks
a. Bill is an Olympic Athelete
b. Tom is an Olympic Athelete
c. Jack is an Olympic Athelete
d. John is an Olympic Athelete
e. Bill and Tom are teammates
f. Jack and Tom are teammates
g. Jack won the gold
h. For all x, y if x and y are teammates then y and x are also teammates.
i. For all x,y,z if x and y are teammates and y and z teammates then x and z are also teammates
j. For all x, if x is an Olympic Athlete then x is not a teammate of Jack and x cheers for Jack.
k. For all x, y if x and y are teammates and x won the gold then y also won the gold.
Thank you. please upvote.
For all parts of this problem, use the following set of facts. a. Olympic_Athlete(Bill) b. Olympic_Athlete(Tom)...
Hi, I could use some help for this problem for my discrete math class. Thanks! 18. Consider the graph G = (V, E) with vertex set V = {a, b, c, d, e, f, g} and edge set E = {ab, ac, af, bg, ca, ce) (here we're using some shorthand notation where, for instance, ab is an edge between a and b). (a) (G1) Draw a representation of G. (b) (G2) Is G isomorphic to the graph H -(W,F)...
Use the rules of deduction in the Predicate Calculus (but avoiding derived rules) to find formal proofs for the following sequents: (a) x) F)~(Vx)~ F(x) (b) (Vz) ~ F(x) B) F() (3x)(G(z) Л (Vy) (F(y) H(y, z))) (e) Use the rules of deduction in the Predicate Calculus (but avoiding derived rules) to find formal proofs for the following sequents: (a) x) F)~(Vx)~ F(x) (b) (Vz) ~ F(x) B) F() (3x)(G(z) Л (Vy) (F(y) H(y, z))) (e)
need help on parts B and C 6. Use the Stokes' thm to evaluate the line integral S. F. dr A. Let C is the oriented triangle lying in the plane 2x + 2y + z = 6. where F (x, y, z) = < - y, z, x>. B. F(x, y, z) = < 2?, x, y2 >, S: z = y2, Os xsa, Os y sa. C. F(x, y, z) = (- y + z) i + (x...
Hello, I need help with all parts of Problem 13 (a and b). Please show all the steps and the solutions of the problem. Thank you very much. 13. (a) Let f(x , K a field. Form the NEW polynomial g(x) f(x1). Prove: If g(x) is irreducible in Kx] then f(x) is irreducible in K (b) Factor -1 EQL] into irreducible polynomials in Q[r. (Hint: First factor out a linear term arising from a root. Then use (a) to investigate...
Spell it out! Use the following Java concepts to compile the program below: String myName = "Chuck"; int length = myName.length(); char firstChar = myName.charAt(0); char secondChar = myName.charAt(1); if (myName.equals("Tom")) { System.out.println ("Sorry, Tom!"); } Write a program that uses a METHOD to translate these individual characters: input output input output input output input output input output a 4 g 9 m /\\/\\ s $ y ‘/ b B h |-| n |\\| t...
Problem 5. Given a vector space V, a bilinear form on V is a function f : V x V -->R satisfying the following four conditions: f(u, wf(ū, ) + f(7,i) for every u, õ, wE V. f(u,ū+ i) = f(u, u) + f(ū, w) for every ā, v, w E V. f(ku, kf (ū, v) for every ū, uE V and for every k E R f(u, ku) = kf(u, u) for every u,uE V and for every k...
Incorrect Question 11 0/5 pts Consider the following resolution process: Resolution Process: 5.-R(a.y) -R(y,a) v R(aa) 3, with [x/a) [z/a) Original Set of Clauses: 6.-R(a,y) -R(ya) resolve 1 and 5 1. -R(aa) 7. Raf(a)) 2 with [x/a) 2. R(x.f(x)) 8. R(a,f(a)) --R(f(a),a) 6 with [y/f(a)] 3. -R(X.X) -R(Y.Z) ROX.) 9. R(f(a),a) resolve 7 and 8 4. -R(X.) R(x,x) 10.-R(af(a)) R(f(a),a) 4 with [x/a) [y/a) 11. -R(a,f(a)) resolve 9 and 10 12. Raf(a)) 2 with [x/a) 13. Empty Clause 11, 12...
e,f,g,h,i 1) Given: X 0xA4 and Y 0x95, a) Convert X and Y to 8-bit binary numbers. b) Compute the 8-bit sum X+Y of X and Y o) Compute Y the 8-bit two's complement of Y. d) Compute the 8-bit difference X"Y of X and Y. (Use two's complement addition.) o) Convert XiY, Y, and, X Y to hexadecimal. D What are the values of the condition flags z n c v upon computing X-+Y? g) What are the values...
Implicit Function Theorem in Two Variables: Let g: R2 → R be a smooth function. Set {(z, y) E R2 | g(z, y) = 0} S Suppose g(a, b)-0 so that (a, b) E S and dg(a, b)メO. Then there exists an open neighborhood of (a, b) say V such that SnV is the image of a smooth parameterized curve. (1) Verify the implicit function theorem using the two examples above. 2) Since dg(a,b) 0, argue that it suffices to...
number 4 parts a b and c The symbols Vf, V.. bols vf, V az oy F, and V x F are defined by Of = grad f 7. F = div F VXF = curl F After eq. (3.12) is memorized, formulas (3.13) through (3.15) venient ways of remembering the expressions for gradient, diverge just operate with V as though it were a vector. Henceforth, we breviations frequently. EXERCISES 1. If f(x,y,z) = x²y + z, what is f(2,3,4)?...