Building Structure into Local Search for SAT
暂无分享,去创建一个
[1] Abdul Sattar,et al. SAT-Based versus CSP-Based Constraint Weighting for Satisfiability , 2005, AAAI.
[2] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.
[3] Zhe Wu,et al. Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems , 2005, Journal of Computer Science and Technology.
[4] ZheWu. Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems , 2005 .
[5] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[6] Holger H. Hoos,et al. UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT , 2004, SAT.
[7] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[8] Lakhdar Sais,et al. Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.
[9] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[10] Igor L. Markov,et al. Solving difficult SAT instances in the presence of symmetry , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).
[11] Sharad Malik,et al. Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[12] Ramón Béjar,et al. Solving the Round Robin Problem Using Propositional Logic , 2000, AAAI/IAAI.
[13] Bart Selman,et al. Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.
[14] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[15] Henry Kautz,et al. Pushing the envelope: planning , 1996 .
[16] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.