A comprehensive study and analysis on SAT-solvers: advances, usages and achievements

Abstract

Boolean satisfiability (SAT) has been studied for the last twenty years. Advances have been made allowing SAT solvers to be used in many applications including formal verification of digital designs. However, performance and capacity of SAT solvers are still limited. From the practical side, many of the existing applications based on SAT solvers use them as… (More)
DOI: 10.1007/s10462-018-9628-0

10 Figures and Tables

Topics

  • Presentations referencing similar topics