0% found this document useful (0 votes)
4 views

Tutorial5_Logic

Cse

Uploaded by

meghanaalluri2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views

Tutorial5_Logic

Cse

Uploaded by

meghanaalluri2
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Tutorial Examples Logic

March 13, 2015


English To Logic

1. Nobody likes taxes.


2. Some people like anchovies.
3. Emma is a Doberman pincher and a good dog.
English To Logic

1. Nobody likes taxes.


I ¬∃X .likesTaxes(X )
I ¬∃X , Y .person(X ) ∧ tax(Y ) ∧ likes(X , Y )
I ∀X .person(X ) → ¬∃Y .tax(Y ) ∧ likex(X , Y )
2. Some people like anchovies.
3. Emma is a Doberman pincher and a good dog.
English To Logic

1. Nobody likes taxes.


I ¬∃X .likesTaxes(X )
Works if every object in the in the domain is a person.
I ¬∃X , Y .person(X ) ∧ tax(Y ) ∧ likes(X , Y )
Works if we want talk about different kinds of taxes or
different things that are liked.
I ∀X .person(X ) → (¬∃Y .tax(Y ) ∧ likex(X , Y ))
Equivalent. ¬∃X , Y .person(X ) ∧ tax(Y ) ∧ likes(X , Y ) ≡
∀X , Y .¬person(X ) ∨ ¬tax(Y ) ∨ ¬likes(X , Y ) ≡
∀X .person(X ) → (∀Y .¬tax(Y ) ∨ ¬likes(X , Y )) ≡
∀X .person(X ) → (¬∃Y .tax(Y ) ∧ likes(X , Y )) ≡
2. Some people like anchovies.
3. Emma is a Doberman pincher and a good dog.
English To Logic

1. Nobody likes taxes.


2. Some people like anchovies.
I ∃X .person(X ) ∧ likes(X , anchovies).
I ∃X , Y .person(X ) ∧ anchovy (Y ) ∧ likes(X , Y ).
3. Emma is a Doberman pincher and a good dog.
English To Logic

1. Nobody likes taxes.


2. Some people like anchovies.
3. Emma is a Doberman pincher and a good dog.
I doberman(Emma) ∧ good(Emma).
Models

Consider a first-order language L containing the following basic


symbols:
I Constants, A, B, C , D.
I The binary predicate R.
I The unary predicates P and Q.
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. R(C , B) ∨ R(B, A)
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. ∀x.P(x) ∧ ¬Q(x).
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. ∀x.P(x) → ¬∃y .R(y , x).
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. ∀x.Q(x) → ¬∃y .R(y , x).
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. ∀x.Q(x) → ∃y .R(y , x).
Models

Let M be a model for L, with domain D = {a, b, c, d}, and


interpretation function σ:
1. Aσ = a, B σ = b, C σ = c, D σ = d.
2. R σ = {(b, a), (c, d)}.
3. P σ = {b, c}.
4. Q σ = {a, d}.
Which of the following formulas are satisfied by M.
1. ∃x, y .(P(x) ∧ Q(y )) → R(y , x).
Resolution Question

Consider the following sentences:


1. Marcus was a man.
2. Marcus was a Roman.
3. All men are people.
4. Caesar was a ruler.
5. All Romans were either loyal to Caesar or hated him (or both).
6. Everyone is loyal to someone.
7. People only try to assassinate rulers they are not loyal to.
8. Marcus tried to assassinate Caesar.
Covert to First Order Logic
1. Marcus was a man.
man(marcus)
2. Marcus was a Roman.
roman(marcus)
3. All men are people.
∀X .man(X ) → person(X )
4. Caesar was a ruler.
ruler (caesar )
5. All Romans were either loyal to Caesar or hated him (or both).
∀X .roman(X ) → loyal to(X , caesar ) ∨ hates(X , caesar )
6. Everyone is loyal to someone.
∀X .∃Y .person(Y ) ∧ loyal to(X , Y )
7. People only try to assassinate rulers they are not loyal to.
∀X , Y .tried to kill(X , Y ) → ¬loyal to(X , Y )
8. Marcus tried to assassinate Caesar.
tried to kill(marcus, caesar )
Covert to Clauses

1. man(marcus)
2. roman(marcus)
3. ∀X .man(X ) → person(X )
(¬man(X ) ∨ person(X )
4. ruler (caesar )
5. ∀X .roman(X ) → loyal to(X , caesar ) ∨ hates(X , caesar )
(¬roman(X ) ∨ loyal to(X , caesar ) ∨ hates(X , caesar ))
6. ∀X .∃Y .person(Y ) ∧ loyal to(X , Y )
person(f (X ))
loyal to(X , f (X ))
7. ∀X , Y .tried to kill(X , Y ) → ¬loyal to(X , Y )
(¬tried to kill(X , Y ) ∨ ¬loyal to(X , Y ))
8. Marcus tried to assassinate Caesar.
tried to kill(marcus, caesar )
Query

1. “Who hated Caesar?”


2. First order logic:
∃Z .hates(Z , caesar )
3. Negate:
∀Z .¬hates(Z , caesar )
4. Clausal form.
¬hates(Z , caesar ) ∨ answer (Z )
Resolution Proof

1. man(marcus)
2. roman(marcus)
3. (¬man(X ) ∨ person(X )
4. ruler (caesar )
5. (¬roman(X ) ∨ loyal to(X , caesar ) ∨ hates(X , caesar ))
6. person(f (X ))
7. loyal to(X , f (X ))
8. (¬tried to kill(X , Y ) ∨ ¬loyal to(X , Y ))
9. tried to kill(marcus, caesar )
10. ¬hates(Z , caesar ) ∨ answer (Z )
11. R[9, 8a]{X =marcus, Y =caesar } ¬loyal to(marcus, caesar )
Resolution Proof

1. man(marcus)
2. roman(marcus)
3. (¬man(X ) ∨ person(X )
4. ruler (caesar )
5. (¬roman(X ) ∨ loyal to(X , caesar ) ∨ hates(X , caesar ))
6. person(f (X ))
7. loyal to(X , f (X ))
8. (¬tried to kill(X , Y ) ∨ ¬loyal to(X , Y ))
9. tried to kill(marcus, caesar )
10. ¬hates(Z , caesar ) ∨ answer (Z )
11. R[9, 8a]{X =marcus, Y =caesar } ¬loyal to(marcus, caesar )
12. R[11, 5c]{X =marcus} ¬roman(marcus) ∨ hates(marcus, caesar )
Resolution Proof

1. man(marcus)
2. roman(marcus)
3. (¬man(X ) ∨ person(X )
4. ruler (caesar )
5. (¬roman(X ) ∨ loyal to(X , caesar ) ∨ hates(X , caesar ))
6. person(f (X ))
7. loyal to(X , f (X ))
8. (¬tried to kill(X , Y ) ∨ ¬loyal to(X , Y ))
9. tried to kill(marcus, caesar )
10. ¬hates(Z , caesar ) ∨ answer (Z )
11. R[9, 8a]{X =marcus, Y =caesar } ¬loyal to(marcus, caesar )
12. R[11, 5c]{X =marcus} ¬roman(marcus) ∨ hates(marcus, caesar )
13. R[12a, 2]{} hates(marcus, caesar )
Resolution Proof

1. man(marcus)
2. roman(marcus)
3. (¬man(X ) ∨ person(X )
4. ruler (caesar )
5. (¬roman(X ) ∨ loyal to(X , caesar ) ∨ hates(X , caesar ))
6. person(f (X ))
7. loyal to(X , f (X ))
8. (¬tried to kill(X , Y ) ∨ ¬loyal to(X , Y ))
9. tried to kill(marcus, caesar )
10. ¬hates(Z , caesar ) ∨ answer (Z )
11. R[9, 8a]{X =marcus, Y =caesar } ¬loyal to(marcus, caesar )
12. R[11, 5c]{X =marcus} ¬roman(marcus) ∨ hates(marcus, caesar )
13. R[12a, 2]{} hates(marcus, caesar )
14. R[13, 10]{Z = marcus} answer (marcus)

You might also like