Efficiently Exploiting Dependencies in Local Search for SAT
暂无分享,去创建一个
[1] Abdul Sattar,et al. Building Structure into Local Search for SAT , 2007, IJCAI.
[2] Steven David Prestwich,et al. Variable Dependency in Local Search: Prevention Is Better Than Cure , 2007, SAT.
[3] Holger H. Hoos,et al. An adaptive noise mechanism for walkSAT , 2002, AAAI/IAAI.
[4] Abdul Sattar,et al. Dynamic Constraint Weighting for Over-Constrained Problems , 1998, PRICAI.
[5] Hans van Maaren,et al. Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations , 2000, Discret. Appl. Math..
[6] Abdul Sattar,et al. Advances in Local Search for Satisfiability , 2007, Australian Conference on Artificial Intelligence.
[7] Hans van Maaren,et al. Aligning CNF- and Equivalence-reasoning , 2004, SAT.
[8] Lakhdar Sais,et al. Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.
[9] Bart Selman,et al. Accelerating Random Walks , 2002, CP.
[10] Chu Min Li,et al. Equivalent literal propagation in the DLL procedure , 2003, Discret. Appl. Math..