| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
07 February 2025 |
|
| | | |
|
Article overview
| |
|
On non-canonical solving the Satisfiability problem | Anatoly D. Plotnikov
; | Date: |
1 Aug 2015 | Abstract: | We study the non-canonical method for solving the Satisfiability problem
which given by a formula in the form of the conjunctive normal form. The
essence of this method consists in counting the number of tuples of Boolean
variables, on which at least one clause of the given formula is false. On this
basis the solution of the problem obtains in the form YES or NO without
constructing tuple, when the answer is YES. It is found that if the clause in
the given formula has pairwise contrary literals, then the problem can be
solved efficiently. However, when in the formula there are a long chain of
clauses with pairwise non-contrary literals, the solution leads to an
exponential calculations. | Source: | arXiv, 1508.0123 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|