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 or returns a conflict, if necessary. The problem with the above function is that clauses come in all shapes and sizes. In CryptoMiniSat, there are two kinds of clauses, normal clauses […]
↧
