Difference between revisions of "Boolean satisfiability problem"
Karl Jones (Talk | contribs) (Created page with "In computer science, the '''Boolean Satisfiability Problem''' (sometimes called '''Propositional Satisfiability Problem''' and abbreviated as '''SATISFIABILITY''' or '''SA...") |
Karl Jones (Talk | contribs) |
||
| Line 9: | Line 9: | ||
SAT is one of the first problems that was proven to be [[NP-completeness|NP-complete]]. This means that all problems in the complexity class NP, which includes a wide range of natural decision and optimization problems, are at most as difficult to solve as SAT. | SAT is one of the first problems that was proven to be [[NP-completeness|NP-complete]]. This means that all problems in the complexity class NP, which includes a wide range of natural decision and optimization problems, are at most as difficult to solve as SAT. | ||
| − | There is no known algorithm that efficiently solves each SAT problem, and it is generally believed that no such algorithm exists; yet this belief has not been proven mathematically, and resolving the question whether SAT has a polynomial-time algorithm is equivalent to the P versus NP problem, which is a famous open problem in the | + | There is no known algorithm that efficiently solves each SAT problem, and it is generally believed that no such algorithm exists; yet this belief has not been proven mathematically, and resolving the question whether SAT has a polynomial-time algorithm is equivalent to the P versus NP problem, which is a famous open problem in the theory of computing. |
| − | Nevertheless today's heuristical SAT-algorithms are able to solve problem instances involving tens of thousands of variables and formulas consisting of millions of symbols, | + | Nevertheless today's heuristical SAT-algorithms are able to solve problem instances involving tens of thousands of variables and formulas consisting of millions of symbols, which is sufficient for many practical SAT problems from e.g. [[artificial intelligence]], circuit design, and [[automatic theorem proving]]. |
== See also == | == See also == | ||
Latest revision as of 15:17, 6 September 2016
In computer science, the Boolean Satisfiability Problem (sometimes called Propositional Satisfiability Problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula.
Description
In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE.
If this is the case, the formula is called satisfiable. On the other hand, if no such assignment exists, the function expressed by the formula is FALSE for all possible variable assignments and the formula is unsatisfiable. For example, the formula "a AND NOT b" is satisfiable because one can find the values a = TRUE and b = FALSE, which make (a AND NOT b) = TRUE. In contrast, "a AND NOT a" is unsatisfiable.
SAT is one of the first problems that was proven to be NP-complete. This means that all problems in the complexity class NP, which includes a wide range of natural decision and optimization problems, are at most as difficult to solve as SAT.
There is no known algorithm that efficiently solves each SAT problem, and it is generally believed that no such algorithm exists; yet this belief has not been proven mathematically, and resolving the question whether SAT has a polynomial-time algorithm is equivalent to the P versus NP problem, which is a famous open problem in the theory of computing.
Nevertheless today's heuristical SAT-algorithms are able to solve problem instances involving tens of thousands of variables and formulas consisting of millions of symbols, which is sufficient for many practical SAT problems from e.g. artificial intelligence, circuit design, and automatic theorem proving.
See also
- Circuit satisfiability
- Counting SAT
- Karloff–Zwick algorithm
- Satisfiability Modulo Theories
- Unsatisfiable core
External links
- Boolean satisfiability poblem @ Wikipedia
