Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

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


Math Forum » Discussions » sci.math.* » sci.math.independent

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

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
quasi

Posts: 10,226
Registered: 7/15/05
Re: Boolean satisfiability
Posted: Dec 12, 2013 6:13 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

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



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.