Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Boolean satisfiability
Replies: 6   Last Post: Dec 16, 2013 6:57 AM

 Messages: [ Previous | Next ]
 quasi Posts: 12,067 Registered: 7/15/05
Re: Boolean satisfiability
Posted: Dec 12, 2013 6:13 AM

Steeve Beroard wrote:
>
>So you mean by stating that "any unsatisfiable CNF is equivalent
>to a CNF with all combination of variables and their negation"
> s to give a particular method of resolution?

Not exactly.

In general, the new CNF will have exponential size relative to
the size of the original CNF, so any particular method used to
determine its satisfiability will have exponential time cost
relative to the size of the original CNF (not necessarily
exponential relative to its own size, but that's irrelevant).

Rather than talk about it abstractly, take an actual example
so you can compare the sizes of the two CNFs.

quasi

Date Subject Author
12/11/13 steeve.beroard@gmail.com
12/11/13 quasi
12/11/13 steeve.beroard@gmail.com
12/12/13 quasi
12/12/13 steeve.beroard@gmail.com
12/12/13 quasi
12/16/13 steeve.beroard@gmail.com