Scribd
Upload
14 views

1 Knowledge Representation and Inference

The document discusses knowledge representation and inference. It covers key topics such as knowledge, intelligence, reasoning, inference, and different methods of knowledge representation including logic, rules, semantic networks, and frames. Specifically, it discusses propositional logic as the simplest form of logic where statements are either true or false. It provides examples of atomic and compound propositions, and explains the main logical connectives used in propositional logic - negation, conjunction, disjunction, implication, and biconditional.

Uploaded by

aniket jha
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
14 views

1 Knowledge Representation and Inference

The document discusses knowledge representation and inference. It covers key topics such as knowledge, intelligence, reasoning, inference, and different methods of knowledge representation including logic, rules, semantic networks, and frames. Specifically, it discusses propositional logic as the simplest form of logic where statements are either true or false. It provides examples of atomic and compound propositions, and explains the main logical connectives used in propositional logic - negation, conjunction, disjunction, implication, and biconditional.

Uploaded by

aniket jha
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/ 12

KNOWLEDGE REPRESENTATION AND INFERENCE

• Knowledge
• Intelligence
• Reasoning
• Inference
• Knowledge Representation
➢ Logic (prepositional and predicate logic)
➢ Rules (inference if-then rules)
➢ Semantic net
➢ Frames (slots and fillers)
➢ Scrips
Contents
• Introduction to Proportional logic
• Basic facts
• Syntax
• Logical Connectives
• Summary
Proportional 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.
• Example:
– a) It is Sunday.
– b) The Sun rises from West (False proposition)
– c) 3+3= 7(False proposition)
– d) 5 is a prime number.
Basic Facts
• Propositional logic is also called Boolean logic as it
works on 0 and 1.
• In propositional logic, we use symbolic variables to
represent the logic, and we can use any symbol for
a representing a proposition, such A, B, C, P, Q, R,
etc.
• Propositions can be either true or false, but it
cannot be both.
• Propositional logic consists of an object, relations
or function, and logical
• connectives.
These connectives are also called logical
• 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.
Statements which are questions, commands, or opinions are not
propositions such as "Where is Rohini", "How are you", "What
is your name", are not
propositions.
Syntax

• Atomic Proposition:
– Atomic propositions are the simple
– propositions.
It consists of a single proposition symbol. These are
the sentences which must be either true or false.

– Example:
• a) 2+2 is 4, it is an atomic proposition as it is a true fact.
• b) "The Sun is cold" is also a proposition as it is a false
.
fact
• Compound proposition:
– Compound propositions are constructed by
combining simpler or atomic propositions, using
parenthesis and logical
connectives.
– Example:
• a) "It is raining today, and street is wet."
• b) "Ankit is a doctor, and his clinic is in Mumbai."
Logical
Connectives:

• Logical connectives are used to connect two simpler


propositions or representing a sentence
• logically.
create compound propositions with the help of logical
connectives.
• There are mainly five
– Negation: A sentence such as ¬ P is called negation of P. A literal
connectives:
can be either Positive literal or negative
– literal.
Conjunction: A sentence which has ∧ connective such as, P ∧
Q is called a conjunction.
Example: Rohan is intelligent and hardworking. It can be written
as,
P= Rohan is intelligent,
Q= Rohan is hardworking. → P ∧ Q.
– Disjunction: A sentence which has ∨ connective,
such as P ∨ Q . is called disjunction, where P and Q
are the
propositions.
Example: "Ritika is a doctor or
Here P= Ritika is Doctor. Q= Ritika is Doctor, so we
Engineer",
can write it as P ∨ Q .
– Implication: A sentence such as P → Q, is called an
implication. Implications are also known as if-then rules.
• It can be represented as
If it is raining, then the street is wet.
Let P= It is raining, and Q= Street is wet, so it is
represented as P → Q
– Biconditional: A sentence such as ⇔Q is a
Biconditional
P sentence,
• example If I am breathing, then I am alive
P= I am breathing, Q= I am alive, it can be represented
as P ⇔Q.
Summarized table for
Connectives

You might also like