SAT-Based versus CSP-Based Constraint Weighting for Satisfiability
暂无分享,去创建一个
[1] Holger H. Hoos,et al. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT , 2002, CP.
[2] Carlos Ansótegui,et al. Boosting Chaff's Performance by Incorporating CSP Heuristics , 2003, CP.
[3] Ramón Béjar,et al. Solving the Round Robin Problem Using Propositional Logic , 2000, AAAI/IAAI.
[4] John Thornton,et al. Additive versus Multiplicative Clause Weighting for SAT , 2004, AAAI.
[5] Bart Selman,et al. Balance and Filtering in Structured Satisfiable Problems , 2001, IJCAI.
[6] Bart Selman,et al. Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems , 1998, AIPS.
[7] Alan M. Frisch,et al. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings , 2001, Journal of Automated Reasoning.
[8] Steven David Prestwich. Full Dynamic Substitutability by SAT Encoding , 2004, CP.
[9] Ramón Béjar,et al. Capturing Structure with Satisfiability , 2001, CP.
[10] Holger H. Hoos,et al. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT , 1999, AAAI/IAAI.
[11] Randal E. Bryant,et al. Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[12] Toby Walsh,et al. SAT v CSP , 2000, CP.
[13] Lakhdar Sais,et al. Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.
[14] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[15] Holger H. Hoos. SAT-Encodings, Search Space Structure, and Local Search Performance , 1999, IJCAI.
[16] Thomas Stützle,et al. Stochastic Local Search: Foundations & Applications , 2004 .
[17] Peter J. Stuckey,et al. A Lagrangian reconstruction of GENET , 2000, Artif. Intell..
[18] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[19] Chu Min Li,et al. Mv-Satz: A SAT solver for many-valued clausal forms , 2003 .
[20] Ian P. Gent. Arc Consistency in SAT , 2002, ECAI.