Scribd
Upload
18 views14 pages

AI Presentation Vs

Uploaded by

PRINSHU TIWARI
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
18 views14 pages

AI Presentation Vs

Uploaded by

PRINSHU TIWARI
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/ 14

STITUTE OF ENGINEERING AND TECHNOLO

DR. RAMMANOHAR LOHIA AVADH UNIVERSITY


AYODHYA
Topic of presentation: Propositional logic
Subject: Artificial Intelligence

resented To: Presented By:


Dr. Avadhesh Kumar Dixit Rohan Yadav (22135)
ssistant Professor (C.S.E) Rishabh Sonkar (22133
CSE ( 3rd year)
Propositional Logic
Propositional logic (PL) is the simplest form of logic where all the
statements are made by propositions. Propositional logic is a kind of logic
whereby the expression that takes into consideration is referred to as a
proposition, which is a declarative statement that can be either true or
false but cannot be both at the same time.

It is a technique of knowledge representation in logical and mathematical


form. Propositional logic uses propositional symbols, connective symbols,
and parentheses to build up propositional logic expressions otherwise
referred to as propositions.

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.
Some basic facts about
propositional logic:
 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 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.
 A proposition formula which has both true and false values is called
contingency.
There are two types of
Propositions:
 Atomic Propositions
 Compound propositions

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.
Syntax of Propositional Logic
Propositional logic and its syntax describes systems of propositions
and methods for constructing well-formed propositions and
statements. The main components include:

Propositions: Denoted by capital letters (For example, P, Q).

Logical Connectives: Signs that are employed to join give


propositions (e.g., ∧, ∨, ¬).

Parentheses: Conventional operators are employed to identify the


sequence of operations and the hierarchy of various operators
existing in the syntax of computer programming languages.
Logical Connectives:
Logical connectives are used to connect two simpler propositions or representing a
sentence logically. We can create compound propositions with the help of logical
connectives.
There are mainly five connectives, which are given as follows:

1. Negation: A sentence such as ¬ P is called negation of P. A literal can be either


Positive literal or negative literal.

2.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.

3.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 Engineer",


4. 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 .

5. Biconditional: A biconditional that is true if both propositions are either true or


false together.

Example: “It is raining ↔ The ground is wet” is true if both are true or both are false.

Following is the summarized table for Propositional


Logic Connectives:
Truth Table: In propositional logic, we need to know the truth values of propositions
in all possible scenarios. We can combine all the possible combination with logical
connectives, and the representation of these combinations in a tabular format is called
Truth table.
Following are the truth table for all logical connectives:
Logical equivalence:
Logical equivalence is one of the features of propositional logic. Two
propositions are said to be logically equivalent if and only if the columns in
the truth table are identical to each other.

Let's take two propositions A and B, so for logical equivalence,


we can write it as A⇔B. In truth table we can see that column for ¬A∨ B and
A→B, are identical hence A is Equivalent to B.
Precedence of connectives:
Just like arithmetic operators, there is a precedence order for
propositional connectors
or logical operators. This order should be followed while evaluating a
propositional
problem.
Following is the list of the precedence order for operators:
Precedence Operators

First Precedence Parenthesis

Second Precedence Negation

Third Precedence Conjunction(AND)

Fourth Precedence Disjunction(OR)

Fifth Precedence Implication

Six Precedence Biconditional


Properties of Operators:
 Commutativity: Distributive:
 P∧ Q= Q ∧ P, or P∧ (Q ∨ R) = (P ∧ Q) ∨ (P ∧ R).
 P ∨ Q = Q ∨ P. P ∨ (Q ∧ R) = (P ∨ Q) ∧ (P ∨ R).

 Associativity: DE Morgan's Law:


 (P ∧ Q) ∧ R= P ∧ (Q ∧ R), ¬ (P ∧ Q) = (¬P) ∨ (¬Q)
 (P ∨ Q) ∨ R= P ∨ (Q ∨ R) ¬ (P ∨ Q) = (¬ P) ∧ (¬Q).

 Identity element: Double-negation elimination:


 P ∧ True = P, ¬ (¬P) = P.
 P ∨ True= True.
Applications of Propositional Logic in
AI
1. Knowledge Representation:
Propositional logic is used to represent knowledge in a structured and
unambiguous way. It allows AI systems to store and manipulate facts about
the world.

2. Problem Solving and Planning:


Propositional logic is fundamental in solving problems and planning actions. AI
planners use logical representations of actions, states, and goals to generate
sequences of actions that achieve desired outcomes.

3. Decision Making:
In decision-making processes, propositional logic helps AI systems evaluate
various options and determine the best course of action. Logical rules can
encode decision criteria, and truth tables can be used to assess the outcomes
of different choices.

4. Game Theory and Multi-Agent Systems:


In game theory and multi-agent systems, propositional logic is used to model
Limitations of Propositional
logic:
 We cannot represent relations like ALL, some, or none with
propositional logic.

Example:
a. All the girls are intelligent.
b. Some apples are sweet.

 Propositional logic has limited expressive power.

 In propositional logic, we cannot describe statements in terms of their


properties
or logical relationships.
THANK YOU !

You might also like