论文信息 - MiniSAT BCD and abcdSAT : Solvers Based on Blocked Clause Decomposition

MiniSAT BCD and abcdSAT : Solvers Based on Blocked Clause Decomposition

MiniSAT bcd and abcdSAT are submitted to SAT Race 2015. They both are based on blocked clause decomposition (BCD). Except for that the learnt clause database maintenance is different, their solving policy are the same.

Jingchao Chen

[1] Jingchao Chen. A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers , 2014, TAMC.

[2] Armin Biere,et al. Revisiting Hyper Binary Resolution , 2013, CPAIOR.

[3] Armin Biere,et al. Detecting Cardinality Constraints in CNF , 2014, SAT.

[4] Gilles Audemard,et al. Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[5] Jingchao Chen. Fast Blocked Clause Decomposition with High Quality , 2015, ArXiv.

[6] Armin Biere,et al. Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) , 2014, SAT.