Comparison of the Empirical Performance of Minisat and GSAT Solvers on SATLIB Benchmark

Authors

  • A.J. Kawu Gombe State University, Gombe State
  • G. M. Wajiga Modibbo Adama University Yola, Adamawa State
  • Y. M. Malgwi Modibbo Adama University Yola, Adamawa State

DOI:

https://doi.org/10.56892/bima.v8i1.626

Keywords:

Boolean Satisfiability, SAT solver, Stochastic Local Search, NP-Complete, Algorithms.

Abstract

In this study, the effectiveness of Minisat(Minimal SAT solver) and Greedy Randomized Adaptive Search (GSAT, Simulated Annealing option) solvers is compared on a number of SATLIB Benchmark problems. Gaining understanding of their effectiveness in resolving SAT cases was the main objective, with an emphasis on application and randomly generated instances. The experimentation showed that Minisat performed better than GSAT in every case, proving to have better solution abilities. A 2.40GHz Core i5 CPU, fitted in a Dell Latitude E7470 laptop, was used for the experiments. All things considered, this research helps to compare the strengths and weaknesses of the GSAT and Minisat solvers and provides insightful information about SAT problem-solving techniques.

 

Downloads

Published

2024-04-22

How to Cite

A.J. Kawu, G. M. Wajiga, & Y. M. Malgwi. (2024). Comparison of the Empirical Performance of Minisat and GSAT Solvers on SATLIB Benchmark. BIMA JOURNAL OF SCIENCE AND TECHNOLOGY (2536-6041), 8(1B), 197-205. https://doi.org/10.56892/bima.v8i1.626

Similar Articles

You may also start an advanced similarity search for this article.