Dynamic Variable Filtering for Hard Random 3-SAT Problems
暂无分享,去创建一个
[1] Fahiem Bacchus,et al. Enhancing Davis Putnam with extended binary clause reasoning , 2002, AAAI/IAAI.
[2] Donald Loveland. A Machine Program for Theorem-Provingt , 2000 .
[3] Joao Marques-Silva,et al. The Impact of Branching Heuristics in Propositional Satisfiability Algorithms , 1999, EPIA.
[4] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[5] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[6] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.
[7] Chu Min Li,et al. A Constraint-Based Approach to Narrow Search Trees for Satisfiability , 1999, Inf. Process. Lett..
[8] Hans van Maaren,et al. Solving satisfiability problems using elliptic approximations - effective branching rules , 2000, Discret. Appl. Math..
[9] Bart Selman,et al. Ten Challenges in Propositional Reasoning and Search , 1997, IJCAI.
[10] Jinchang Wang,et al. Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.
[11] V. Vinay,et al. Branching rules for satisfiability , 1995, Journal of Automated Reasoning.
[12] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[13] Chu Min Li,et al. On the limit of branching rules for hard random unsatisfiable 3-SAT , 2003, Discret. Appl. Math..
[14] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[15] Gilles Dequen,et al. A backbone-search heuristic for efficient solving of hard 3-SAT formulae , 2001, IJCAI.
[16] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .
[17] Daniel Le Berre. Exploiting the real power of unit propagation lookahead , 2001, Electron. Notes Discret. Math..
[18] Rémi Monasson,et al. Determining computational complexity from characteristic ‘phase transitions’ , 1999, Nature.
[19] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[20] Lakhdar Sais,et al. Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem , 2001, CP.