Extreme Cases in SAT Problems
暂无分享,去创建一个
[1] Marijn J. H. Heule,et al. March_dl: Adding Adaptive Heuristics and a New Branching Strategy , 2006, J. Satisf. Boolean Model. Comput..
[2] Karem A. Sakallah,et al. GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.
[3] Marius Thomas Lindauer,et al. A Portfolio Solver for Answer Set Programming: Preliminary Report , 2011, LPNMR.
[4] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[5] Kevin Leyton-Brown,et al. SATzilla: Portfolio-based Algorithm Selection for SAT , 2008, J. Artif. Intell. Res..
[6] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[7] Yuri Malitsky,et al. Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering , 2013, IJCAI.
[8] Gilles Audemard,et al. Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.
[9] Laurent Simon,et al. The Essentials of the SAT 2003 Competition , 2003, SAT.
[10] Armin Biere,et al. Inprocessing Rules , 2012, IJCAR.
[11] Daniel Le Berre. Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..
[12] Gilles Audemard,et al. Refining Restarts Strategies for SAT and UNSAT , 2012, CP.
[13] Adnan Darwiche,et al. A Lightweight Component Caching Scheme for Satisfiability Solvers , 2007, SAT.
[14] Gilles Dequen,et al. A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.
[15] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[16] David Zuckerman,et al. Optimal speedup of Las Vegas algorithms , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[17] Maurizio Gabbrielli,et al. SUNNY: a Lazy Portfolio Approach for Constraint Solving , 2014, Theory Pract. Log. Program..