Question

5. Prove the following Predicate Logic theorem using resolution refutation • Premise 1. For all persons,...

5. Prove the following Predicate Logic theorem using resolution refutation

• Premise 1. For all persons, a person’s mother is that person’s parent

2. For all persons, if the person’s parent is alive then the parent is older than the person

3. Mary is the mother of John

4. Mary is alive

• Conclusion?

1. Mary is older than John

Hint: use the following predicates

Mother(x,y): x is a mother of y

Parent(x,y): x is a parent of y

Older(x,y): x is older than y

Alive(x): x is alive

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Using the given predicates, we can represent the given scenario in the following way:

We need to prove the following statement from these:

We use the resolution refutation method to get the conclusion in the following way:

  1. for all x and p [CNF of the first statement]
  2. for all c and p [CNF of the second statement]
  3. [third statement]
  4. [fourth statement]
  5. [negated conclusion]
  6. [applying the resolution rule to 1 and 2]
  7. [putting x=Mary and p=John in 6]
  8. [applying the resolution rule to 4 and 7]
  9. [applying resolution rule to 3 and 8]
  10. [applying resolution rule to 5 and 9 we reach a contradiction]

Thus we arrive at a contradiction, and from the resolution refutation method, .

Hence, Mary is older than John.

Add a comment
Know the answer?
Add Answer to:
5. Prove the following Predicate Logic theorem using resolution refutation • Premise 1. For all persons,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Simplify the following sentences in predicate logic so that all the negation symbols are directly in...

    Simplify the following sentences in predicate logic so that all the negation symbols are directly in front of a predicate. (For example, Vx ((-0(x)) + (-E(x))) is simplified, because the negation symbols are direct in front of the predicates O and E. However, Væ -(P(2) V E(x)) is not simplified.) (i) -(3x (P(x) 1 (E(x) + S(x)))) (ii) -(Vx (E(x) V (P(x) +-(Sy G(x, y))))) Write a sentence in predicate logic (using the same predicates as above) which is true...

  • 5. Symbolize the following argument and prove it is a valid argument. Let B ( x...

    5. Symbolize the following argument and prove it is a valid argument. Let B ( x ) = x is a bear; D ( x ) = x is dangerous, and H ( x ) = x is hungry. Every bear that is hungry is dangerous. There is a hungry animal that is not dangerous. Therefore there is an animal that is not a bear. 6.  In order to prove an quantificational argument invalid it is only necessary to find a...

  • Problem 1 [8pt] Prove that the following two Hoare triples are valid. (Hint: in predicate logic...

    Problem 1 [8pt] Prove that the following two Hoare triples are valid. (Hint: in predicate logic Pi equivalent to -P V P2) is a) (4pt) y:= x * 2; y:= y + 3; lu > o) b) (4pt) if (y>2) x := y-1; elsex5-y: fr > 1)

  • 1. Formalize the following argument by using the given predicates and then rewriting the argument...

    1. Formalize the following argument by using the given predicates and then rewriting the argument as a numbered sequence of statements. Identify each statement as either a premise, or a conclusion that follows according to a rule of inference from previous statements. In that case, state the rule of inference and refer by number to the previous statements that the rule of inference used.Lions hunt antelopes. Ramses is a lion. Ramses does not hunt Sylvester. Therefore, Sylvester is not an...

  • 9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic...

    9. Prove that the following kogical expressions aro logically equivalent by applying the law of logic 10. Give a logical expression with variables p, q, and r that's true only if p and q are false and r is true. 11. Predicates P and Q are defined below. The domain of discourse is the set of all positive integers. P(x): x is prime Qlx): x is a perfect square Are the following logical expressions propositions? If the answer is yes,...

  • Can anyone help me prove the theorem 49 by using the following hint( Circle)? Here is...

    Can anyone help me prove the theorem 49 by using the following hint( Circle)? Here is Theorem 39, can't use like right angles are 90 degrees, or that triangles are 180 degrees. Strong Right Angle Theorem 49. All right angles are congruer Consequently, a right angle is congruent to another angle if and only if the other angle is also a right angle.) Since you have already proven Theorem 39, it remains only to prove the converse: i f LX...

  • 1.) Prove the following theorem Theorem 3.4.6. A set E C R is connected if and...

    1.) Prove the following theorem Theorem 3.4.6. A set E C R is connected if and only if, for all nonempty disjoint sets A and B satisfying E AU B, there always erists a convergent sequence (xn) → x with (en) contained in one of A or B, and x an element of the other. (2) (10 points) Are the following claims true or false? You must use the ε-δ definition to justify your answers. x-+4 r2 16 (Here [[x]-greatest...

  • Formal Methods Introduction What are some possible disadvantages of formal methods? Given the sets A = {1,2,5,6}, B = {1,3,5,7,9}, C= {x|x Element_of A and x < 4} What are the fo...

    Formal Methods Introduction What are some possible disadvantages of formal methods? Given the sets A = {1,2,5,6}, B = {1,3,5,7,9}, C= {x|x Element_of A and x < 4} What are the following: A union B B intersection C A - B (also written A \ B) P A (ie Powerset of A) A \ A (also written A - A) Given the function f = { (1,1), (2,3), (3,7), (4,0), (5,10) }, write down the following: dom(f) ran(f) f override_op...

  • can you please prove the following theorem using the provided axioms and defintions. using terms like...

    can you please prove the following theorem using the provided axioms and defintions. using terms like suppose in a paragraph format. please write clearly or type if you can ! 1 Order Properties Undefined Terms: The word "point and the expression "the point z precedes the point y will not be defined. This undefined expression wil be written z < y. Its negation, "z does not precede y," will be written y. There is a set of all points, called...

  • 1. Prove the following theorem: AB+A'C+B C = AB+ A'C 2. Implement all four Boolean expressions...

    1. Prove the following theorem: AB+A'C+B C = AB+ A'C 2. Implement all four Boolean expressions using three half adders only. D = A BOC E = A'BC + AB'C F = ABC'+(A' +B) C G = ABC 3. Two sensors are mounted on a half-white rotating disk as shown below. Sensor output is 5V for white and OV for dark. Specify the digital element or elements to put in the black box so that the LED is ON for...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT