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)
Sebastien PARIS (2021). SAT solver by CE & BK algorithms (https://www.mathworks.com/matlabcentral/fileexchange/21259-sat-solver-by-ce-bk-algorithms), MATLAB Central File Exchange. Retrieved .
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!