Bipartite Perfect Matching Benchmarks
暂无分享,去创建一个
[1] Randal E. Bryant,et al. Generating Extended Resolution Proofs with a BDD-Based SAT Solver , 2021, TACAS.
[2] Armin Biere,et al. Encoding Redundancy for Satisfaction-Driven Clause Learning , 2019, TACAS.
[3] Armin Biere,et al. PRuning Through Satisfaction , 2017, Haifa Verification Conference.
[4] Cesare Tinelli,et al. Introducing StarExec: a Cross-Community Infrastructure for Logic Solving , 2014, COMPARE.
[5] Armin Biere,et al. Detecting Cardinality Constraints in CNF , 2014, SAT.
[6] Daniel Le Berre,et al. The Sat4j library, release 2.2 , 2010, J. Satisf. Boolean Model. Comput..
[7] Gilles Audemard,et al. Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.
[8] Armin Biere,et al. Extended Resolution Proofs for Symbolic SAT Solving with Quantification , 2006, SAT.
[9] Armin Biere,et al. Extended Resolution Proofs for Conjoining BDDs , 2006, CSR.
[10] Carsten Sinz,et al. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.
[11] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.
[12] James M. Crawford,et al. Symmetry-Breaking Predicates for Search Problems , 1996, KR.
[13] William J. Cook,et al. On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..
[14] Armin Biere,et al. C A D I C A L, K ISSAT , P ARACOOBA , P LINGELING and T REENGELING Entering the SAT Competition 2020 , 2020 .
[15] Armin Biere. Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010 , 2010 .
[16] Michael Alekhnovich,et al. Mutilated chessboard problem is exponentially hard for resolution , 2004, Theor. Comput. Sci..
[17] Alasdair Urquhart,et al. Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .