A New Method for Solving Hard Satisfiability Problems (1992)

by Bart Selman , Hector Levesque , David Mitchell
Venue:AAAI
Citations:681 - 20 self

Documents Related by Co-Citation

148 P.: Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method – S Minton, M Johnston, A Philips, Laird - 1990
1084 A computing procedure for quantification theory – Martin Davis, Hilary Putnam - 1960
283 and easy distributions of sat problems – Hard - 1992
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
311 J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae – W F Dowling, Gallier - 1984
214 Many hard examples for resolution – V Chvátal, E Szemerédi - 1988
202 Experimental Results on the Crossover Point in Satisfiability Problems – James M. Crawford, Larry D. Auton - 1993
137 Experimental Results on the Crossover Point in Random 3sat – James M. Crawford, Larry D. Auton - 1996
516 Optimization by simulated annealing: An experimental evaluation, Part – D S JOHNSON, C R ARAGON, L A MCGEOCH, C SCHEVON - 1991
74 A rearrangement search strategy for determining propositional satisfiability – Ramin Zabih - 1988
742 A machine program for theorem proving – Martin Davis, George Logemann, Donald Loveland - 1962
264 The intractability of resolution – A Haken - 1985
46 Branch-and-cut solution of inference problems in propositional logic – J N Hooker, C Fedjki - 1990
65 G.: Algorithms for testing the satisfiability of propositional formulae – G Gallo, Urbani - 1989
30 On the complexity of the satisfiability problem – A Goldberg - 1979
175 Performance Measurement and Analysis of Certain Search Algorithms – J Gaschnig - 1979
78 Report on a SAT competition – Buro Kleine Buning, Reihe Informatik, Michael Buro, Hans Kleine Buning - 1993
256 Test pattern generation using Boolean satisfiability – Tracy Larrabee - 1992
31 On the Greedy Algorithm for Satisfiability – Elias Koutsoupias, Christos H. Papadimitriou - 1992