Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

Unsatisfability Checking

  • It is almost exactly the same as the validity checking method, except that it works negatively instead of positively.

  • To determine whether a finite set of sentences {φ1,…,φn} logically entails a sentence φ, we form the sentence

    1 ∧…∧ φn ∧ ¬ φ)

    and check that it is unsatisfiable .

  • Both the validity checking method and the satisfiability checking method require about the same amount of work as the truth table method, but they have the merit of manipulating only one table


Speaker notes:

Content Tools

Sources

There are currently no sources for this slide.