Very large MaxSAT instances, comprising 1020 clauses and beyond, commonly arise in a variety of domains. We present VOLT, a framework for solving such instances, using an iterative...
Ravi Mangal, Xin Zhang, Aditya V. Nori, Mayur Naik
Abstract. In incremental SAT solving, information gained from previous similar instances has so far been limited to learned clauses that are still relevant, and heuristic informati...
In this paper, we present SATGraf, a tool for visualizing the evolution of the structure of a Boolean SAT formula in real time as it is being processed by a conflict-driven clause...
Zack Newsham, William Lindsay, Vijay Ganesh, Jia H...
Abstract. The VSIDS (variable state independent decaying sum) decision heuristic invented in the context of the CDCL (conflict-driven clause learning) SAT solver Chaff, is consid...
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one...