pith. sign in

arxiv: 1605.01622 · v1 · pith:CAWXVGTAnew · submitted 2016-05-05 · 💻 cs.LO · cs.AI

Improving abcdSAT by At-Least-One Recently Used Clause Management Strategy

classification 💻 cs.LO cs.AI
keywords abcdsatat-least-oneclausecompetitionrecentlystrategyusedagile
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.