Propagating faster
Propagation (BCP) in SAT is the single most expensive operation. The algorithm essentially does the following: [crayon-565c596794e83358312048/] where the function prop_confl() executes the propagation...
View ArticleTransitive OTF self-subsuming resolution
The title may be a bit long, but its essence is very simple: we try to shorten learnt clauses. The basic idea was described in this post: there is a clause we just derived, e.g. d V -e V f V g (1)...
View ArticleCaching
“Representation is the essence of programming” Frederic P. Brooks Jr., “The Mythical Man-month” Looking through the literature on SAT solvers, it is rare to find any algorithm that uses a form of...
View ArticleFailed literal probing and UIP
I have just realised that CryptoMiniSat, having won a number of medals, does one of the most basic things, failed literal probing, all wrong. Let me tell you why it’s all wrong. In essence, failed...
View ArticleCryptoMinisat 3.1 released
CryptoMinisat 3.1 has been released. The short changelog is: [crayon-565c596791c90510328471/] The changes made were threefold. First, memory usage has been greatly reduced. This is crucial, because...
View Article
