Scribd
Upload
11 views

Fol

Uploaded by

sxthzz23
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
11 views

Fol

Uploaded by

sxthzz23
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/ 59

First Order Logic (FOL)

U or D
Inference in First-Order Logic

Substitution:

If we write F[a/x], so it refers to substitute a constant "a" in place of


variable "x".

Equality:

Brother (John) = Smith

￢ (x=y) which is equivalent to x ≠y

FOL inference rules for quantifier:


1. Universal Generalization:
2. Universal Instantiation:

Example: 2

"All kings who are greedy are


Evil"
3. Existential Instantiation:

Example:

From the given sentence: ∃x Crown(x) ∧ OnHead(x,


John)
4. Existential introduction
• Universal quantifier, Ɐ distributes over Ʌ
• Existential quantifier, ꓱ distributes over V
UNIFICATION
Generalized Modus Ponens
Rule
Resolution
Resolution is a theorem proving technique that proceeds by building
refutation proofs, i.e., proofs by contradictions. It was invented by a
Mathematician John Alan Robinson in the year 1965.

Resolution is a single inference rule which can efficiently operate


on the conjunctive normal form or clausal form.

Clause: Disjunction of literals (an atomic sentence) is called a


clause. It is also known as a unit clause.

Conjunctive Normal Form: A sentence represented as a conjunction of


clauses is said to be conjunctive normal form or CNF.
Steps for Resolution:

1.Conversion of facts into first-order logic

2. Convert FOL statements into CNF

3. Negate the statement which needs to prove (proof by


contradiction)

4. Draw resolution graph (unification).


Statements "food(Apple) Λ food(vegetables)" and "eats (Anil, Peanuts) Λ
alive(Anil)" can
be written in two separate statements.
Forward Chaining and backward
chaining

Forward Chaining

Forward chaining is a form of reasoning which start with atomic sentences in the knowledge
base and applies
inference rules (Modus Ponens) in the forward direction to extract more data until a goal is
reached.

The Forward-chaining algorithm starts from known facts, triggers all rules whose premises are
satisfied, and add their conclusion to the known facts. This process repeats until the problem
is solved.
ꓱ

Ɐ
Difference between backward chaining and forward
chaining

You might also like