In the 70's and 80's the success of knowledge-intensive approaches to problem solving eclipsed earlier work on compute-intensive weak methods. However, in recent years, compute-intensive methods have made a surprising comeback. One of the most prominent examples is the success
|
4461
|
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
– Pearl
- 1988
|
|
2210
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1926
|
Artificial Intelligence: A Modern Approach
– Russell, Norvig
|
|
1611
|
Monotone Complexity
– Grigni, Sipser
- 1992
|
|
1412
|
STRIPS: A new approach to the application of theorem proving to problem solving
– Fikes, Nilsson
- 1971
|
|
788
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
744
|
Fast Planning through Plangraph Analysis
– Blum, Furst
- 1995
|
|
701
|
The fractal geometry of nature
– Mandelbrot
- 1982
|
|
561
|
A new method for solving hard satisfiability problems
– Selman, Mitchell
- 1992
|
|
503
|
Human Problem Solving
– Newell, Simon
- 1972
|
|
485
|
An analysis of timedependent planning
– Dean, Boddy
- 1988
|
|
476
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
440
|
Optimization by simulated annealing: An experimental evaluation. Part 1, graph partitioning
– Johnson, Aragon, et al.
- 1989
|
|
434
|
Pushing the envelope: Planning, propositional logic, and stochastic search
– Selman
- 1996
|
|
331
|
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
– Minton, Johnston, et al.
- 1992
|
|
315
|
Probabilistic logic
– Nilsson
- 1986
|
|
305
|
Dynamic backtracking
– Ginsberg
- 1993
|
|
276
|
A softbot-based interface to the Internet
– Etzioni, Weld
- 1994
|
|
255
|
Temporal Difference Learning and TD-Gammon
– Tesauro
- 1995
|
|
234
|
The intractability of resolution
– Haken
- 1985
|
|
195
|
Domain-independant extensions to GSAT : Solving large structured variables
– Selman, Kautz
- 1993
|
|
192
|
Local search strategies for satisfiability testing
– Selman, Kautz, et al.
- 1993
|
|
189
|
and Endre Szemer'edi. Many hard examples for resolution
– Chv'atal
- 1988
|
|
178
|
and easy distributions of sat problems
– Mitchell, Selman, et al.
- 1992
|
|
170
|
A generic arc-consistency algorithm and its specializations
– hentenryck, Deville, et al.
- 1992
|
|
159
|
A model-based approach to reactive self-configuring systems
– Williams, Nayak
- 1996
|
|
143
|
Artificial Intelligence: A New Synthesis
– Nilsson
- 1998
|
|
137
|
Evidence for invariants in local search
– McAllester, Selman, et al.
- 1997
|
|
128
|
Encoding plans in propositional logic
– Kautz, McAllester, et al.
- 1996
|
|
116
|
Towards an understanding of hillclimbing procedures for SAT
– Gent, Walsh
- 1993
|
|
113
|
Linear-space best-first search
– Korf
- 1993
|
|
112
|
Critical behavior in the satisfiability of random Boolean expressions
– Kirkpatrick, Selman
- 1994
|
|
110
|
A fundamental tradeoff in knowledge representation and reasoning (revised version
– Levesque, Brachman
- 1985
|
|
108
|
Knowledge compilation and theory approximation
– Selman, Kautz
- 1996
|
|
103
|
Automatic SAT-compilation of planning problems
– Ernst, Millstein, et al.
- 1997
|
|
101
|
Locating the phase transition in binary constraint satisfaction problems
– Smith
- 1996
|
|
99
|
Solution of the Robbins problem
– McCune
- 1997
|
|
93
|
Making believers out of computers
– Levesque
- 1986
|
|
86
|
Algorithms for the maximum satisfiability problem
– Hansen, Jaumard
- 1990
|
|
85
|
Directional resolution: The davis-putnam procedure, revisited
– Dechter, Rish
- 1994
|
|
83
|
D.G.: Finding hard instances of the satisfiability problem: A survey
– Cook, Mitchell
- 1997
|
|
78
|
The hardest constraint problems: A double phase transition
– Hogg, Williams
- 1994
|
|
78
|
Generating hard satisfiability problems
– Selman, Mitchell, et al.
- 1996
|
|
73
|
Using temporal logic to control search in a forward chaining planner
– Bacchus, Kabanza
- 1995
|
|
66
|
Essentials of Artificial Intelligence
– Ginsberg
- 1993
|
|
64
|
Problem structure in the presence of perturbations
– Gomes, Selman
- 1997
|
|
64
|
An economics approach to hard computational problems
– Huberman, Lukose, et al.
- 1997
|
|
63
|
Partial-order planning: evaluating possible efficiency gains
– Barrett, Weld
- 1994
|
|
60
|
Ten challenges in propositional reasoning and search
– Selman, Kautz, et al.
- 1997
|
|
51
|
On the complexity of domain-independent planning
– Erol, Nau, et al.
- 1992
|
|
