File Exchange

image thumbnail

SAT solver by CE & BK algorithms

version (275 KB) by Sebastien PARIS
Solve SAT problems with 2 stochastic solvers : CE & BK algorithms

1 Download

Updated 02 Nov 2010

View License

SAT solvers by Cross-Entropy (CE) and a Botev-Kroeze (BK) optimization algorithms

CNF SAT problems can be formulated as :

S(X)=sum(j=1,...,m)C_j, where C_j=max(0 , (2X_i-1)*Aji

Please run the demo files


In order to compile mex-files on your platform, please run first

mexme_cebk_sat.m (be sure that mex -setup is done before)

Comments and Ratings (0)


-Compatible with Linux64 & GCC
-Add mexme_cebk_sat.m

- Must compile with non-C99 compiler

-Improve CE parse inputs

MATLAB Release Compatibility
Created with R2007b
Compatible with any release
Platform Compatibility
Windows macOS Linux