论文信息 - A Constraint-Based Approach to Narrow Search Trees for Satisfiability - 字舞流文

A Constraint-Based Approach to Narrow Search Trees for Satisfiability

Chu Min Li | Chu Min Li

[1] Bart Selman,et al. Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.

[2] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.

[3] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[4] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[5] J. Hooker,et al. Branching Rules for Satissability , 1995 .

[6] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.

[7] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.