C A D I C A L, K ISSAT , P ARACOOBA , P LINGELING and T REENGELING Entering the SAT Competition 2020
暂无分享,去创建一个
Armin Biere | Mathias Fleury | Katalin Fazekas | Maximilian Heisinger | Armin Biere | M. Fleury | Katalin Fazekas | Maximilian Heisinger
[1] Roberto J. Bayardo,et al. Fast Algorithms for Finding Extremal Sets , 2011, SDM.
[2] Armin Biere,et al. Revisiting Hyper Binary Resolution , 2013, CPAIOR.
[3] Marijn J. H. Heule,et al. Truth Assignments as Conditional Autarkies , 2019, ATVA.
[4] Armin Biere,et al. Splatz , Lingeling , Plingeling , Treengeling , YalSAT Entering the SAT Competition 2016 , 2016 .
[5] Fabio Somenzi,et al. On-the-Fly Clause Improvement , 2009, SAT.
[6] Fan Xiao,et al. Clause Vivification by Unit Propagation in CDCL SAT Solvers , 2020, Artif. Intell..
[7] Armin Biere,et al. CADICAL at the SAT Race 2019 , 2019 .
[8] Fan Xiao,et al. An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers , 2017, IJCAI.
[9] Armin Biere,et al. Distributed Cube and Conquer with Paracooba , 2020, SAT.
[10] Armin Biere,et al. Backing Backtracking , 2019, SAT.
[11] Lakhdar Sais,et al. Learning for Dynamic Subsumption , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.
[12] Armin Biere,et al. Decomposing SAT Problems into Connected Components , 2006, J. Satisf. Boolean Model. Comput..
[13] Chanseok Oh. Between SAT and UNSAT: The Fundamental Difference in CDCL SAT , 2015, SAT.
[14] Armin Biere,et al. Incremental Inprocessing in SAT Solving , 2019, SAT.
[15] Marijn J. H. Heule,et al. March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver , 2004, SAT (Selected Papers.
[16] Armin Biere,et al. Inprocessing Rules , 2012, IJCAR.
[17] Alexander Nadel,et al. Chronological Backtracking , 2018, International Conference on Theory and Applications of Satisfiability Testing.