PROPOSITIONAL LOGIC

PREDICATE LOGIC
AND
SEMANTIC NETWORK

#it’s components, types of relationships, type of nodes generic and individual examples
 #PROPOSITIONAL LOGIC
Logic is the basis of all mathematical reasoning, and of all automated reasoning. The rules
of logic specify the meaning of mathematical statements. These rules help us understand
and reason with statements such as

What is a proposition? A proposition is the basic building block of logic. It is defined as a

declarative sentence that is either True or False, but not both. The Truth Value of a
proposition is True(denoted as T) if it is a true statement, and False(denoted as F) if it is a
false statement.
For Example,
1. The sun rises in the East and sets in the West.
2. 1 + 1 = 2
3.'b' is a vowel.
Truth Tables:-
1).Negation 2).Conjunction 3. Disjunction 4. Implication 5. Double Implication

6). Exclusive Or
 PREDICATE LOGIC:
Predicate Logic deals with predicates, which are propositions, consist of variables
A predicate is an expression of one or more variables determined on some specific domain. A predicate with
variables can be made a proposition by either authorizing a value to the variable or by quantifying the variable.
•Consider E(x, y) denote "x = y"
•Consider X(a, b, c) denote "a + b + c = 0"
•Consider M(x, y) denote "x is married to y."

Quantifiers:
• The variable of predicates is quantified by quantifiers. There are two types of quantifier in predicate logic -
Existential Quantifier and Universal Quantifier.
Existential Quantifier:-
• If p(x) is a proposition over the universe U. Then it is denoted as ∃x p(x) and read as "There exists at least one
value in the universe of variable x such that p(x) is true. The quantifier ∃ is called the existential quantifier.
• There are several ways to write a proposition, with an existential quantifier, i.e.,
(∃x∈A)p(x) or ∃x∈A such that p (x) or (∃x)p(x) or p(x) is true for some x ∈A.
If p(x) is a proposition over the universe U. Then it is denoted as ∀pep(x) and read as "For every x∈U,p(x) is true."
The quantifier ∀ is called the Universal Quantifier
There are several ways to write a proposition, with a universal quantifier.

∀x∈A,p(x) or p(x), ∀x ∈A Or ∀x,p(x) or p(x) is true for all x ∈A.

Negation of Quantified Propositions:

When we negate a quantified proposition, i.e., when a universally quantified proposition is negated, we obtain an
existentially quantified proposition,and when an existentially quantified proposition is negated, we obtain a
universally quantified proposition.
The two rules for negation of quantified proposition are as follows. These are also called DeMorgan's Law.

2.
 SEMANTIC NETWORK
As stated earlier, the semantic network is a simple knowledge representation technique. It
uses graphic notation to represent knowledge or data, wherein a graph of labeled nodes and labels
are used, with directed arcs to encode knowledge. It follows a simple and comprehensible architecture,
which helps add and change information efficiently.
 ACKNOWLEDGEMENT
We will like to thank Mrs. Saroj Shambarkar madam who give us a wonderful opportunity to
express ourself in front of others and the rest of the thanks is for my friends who listen our
presentation very carefully

Thank You