Scribd
Upload
18 views18 pages

Unit 301 KBA Proposition Logic

Knowledge representation and reasoning (KRR) is a key aspect of artificial intelligence that focuses on how AI agents think and behave intelligently. It involves representing various types of knowledge, including objects, events, performance, and facts, within a knowledge base that agents use to reason and update their knowledge. Logical representations, such as propositional and first-order logic, are utilized to express knowledge clearly and derive new information through inference rules.

Uploaded by

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

Unit 301 KBA Proposition Logic

Knowledge representation and reasoning (KRR) is a key aspect of artificial intelligence that focuses on how AI agents think and behave intelligently. It involves representing various types of knowledge, including objects, events, performance, and facts, within a knowledge base that agents use to reason and update their knowledge. Logical representations, such as propositional and first-order logic, are utilized to express knowledge clearly and derive new information through inference rules.

Uploaded by

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

UNIT-3

Knowledge Representation and


Reasoning

Dr. Manu Gupta


What is knowledge representation?

• Knowledge representation and reasoning (KR,


KRR) is the part of Artificial intelligence which
concerned with AI agents thinking and how
thinking contributes to intelligent behaviour of
agents.
Kind of Knowledge: What to Represent
Following are the kind of knowledge which needs to be represented in AI systems:

• Object: All the facts about objects in our world domain. E.g., Guitars contains
strings, trumpets are brass instruments.

• Events: Events are the actions which occur in our world.

• Performance: It describe behavior which involves knowledge about how to do


things.

• Meta-knowledge: It is knowledge about what we know.

• Facts: Facts are the truths about the real world and what we represent.

• Knowledge-Base: The central component of the knowledge-based agents is the


knowledge base. It is represented as KB. The Knowledgebase is a group of the
Sentences
Types of knowledge
Knowledge-Based Agent in Artificial
intelligence

• Knowledge-based agents are those agents who have the


capability of maintaining an internal state of knowledge,
reason over that knowledge, update their knowledge after
observations and take actions.

• Knowledge-based agents are composed of two main parts:


– Knowledge-base and
– Inference system.
The architecture of knowledge-based
agent
Knowledge-based agent
• Why use a knowledge base?
– Knowledge-base is required for updating knowledge for an
agent to learn with experiences and take action as per the
knowledge.

• Inference system
– Inference means deriving new sentences from old. Inference
system allows us to add a new sentence to the knowledge
base.
– Inference system generates new facts so that an agent can
update the KB.
Logical Representation

• Logical representation is a language with some


concrete rules which deals with propositions
and has no ambiguity in representation.

• Logical representation can be categorized into


mainly two logics:
– Propositional Logics
– Predicate logics
Propositional logic
• Propositional logic (PL) is the simplest form of logic
where all the statements are made by propositions.

• A proposition is a declarative statement which is


either true or false. It is a technique of knowledge
representation in logical and mathematical form.

• Propositional logic is also called Boolean logic as it works on 0


and 1.
Propositional logic
• Propositional logic consists of an object, relations or function,
and logical connectives.

• These connectives are also called logical operators.


• The propositions and connectives are the basic elements of
the propositional logic.
• Connectives can be said as a logical operator which connects
two sentences.
• A proposition formula which is always true is called tautology,
and it is also called a valid sentence.
• A proposition formula which is always false is
called Contradiction.
Inference rules
• Inference rules are the templates for generating valid arguments.
Inference rules are applied to derive proofs in artificial intelligence, and
the proof is a sequence of the conclusion that leads to the desired goal.

.
First-Order logic:

• First-order logic is another way of knowledge


representation in artificial intelligence. It is an
extension to propositional logic.
• FOL is sufficiently expressive to represent the natural
language statements in a concise way.
• First-order logic is also known as Predicate logic or
First-order predicate logic. First-order logic is a
powerful language that develops information about
the objects in a more easy way and can also express
the relationship between those objects.
First-Order logic:
• First-order logic (like natural language) does not
only assume that the world contains facts like
propositional logic but also assumes the following
things in the world:
– Objects: A, B, people, numbers, colors, wars,
theories, squares, pits, wumpus,
– Relations: It can be unary relation such as: red,
round, is adjacent, or n-any relation such
as: the sister of, brother of, has color, comes
between
– Function: Father of, best friend, third inning of,
end of.
Quantifiers in First-order logic:
• These are the symbols that permit to determine or identify
the range and scope of the variable in the logical expression.
There are two types of quantifier:
– Universal Quantifier, (for all, everyone, everything)
– Existential quantifier, (for some, at least one).
Universal quantifier is a symbol of logical representation, which
specifies that the statement within its range is true for
everything or every instance of a particular thing.
• The Universal quantifier is represented by a symbol ∀, which
resembles an inverted A.
Example: ∀x man(x) → drink (x, coffee).
It will be read as: There are all x where x is a man who
drink coffee.
Quantifiers in First-order logic:
Existential quantifiers are the type of
quantifiers, which express that the statement
within its scope is true for at least one
instance of something.
• It is denoted by the logical operator ∃, which
resembles as inverted E.
Example: ∃x: boys(x) ∧ intelligent(x)
It will be read as: There are some x where x is a
boy who is intelligent.

You might also like