|
620
|
A New Method for Solving Hard Satisfiability Problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
178
|
The breakout method for escaping from local minima
– P Morris
- 1992
|
|
318
|
Noise strategies for improving local search
– Bart Selman, Henry A. Kautz, Bram Cohen
- 1994
|
|
142
|
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
– Steve Minton, Mark D Johnson, Andrew B Phillips, Phillip Laird
- 1990
|
|
100
|
Efficient local search for very large-scale satisfiability problem
– J Gu
- 1992
|
|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
2802
|
Optimization by simulated annealing
– S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi
- 1983
|
|
636
|
A machine program for theorem proving
– M Davis, G Logemann, D Loveland
- 1962
|
|
356
|
Minimizing Conflicts: A Heuristic Repair Method for Constraint-Satisfaction and Scheduling Problems
– Steven Minton, Andy Philips, Mark D. Johnston, Philip Laird
- 1993
|
|
463
|
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
– Henry Kautz, Bart Selman
- 1996
|
|
224
|
Local Search Strategies for Satisfiability Testing
– Bart Selman, Henry Kautz, Bram Cohen
- 1995
|
|
830
|
A machine-oriented logic based on the resolution principle
– J A Robinson
- 1965
|
|
12
|
The Enigma of SAT Hill-climbing Procedures
– Ian P. Gent, Toby Walsh
- 1992
|
|
44
|
Evidence for a Satisfiability Threshold for Random 3CNF Formulas
– Tracy Larrabee, Yumi Tsuji
- 1993
|
|
362
|
Planning as satisfiability
– Henry Kautz, Bart Selman
- 1992
|
|
122
|
Towards an understanding of hill-climbing procedures for SAT
– Ian P. Gent, Toby Walsh Y
- 1993
|
|
45
|
A new method to solve hard satis problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
182
|
Using CSP look-back techniques to solve real-world SAT instances
– Roberto J. Bayardo
- 1997
|
