Scribd
Upload
131 views2 pages

AI

The document contains 3 logic puzzles involving quantifiers and predicates. The first puzzle concludes that there exists a horse that has won a race this year but is not a thoroughbred. The second puzzle concludes that if all roadrunners say "beep-beep" then all coyotes are frustrated. The third puzzle asks if there exists a conservative Austinite, but does not provide a conclusion. It establishes premises about Austinites, Aggies, armadillos, and dogs.

Uploaded by

KaluLal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
131 views2 pages

AI

The document contains 3 logic puzzles involving quantifiers and predicates. The first puzzle concludes that there exists a horse that has won a race this year but is not a thoroughbred. The second puzzle concludes that if all roadrunners say "beep-beep" then all coyotes are frustrated. The third puzzle asks if there exists a conservative Austinite, but does not provide a conclusion. It establishes premises about Austinites, Aggies, armadillos, and dogs.

Uploaded by

KaluLal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Qn 1.

P(x): x is registered for today’s race.


Q(x): x is a thoroughbred.
R(x): x has won a race this year.
U = all horses

∃x(P(x) ∧ ¬Q(x))
∀x(P(x) → R(x))
Conclusion:
∃x(R(x) ∧ ¬Q(x))

Proof:
1. ∃x(P(x) ∧ ¬Q(x)) premise
2. P(a) ∧ ¬Q(a) for some a step 1, existential instantiation
3. P(a) simplification, step 2
4. ∀x(P(x) → R(x)) premise
5. P(a) → R(a) universal instantiation, step 4
6. R(a) modus ponens, steps 3 and 5
7. ¬Q(a) step 2, simplification
8. R(a) ∧ ¬Q(a) conjunction, steps 6 and 7
9. ∃x(R(x) ∧ ¬Q(x)) existential generalization, step 8

Qn 2.
Every coyote chases some roadrunner.
∀ x (COYOTE(x) → ∃ y (RR(y) ∧ CHASE(x,y)))

Every roadrunner who says ``beep-beep'' is smart.


∀ x (RR(x) ∧ BEEP(x) → SMART(x))

No coyote catches any smart roadrunner.


¬ ∃ x ∃ y (COYOTE(x) ∧ RR(y) ∧ SMART(y) ∧ CATCH(x,y))

Any coyote who chases some roadrunner but does not catch it is frustrated.
∀ x (COYOTE(x) ∧ ∃ y (RR(y) ∧ CHASE(x,y) ∧ ¬ CATCH(x,y)) → FRUSTRATED(x))

(Conclusion) If all roadrunners say ``beep-beep'', then all coyotes are


frustrated.
(∀ x (RR(x) → BEEP(x)) → (∀ y (COYOTE(y) → FRUSTRATED(y)))

( ( (not (Coyote x)) (RR (f x)) )


( (not (Coyote x)) (Chase x (f x)) )
( (not (RR x)) (not (Beep x)) (Smart x) )
( (not (Coyote x)) (not (RR y)) (not (Smart y)) (not (Catch x y)) )
( (not (Coyote x)) (not (RR y)) (not (Chase x y)) (Catch x y)
(Frustrated x) )
( (not (RR x)) (Beep x) )
( (Coyote (a)) )
( (not (Frustrated (a))) ) )

Qn 3.
Every Austinite who is not conservative loves some armadillo.
∀ x (AUSTINITE(x) ∧ ¬ CONSERVATIVE(x) → ∃ y (ARMADILLO(y) ∧ LOVES(x,y)))

Anyone who wears maroon-and-white shirts is an Aggie.


∀ x (WEARS(x) → AGGIE(x))

Every Aggie loves every dog.


∀ x (AGGIE(x) → ∀ y (DOG(y) → LOVES(x,y)))
Nobody who loves every dog loves any armadillo.
¬ ∃ x ((∀ y (DOG(y) → LOVES(x,y))) ∧ ∃ z (ARMADILLO(z) ∧ LOVES(x,z)))

Clem is an Austinite, and Clem wears maroon-and-white shirts.


AUSTINITE(Clem) ∧ WEARS(Clem)

(Conclusion) Is there a conservative Austinite?


∃ x (AUSTINITE(x) ∧ CONSERVATIVE(x))

( ( (not (Austinite x)) (Conservative x) (Armadillo (f x)) )


( (not (Austinite x)) (Conservative x) (Loves x (f x)) )
( (not (Wears x)) (Aggie x) )
( (not (Aggie x)) (not (Dog y)) (Loves x y) )
( (Dog (g x)) (not (Armadillo z)) (not (Loves x z)) )
( (not (Loves x (g x))) (not (Armadillo z)) (not (Loves x z)) )
( (Austinite (Clem)) )
( (Wears (Clem)) )
( (not (Conservative x)) (not (Austinite x)) ) )

You might also like