no code implementations • 27 Mar 2023 • Md Solimul Chowdhury, Cayden R. Codel, Marijn J. H. Heule
The Divide and Distribute Fixed Weights algorithm (ddfw) is a dynamic local search SAT-solving algorithm that transfers weight from satisfied to falsified clauses in local minima.
1 code implementation • 10 May 2021 • Md Solimul Chowdhury, Martin Müller, Jia You
We also show an important connection between consecutive clauses learned within the same mc decision, where one learned clause triggers the learning of the next one forming a chain of clauses.
no code implementations • 25 Apr 2019 • Md Solimul Chowdhury, Martin Müller, Jia-Huai You
We first show experimentally, by running the state-of-the-art CDCL SAT solver MapleLCMDist on benchmarks from SAT Competition-2017 and 2018, that branching decisions with glue variables are categorically more inference and conflict efficient than nonglue variables.
no code implementations • 21 May 2018 • Md Solimul Chowdhury, Victor Silva
In this evolutionary approach, a space of algorithms is defined over a set of building blocks published algorithms and a simulated evolution is used to recombine these building blocks to find out the best algorithm from that space of algorithms.
