|
926
|
A computing procedure for quantification theory
– Martin Davis, Hilary Putnam
- 1960
|
|
636
|
A machine program for theorem proving
– M Davis, G Logemann, D Loveland
- 1962
|
|
620
|
A New Method for Solving Hard Satisfiability Problems
– Bart Selman, Hector Levesque, David Mitchell
- 1992
|
|
501
|
Where the really hard problems are
– Peter Cheeseman, Bob Kanefsky, William M. Taylor
- 1991
|
|
186
|
Experimental Results on the Crossover Point in Satisfiability Problems
– James M. Crawford, Larry D. Auton
- 1993
|
|
60
|
Iterative Broadening
– Matthew L. Ginsberg, William D. Harvey
- 1990
|
|
362
|
Planning as satisfiability
– Henry Kautz, Bart Selman
- 1992
|
|
323
|
GSAT and Dynamic Backtracking
– Matthew L. Ginsberg, David A. McAllester
- 1994
|
|
266
|
and Easy Distributions for SAT Problems
– Hard
- 1992
|
|
224
|
Local Search Strategies for Satisfiability Testing
– Bart Selman, Henry Kautz, Bram Cohen
- 1995
|
|
207
|
Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems
– Bart Selman, Henry Kautz
- 1993
|
|
75
|
Easy Problems are Sometimes Hard
– Ian Gent, Toby Walsh
- 1994
|
|
61
|
Systematic and non-systematic search strategies
– P Langley
- 1992
|
|
311
|
Hybrid Algorithms for the Constraint Satisfaction Problem
– Patrick Prosser
- 1993
|
|
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
|
|
463
|
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
– Henry Kautz, Bart Selman
- 1996
|
|
157
|
Performance Measurement and Analysis of Certain Search Algorithms
– J Gaschnig
- 1979
|
|
90
|
Directional Resolution: The Davis-Putnam Procedure, Revisited
– Rina Dechter, Irina Rish
- 1994
|
|
191
|
Depth-first iterative deepening: an optimal admissible tree search
– R E Korf
- 1985
|
