Fetching the paper…
Reading the bibliography…
During the 60s and 70s, AI researchers explored intuitions about intelligence by writing programs that displayed intelligent behavior.
On computable numbers, with an application to the Entscheidungsproblem
A. Turing · 1936
Earlier work this paper cites.
Programs with common sense
J. McCarthy · 1958
Earlier work this paper cites.
Computers and thought
E.A. Feigenbaum and J. Feldman · 1963
Earlier work this paper cites.
Artificial intelligence programming
E. Charniak, C. Riesbeck, and D. McDermott · 1980
Earlier work this paper cites.
Heuristics
J. Pearl · 1983
Earlier work this paper cites.
Parallel distributed processing: explorations in the microstructure of cognition. Vol. 1
D. Rumelhart and J. McClelland, editors · 1986
Earlier work this paper cites.
Generality in artificial intelligence
J. McCarthy · 1987
Earlier work this paper cites.
Probabilistic Reasoning in Intelligent Systems
J. Pearl · 1988
Earlier work this paper cites.
Backpropagation applied to handwritten zip code recognition
Y. LeCun, B. Boser, J. Denker, D. Henderson, R. Howard, W. Hubbard, and L. Jackel · 1989
Earlier work this paper cites.
CYC: toward programs with common sense
D. Lenat, R. Guha, K. Pittman, D. Pratt, and M. Shepherd · 1990
Earlier work this paper cites.
Paradigms of artificial intelligence programming: case studies in Common LISP
P. Norvig · 1992
Earlier work this paper cites.
Dynamic Programming and Optimal Control, Vols 1 and 2
D. Bertsekas · 1995
Earlier work this paper cites.
Pushing the envelope: Planning, propositional logic, and stochastic search
H. Kautz and B. Selman · 1996
Earlier work this paper cites.
Planning and acting in partially observable stochastic domains
L. Kaelbling, M. Littman, and T. Cassandra · 1998
Earlier work this paper cites.
Introduction to Reinforcement Learning
R. Sutton and A. Barto · 1998
Earlier work this paper cites.
Using regression-match graphs to control search in planning
D. McDermott · 1999
Earlier work this paper cites.
Minesweeper is NP-Complete
R. Kaye · 2000
Earlier work this paper cites.
Planning as heuristic search
B. Bonet and H. Geffner · 2001
Earlier work this paper cites.
The FF planning system: Fast plan generation through heuristic search
J. Hoffmann and B. Nebel · 2001
Earlier work this paper cites.
Constraint Processing
R. Dechter · 2003
Earlier work this paper cites.
Complexity of planning with partial observability
J. Rintanen · 2004
Earlier work this paper cites.
General game playing: Overview of the AAAI competition
M. Genesereth, N. Love, and B. Pell · 2005
Earlier work this paper cites.
The robot’s rebellion: Finding meaning in the age of Darwin
K. Stanovich · 2005
Earlier work this paper cites.
Efficient selectivity and backup operators in Monte-Carlo tree search
R. Coulom · 2006
Cited alongside, same era.
Bandit based Monte-Carlo planning
L. Kocsis and C. Szepesvári · 2006
Cited alongside, same era.
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors · 2009
Cited alongside, same era.
Automatic derivation of memoryless policies and finite-state controllers using classical planners
B. Bonet, H. Palacios, and H. Geffner · 2009
Cited alongside, same era.
Compiling uncertainty away in conformant planning problems with bounded width
H. Palacios and H. Geffner · 2009
Cited alongside, same era.
Artificial Intelligence: A Modern Approach
S. Russell and P. Norvig · 2009
Cited alongside, same era.
Classical planning with simulators: Results on the atari video games
N. Lipovetzky, M. Ramirez, and H. Geffner · 2015
Later among the works it cites.
Human-level control through deep reinforcement learning
V. Mnih, K. Kavukcuoglu, D. Silver, A. A Rusu, J. Veness, M. G Bellemare, A. Graves, M. Riedmiller, A. K Fidjeland, G. Ostrovski, et al · 2015
Later among the works it cites.
A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs
K. Chatterjee, M. Chmelik, and J. Davies · 2016
Later among the works it cites.
State of the art control of Atari games using shallow reinforcement learning
Y. Liang, M. Machado, E. Talvitie, and M. Bowling · 2016
Later among the works it cites.
Thinking fast and slow with deep learning and tree search
T. Anthony, Z. Tian, and D. Barber · 2017
Later among the works it cites.
Generalized planning: non-deterministic abstractions and trajectory constraints
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Heuristics, planning and cognition
H. Geffner · 2010
Cited alongside, same era.
Probabilistic plan recognition using off-the-shelf classical planners
M. Ramírez and H. Geffner · 2010
Cited alongside, same era.
Generalized planning: Synthesizing plans that work for multiple environments
Y. Hu and G. De Giacomo · 2011
Cited alongside, same era.
Thinking, fast and slow
D. Kahneman · 2011
Cited alongside, same era.
A new representation and associated algorithms for generalized planning
S. Srivastava, N. Immerman, and S. Zilberstein · 2011
Cited alongside, same era.
Answer set solving in practice
M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub · 2012
Cited alongside, same era.
B. Bonet, G. De Giacomo, H. Geffner, and S. Rubin · 2017
Later among the works it cites.
Non-deterministic planning with temporally extended goals: LTL over finite and infinite traces
A. Camacho, E. Triantafillou, C. Muise, J. Baier, and S. McIlraith · 2017
Later among the works it cites.
Human-level intelligence or animal-like abilities?
A Darwiche · 2017
Later among the works it cites.
Purely declarative action representations are overrated: Classical planning with simulators
G. Francès, M. Ramírez, N. Lipovetzky, and H. Geffner · 2017
Later among the works it cites.
Learning generalized reactive policies using deep neural networks
E. Groshev, A. Tamar, S. Srivastava, and P. Abbeel · 2017
Later among the works it cites.
Building machines that learn and think like people
B. Lake, T. Ullman, J. Tenenbaum, and S. Gershman · 2017
Later among the works it cites.
Best-first width search: Exploration and exploitation in classical planning
N. Lipovetzky and H. Geffner · 2017
Later among the works it cites.
Mastering chess and shogi by self-play with a general reinforcement learning algorithm
D. Silver, T. Hubert, J. Schrittwieser, I. Antonoglou, M. Lai, A. Guez, M. Lanctot, L. Sifre, D. Kumaran, T. Graepel, et al · 2017
Later among the works it cites.
Mastering the game of go without human knowledge
D. Silver, J. Schrittwieser, K. Simonyan, I. Antonoglou, A. Huang, A. Guez, T. Hubert, L. Baker, M. Lai, A. Bolton, et al · 2017
Later among the works it cites.
Independently controllable features
V. Thomas, J. Pondard, E. Bengio, M. Sarfati, P. Beaudoin, M. Meurs, J. Pineau, D. Precup, and Y. Bengio · 2017
Later among the works it cites.
Planning with pixels in (almost) real time
W. Bandres, B. Bonet, and H. Geffner · 2018
Closest in time.
Feature-based aggregation and deep reinforcement learning: A survey and some new implementations
D. Bertsekas · 2018
Closest in time.
Features, projections, and representation change for generalized planning
B. Bonet and H. Geffner · 2018
Closest in time.
Reflections on innateness in machine learning
T. Dietterich · 2018
Closest in time.
Innateness, AlphaZero, and artificial intelligence
G. Marcus · 2018
Closest in time.
Deep learning: A critical appraisal
Gary Marcus · 2018
Closest in time.
Theoretical impediments to machine learning with seven sparks from the causal revolution
J. Pearl · 2018
Closest in time.