introduction to logic

1. Introduction to Logic
Lecture-30
Hema Kashyap
1

2. Introduction
• Logic is the expression given to the reasoning process
performed by mind in the form of symbolic language of
a calculus.
• Logic is the language used to represent facts.
• The elementary knowledge representation
methodologies are:
– Representation using binary numbers
– Representation as a set of pixels
– Representation in graphical form
– Representation in propositional logic
– Representation in predicate logic
– Representation through semantic nets
– Representation using conceptual dependency structures.
2

3. Introduction
• A knowledge representation technique should have
following characteristics:
– It should be adequate to express all the necessary information
– It should provide natural scheme for expressing the required
knowledge
– It should support efficient execution for inferencing purpose.
• Logic is a formal language to represent knowledge and
facts. There are two types of logic used in the field of AI:
– Propositional logic or propositional calculus
– Predicate calculus
3

4. Propositional Calculus
• Propositions are statements or sentences and is
classified as declarative sentence whose value is
either ‘true’ or ‘false’.
• Propositions can be atomic propositions
– Ex: New Delhi is the capital of India
– The squareroot of 4 is 2.
– No, thank you!
• and molecular /complex propositions
– Ex: Sachin Tendulkar is a cricketer and Steffi Graf is a
tennis player.
4

5. Propositional Calculus
5

6. Syntax of propositional Calculus
• Atomic Symbols:
6

7. Syntax of propositional Calculus
• Logical Connectives:
7

8. 8

9. Semantics of propositional Calculus
• Semantics or the meaning of these sentences or assigning true or false values to
these sentences
• The truth value assignment to a propositional sentence is called Interpretation,
which is an assertion about the its truthness.
• In simple words, interpretation determines the truth value of a statement. The
interpretation of the truth value for sentences is determined by :
9

10. p q ¬p p ∧q p∨q p ←q p →q p ↔q
true true false true true true true true
true false false false true true false false
false true true false true false true false
false false true false false true true true
Note that we only talk about the truth value in an
interpretation. Propositions may have different truth values
in different interpretations.
10

11. Example
11

12. Semantics of Propositional Calculus
• Logical operators define by truth tables
• Conjunction
12

13. • Disjunction:
• Implication:
• Biconditional:
13

14. • Example : Suppose there are three atoms: ai_is_fun, happy,
andlight_on.Suppose
interpretation I1 assigns true to ai_is_fun, false to happy,
and true to light_on. That is, I1 is defined by the function π1 defined
by π1(ai_is_fun)=true, π1(happy)=false, and π1(light_on)=true. Then
 ai_is_fun is true in I1.
 ¬ai_is_fun is false in I1.
 happy is false in I1.
 ¬happy is true in I1.
 ai_is_fun∨happy is true in I1.
 ai_is_fun ←happy is true in I1.
 happy ←ai_is_fun is false in I1.
 ai_is_fun ←happy ∧light_on is true in I1.
14

15. • Supposesinterpretation I2 assigns false to ai_is_fu
n, true to happy, and false to light_on:
ai_is_fun is false in I2.
¬ai_is_fun is true in I2.
happy is true in I2.
¬happy is false in I2.
ai_is_fun∨happy is true in I2.
ai_is_fun ←happy is false in I2.
ai_is_fun ←light_on is true in I2.
ai_is_fun ←happy ∧light_on is true in I2.
15