Improving abcdSAT by At-Least-One Recently Used Clause Management Strategy
This work provides incremental improvements to a SAT solver for competition purposes.
The authors improved the 2015 version of abcdSAT, a SAT solver, by adding heuristics like an at-least-one recently used clause management strategy and learnt clause database approximation reduction, and developed three versions (drup, inc, lim) for different tracks at the SAT Competition 2016.
We improve further the 2015 version of abcdSAT by various heuristics such as at-least-one recently used strategy, learnt clause database approximation reduction etc. Based on the requirement of different tracks at the SAT Competition 2016, we develop three versions of abcdSAT: drup, inc and lim, which participate in the competition of main (agile), incremental library and no-limit track, respectively.