International Conference «Mathematical and Information Technologies, MIT-2016»
Kordić S.Application of Sedimentation Algorithm for Solving SAT and Max-SAT ProblemsThe paper presents further development of the Sedimentation Algorithm application for solving Boolean satisfiability problems. Sedimentation Algorithm is original general branch and bound algorithm, for finding exact solutions of a combinatorial optimisation problems, develop by the author and his co-workers. Alternative modelling of the SAT and Max-SAT problems enabled Sedimentation Algorithm to solve Boolean satisfiability more efficiently, compared to the early attempts to solve SAT and Max-SAT problems with Sedimentation Algorithm. Experimental results contain comparison between Sedimentation Algorithm based solver with the state-of-art SAT and Max-SAT solvers. To reports list |