Scribd
Upload
21 views

Unit III Activity Questions

Uploaded by

Vathana D
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
21 views

Unit III Activity Questions

Uploaded by

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

UNIT III

APPROACHES
1. Check whether moving the
agent to the following position
are safe or not ?
(1,2) , (3,1), (2,1) and (2,2)

2. Path way to win the gold.


Calculate the reward points .
Propositional Logic:
Deals with simple true/false statements.
Used for basic facts without complex relationships.
Predicate Logic:
Handles relationships between objects with quantifiers and predicates.
Represents more complex facts and rules involving objects and properties.
Unification:
Finds substitutions to make logical expressions match.
Used in various AI tasks like natural language processing and automated reasoning.
Resolution:
Infers new information by resolving contradictions.
Central to many AI systems for deriving conclusions from logical facts and rules.
Propositional logic

3. Translate the following three sentences into propositional logic.


• Nadhi will eat a fruit if it is an apple.
• Nadhi will eat a fruit only if it is an apple.
• Nadhi will eat a fruit if and only if it is an apple.

𝑛: Nadhi will eat a fruit. 𝑎: The fruit is an apple


4. Translate the following Propositional Logic to
English sentences .
• E=Lion is eating
• H=Lion is hungry

a) E ⇒ ¬H
b) E ∧ ¬H
c) ¬(H ⇒ ¬E)
Predicate Logic
Predicate Logic

Mary loves everyone. ∀x love (Mary, x)

No one talks. ∃x talk(x)

Every student smiles ∀x (student(x) → smile( x))

Everyone walks or talks ∀x (walk (x) ∨ talk (x))

If anyone cheats, everyone suffers. ∀x (cheat(x) → ∀y suffer(y))


5. Translate the following three sentences into predicate logic

a) Everyone who walks is calm.


b) If anyone cheats, he suffers.
c) Everyone loves Mary
Unification:

6. Determine whether the expression is unifiable, if yes give a most general


unifier

a) Problem: Unify "Likes(John, Mary)“ with "Likes(John, Sarah)".


b) Problem: Unify "LivesIn(John, City(x))" with "LivesIn(Sarah, City(London))".

c) Problem: Unify "Owns(Carol, Car(x))" with "Owns(Carol, Car(Toyota))".


d) Problem: Unify "WorksAt(Employee(x), Company(y))" with
"WorksAt(Employee(John), Company(CompanyA))".
FIRST ORDER LOGIC

7. Represent the following sentences in first-order logic, using a consistent


vocabulary that you must define:

a) Some students took French in Spring 2001.


b) Every student who takes French passes it.
c) Only one student took Greek in Spring 2001.
d) The best score in Greek is always higher than the best score in French.
8. Convert the following sentences in the propositional logic to clausal
form.

a) P <=>(Q ^ ~R).
b) W =>P.
c) R <=>S.
d) S =>P.
e) P =>(~(Q V W) V S)
RESOLUTION
Let's consider the statements:
1."All cats are animals."
2."No animals can fly."
And we'll aim to derive the negation of "No cats can fly" using resolution.

Negate the statement


Fact FOL CNF
(proof by contradiction)

1."All cats are animals." 1.∀x (Cat(x) → Animal(x)) ¬Cat(x)∨Animal(x) Cat(x)


2."No animals can fly." 2.∀x (Animal(x) →¬ CanFly(x)) ¬Animal(x)∨¬CanFly(x) ¬ CanFly(x)

9. Resolve the above and draw the resolution graph


SEMANTIC NET
.
11. Develop a semantic network for the following statement.

Jerry is a cat.
Jerry is a mammal
Jerry is owned by Priya.
Jerry is brown colored.
All Mammals are animal

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy