The most basic algorithm for categorizing formulae is the
truth-table algorithm. Propositional logic is ``nice.''

Therefore, satisfiable, not valid.
- sound: gives only correct answers
- complete: always gives an answer
- not efficient: exponential time, 2n table entries
Next: Applying Search to SAT
Up: SATISFIABILITY
Previous: Categories of Formulae