Encyclopedia > Satisfiability problem

  Article Content


Redirected from Satisfiability problem

In mathematics, a formula of propositional logic is said to be satisfiable if truth-values can be assigned to its free variables in a way that makes the formula true. The class of satisfiable formulas of propositional logic is NP-complete, as is that of its variant 3-satisfiability[?].

(There is also such a thing as satisfiability of formulas of first-order and second-order logic.)

Compare with: decision problem

External links

All Wikipedia text is available under the terms of the GNU Free Documentation License

  Search Encyclopedia

Search over one million articles, find something about almost anything!
  Featured Article
Islandia, New York

... are 65 years of age or older. The median age is 36 years. For every 100 females there are 92.3 males. For every 100 females age 18 and over, there are 88.8 males. The ...

This page was created in 39.6 ms