Old Resolution Meets Modern SLS
暂无分享,去创建一个
[1] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[2] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[3] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[4] Byungki Cha,et al. Adding New Clauses for Faster Local Search , 1996, AAAI/IAAI, Vol. 1.
[5] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .
[6] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[7] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[8] Dale Schuurmans,et al. The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming , 2001, IJCAI.
[9] Holger H. Hoos,et al. Warped Landscapes and Random Acts of SAT Solving , 2004, AI&M.
[10] Holger H. Hoos,et al. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.
[11] Masayuki Fujita,et al. Automatic Generation of Some Results in Finite Algebra , 1993, IJCAI.
[12] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[13] Zhe Wu,et al. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems , 2000, AAAI/IAAI.
[14] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[15] Thomas Stützle,et al. Stochastic Local Search , 2007, Handbook of Approximation Algorithms and Metaheuristics.
[16] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[17] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[18] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[19] Wheeler Ruml,et al. Complete Local Search for Propositional Satisfiability , 2004, AAAI.
[20] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[21] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[22] Ian P. Gent,et al. Unsatisfied Variables in Local Search , 1995 .
[23] Alain Billionnet,et al. An efficient algorithm for the 3-satisfiability problem , 1992, Oper. Res. Lett..