Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    8.resolution Principle

    Uploaded by

    S.M. SIAM
    This document discusses resolution principle, which is a logical inference rule used to deduce logical consequences from a set of premises. It defines several rules of inference like modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, addition, simplification, and conjunction. It then explains resolution algorithm which works by using proof by contradiction - negating the conclusion and applying resolution rule to resulting clauses until an empty clause is derived, showing the negation is invalid. Finally, it mentions types of resolution like binary, unit resulting, linear, and linear input resolution and provides a reference for more details.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    8.resolution Principle

    Uploaded by

    S.M. SIAM
    24 views19 pages
    This document discusses resolution principle, which is a logical inference rule used to deduce logical consequences from a set of premises. It defines several rules of inference like modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, addition, simplification, and conjunction. It then explains resolution algorithm which works by using proof by contradiction - negating the conclusion and applying resolution rule to resulting clauses until an empty clause is derived, showing the negation is invalid. Finally, it mentions types of resolution like binary, unit resulting, linear, and linear input resolution and provides a reference for more details.

    Original Description:

    Original Title

    8.Resolution Principle

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document discusses resolution principle, which is a logical inference rule used to deduce logical consequences from a set of premises. It defines several rules of inference like modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, addition, simplification, and conjunction. It then explains resolution algorithm which works by using proof by contradiction - negating the conclusion and applying resolution rule to resulting clauses until an empty clause is derived, showing the negation is invalid. Finally, it mentions types of resolution like binary, unit resulting, linear, and linear input resolution and provides a reference for more details.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    24 views19 pages

    8.resolution Principle

    Uploaded by

    S.M. SIAM
    This document discusses resolution principle, which is a logical inference rule used to deduce logical consequences from a set of premises. It defines several rules of inference like modus ponens, modus tollens, hypothetical syllogism, disjunctive syllogism, addition, simplification, and conjunction. It then explains resolution algorithm which works by using proof by contradiction - negating the conclusion and applying resolution rule to resulting clauses until an empty clause is derived, showing the negation is invalid. Finally, it mentions types of resolution like binary, unit resulting, linear, and linear input resolution and provides a reference for more details.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 19

    Resolution Principle

    Mahit Kumar Paul


    Assistant Professor, Dept. of CSE
    RUET, Rajshahi-6204
    mahit.cse@gmail.com

    2023-01-03 1
    Rules of Inference
    Rule of inference Tautology Name
    pq
    p [ p  ( p  q)]  q Modus ponens
    q
    q
    pq [q  ( p  q)]  p Modus tollen
     p
    pq
    qr [( p  q)  (q  r )]  ( p  r ) Hypothetical syllogism
    pr
    pq
    p (( p  q)  p)  q Disjunctive syllogism
    q
    p
    p  ( p  q) Addition
    pq
    pq
    ( p  q)  p Simplification
    p
    p
    q (( p)  (q))  ( p  q) Conjunction
    pq
    pq
    p  r [( p  q)  (p  r )]  (q  r ) Resolution
    2023-01-03 2
    q  r
    Resolution Algorithm
    • Resolution basically works by using the principle of proof by
    contradiction.
    • To find the conclusion we should negate the conclusion.
    • Then the resolution rule is applied to the resulting clauses.
    • Each clause that contains complementary literals is resolved to
    produce a two new clause, which can be added to the set of facts (if
    it is not already present).
    • This process continues until one of the two things happen:
     There are no new clauses that can be added
     An application of the resolution rule derives the empty clause
    • An empty clause shows that the negation of the conclusion is a
    complete contradiction, hence the negation of the conclusion is
    invalid or false or the assertion is completely valid or true.
    http://aimaterials.blogspot.com/p/resolution.html
    Resolution-Example
    Resolution-Example…
    Resolution-Example…
    Types of Resolution

     Binary Resolution
     Unit Resulting (UR) Resolution
     Linear Resolution
     Linear Input Resolution

    Reference: AI & Expert Systems


    -- DAN. W. PATTERSON
    2023-01-03 19

    You might also like