foundations of computational agents
The situation calculus was proposed by McCarthy and Hayes . The form of the frame axioms presented here can be traced back to Kowalski , Schubert , and Reiter . Reiter  presents a comprehensive overview of the situation calculus; see also Brachman and Levesque . The event calculus was proposed by Kowalski and Sergot . There have been many other suggestions about how to solve the frame problem, which is the problem of concisely specifying what does not change during an action. Shanahan  provides an excellent introduction to the issues involved in representing change and to the frame problem in particular.
The Netflix prize, and the winning algorithms are described at http://www.netflixprize.com/. The collaborative filtering algorithm is based on Koren et al. . The MovieLens data sets are described by Harper and Konstan  and available from http://grouplens.org/datasets/movielens/.
Statistical relational AI is described by De Raedt et al. . Plate models are due to Buntine , who used them to characterize learning. Independent choice logic was proposed by Poole [1993, 1997] and implemented in Problog [De Raedt et al., 2007]. De Raedt et al.  and Getoor and Taskar  provide collections of papers that provide overviews on probabilistic relational models and how they can be learned. Domingos and Lowd  discuss how (undirected) relational models can provide a common target representation for AI.