Trap Avoidance in Local Search Using Pseudo-Conflict Learning
暂无分享,去创建一个
[1] Kevin Leyton-Brown,et al. SATenstein: Automatically Building Local Search SAT Solvers from Components , 2009, IJCAI.
[2] Edward A. Hirsch,et al. UnitWalk: A new SAT solver that uses local search guided by unit clause elimination , 2005, Annals of Mathematics and Artificial Intelligence.
[3] Hantao Zhang,et al. Another Complete Local Search Method for SAT , 2005, LPAR.
[4] Bart Selman,et al. Accelerating Random Walks , 2002, CP.
[5] Harry Zhang,et al. Combining Adaptive Noise and Look-Ahead in Local Search for SAT , 2007, SAT.
[6] Steven David Prestwich,et al. SAT problems with chains of dependent variables , 2003, Discret. Appl. Math..
[7] Lakhdar Sais,et al. Boosting complete techniques thanks to local search methods , 1998, Annals of Mathematics and Artificial Intelligence.
[8] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[9] Xiao Yu,et al. QingTing : A Fast SAT Solver Using Local Search and Efficient Unit Propagation , 2003 .
[10] Chu Min Li,et al. Diversification and Determinism in Local Search for Satisfiability , 2005, SAT.
[11] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[12] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[13] Steven David Prestwich,et al. Random Walk with Continuously Smoothed Variable Weights , 2005, SAT.
[14] Wheeler Ruml,et al. Complete Local Search for Propositional Satisfiability , 2004, AAAI.
[15] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.
[16] Adrian Balint,et al. Improving Stochastic Local Search for SAT with a New Probability Distribution , 2010, SAT.
[17] Lakhdar Sais,et al. Boosting Local Search Thanks to cdcl , 2010, LPAR.
[18] Zbigniew Stachniak,et al. Depth-Driven Circuit-Level Stochastic Local Search for SAT , 2011, IJCAI.
[19] Harry Zhang,et al. A Switching Criterion for Intensification and Diversification in Local Search for SAT , 2008, J. Satisf. Boolean Model. Comput..
[20] Abdul Sattar,et al. Combining Adaptive and Dynamic Local Search for Satisfiability , 2008, J. Satisf. Boolean Model. Comput..
[21] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[22] Abdul Sattar,et al. Building Structure into Local Search for SAT , 2007, IJCAI.
[23] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[24] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[25] Matthias F. Stallmann,et al. QingTing: A Local Search SAT Solver Using an Efiective Switching Strategy and an E-cient Unit Propagation , 2003 .
[26] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[27] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[28] Weixiong Zhang,et al. Backbone Guided Local Search for Maximum Satisfiability , 2003, IJCAI.