GSAT and Dynamic Backtracking (1994)

by Matthew L. Ginsberg , David A. McAllester
Venue:Journal of Artificial Intelligence Research
Citations:359 - 14 self

Documents Related by Co-Citation

350 Hybrid Algorithms for the Constraint Satisfaction Problem – Patrick Prosser - 1993
576 Where the really hard problems are – Peter Cheeseman, Bob Kanefsky, William M. Taylor - 1991
462 Increasing tree search efficiency for constraint satisfaction problems – Robert M Haralick, Gordon L Elliott - 1980
274 Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition – Rina Dechter - 1990
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962
57 A comparison of ATMS and CSP techniques – J de Kleer - 1989
398 Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems – Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird - 1993
1000 Consistency in networks of relations – A K Mackworth - 1977
59 Maintaining Arc-Consistency within Dynamic Backtracking – Narendra Jussien, Romuald Debruyne, Patrice Boizumault - 2000
175 Performance Measurement and Analysis of Certain Search Algorithms – J Gaschnig - 1979
683 A New Method for Solving Hard Satisfiability Problems – Bart Selman, Hector Levesque, David Mitchell - 1992
45 Domain filtering can degrade intelligent backtracking – P Prosser - 1993
948 Constraint Networks – Rina Dechter - 1992
1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
43 Sparse Constraint Graphs and Exceptionally Hard Problems – Barbara M. Smith, Stuart A. Grant - 1994
619 A Truth Maintenance System – J Doyle - 1979
32 Solving combinatorial search problems by intelligent backtracking – M Bruynooghe - 1981
23 Dynamic domain splitting for numeric CSPs – Narendra Jussien , Olivier Lhomme - 1998
261 Tree clustering for constraint networks – R Dechter, J Pearl - 1989