Satisfiability Checking

Many problems in CS can be reduced to checking satisfiability of a propositional calculus formula.

Two efficient algorithms for satisfiability checking (SAT):

Contents    Page-10    Prev    Next    Page+10    Index