Artificial Intelligence: Foundations of Computational Agents,  2nd Edition

Bibliography

  • H. Abelson and A. DiSessa (1981) Turtle geometry: the computer as a medium for exploring mathematics. MIT Press. Cited by: 2.6.
  • H. Abramson and M. H. Rogers (Eds.) (1989) Meta-programming in logic programming. MIT Press. Cited by: 14.6.
  • P. E. Agre (1995) Computational research on interaction and agency. Artificial Intelligence 72, pp. 1–52. Cited by: 2.6.
  • J. S. Albus (1981) Brains, behavior and robotics. BYTE Publications. Cited by: 2.6.
  • M. Allais and O. Hagen (Eds.) (1979) Expected utility hypothesis and the allais paradox. Reidel. Cited by: 9.1.1.
  • D. Amodei, C. Olah, J. Steinhardt, P. Christiano, J. Schulman and D. Mané (2016) Concrete Problems in AI Safety. ArXiv e-prints arXiv:1606.06565. External Links: 1606.06565 Cited by: 16.3.
  • M. Anderson and S. L. Leigh Anderson (2007) Machine ethics: creating an ethical intelligent agent. AI Magazine 28 (4), pp. 15–26. Cited by: 16.3.
  • C. Andrieu, N. de Freitas, A. Doucet and M. I. Jordan (2003) An introduction to MCMC for machine learning. Machine Learning 50 (1–2), pp. 5–43. Cited by: 8.8.
  • G. Antoniou and F. van Harmelen (2008) A semantic web primer. 2nd edition, MIT Pres. Cited by: 14.6.
  • K.R. Apt and R.N. Bol (1994) Logic programming and negation: a survey. Journal of Logic Programming 19,20, pp. 9–71. Cited by: 13.10, 5.10.
  • Aristotle (350 B.C.E.) Categories. Translated by E. M. Edghill. External Links: Link Cited by: 14.3.
  • R. Arp, B. Smith and A. Spear (2015) Building ontologies with basic formal ontology. MIT Press. Cited by: 14.6.
  • K.J. Arrow (1963) Social choice and individual values. 2nd Edition edition, Wiley. Cited by: 11.5.
  • I. Asimov (1950) I, robot. Doubleday. Cited by: 16.2.
  • S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak and Z. G. Ives (2007) DBpedia: a nucleus for a web of open data. In 6th International Semantic Web Conference (ISWC), Cited by: 14.6.
  • F. Bacchus and A. Grove (1995) Graphical models for preference and utility. In Uncertainty in Artificial Intelligence (UAI-95), pp. 3–10. Cited by: 9.7.
  • F. Bacchus and F. Kabanza (1996) Using temporal logic to control search in a forward chaining planner. In New Directions in AI Planning, M. Ghallab and A. Milani (Eds.), pp. 141–153. Cited by: 6.7.
  • T. Bäck (1996) Evolutionary algorithms in theory and practice. Oxford University Press. Cited by: 4.11.
  • B. W. Ballard (1983) The *-minimax search procedure for trees containing chance nodes. Artificial Intelligence 21 (3), pp. 327–350. Cited by: 11.8.
  • E. B. Baum (2004) What is thought?. MIT Press. Cited by: Chapter 13.
  • T. Bayes (1763) An essay towards solving a problem in the doctrine of chances. Philosophical Transactions of the Royal Society of London 53, pp. 370–418. External Links: Link Cited by: 10.4.
  • J. L. Bell and M. Machover (1977) A course in mathematical logic. North-Holland. Cited by: 5.10.
  • R.E. Bellman (1957) Dynamic programming. Princeton University Press. Cited by: 9.7.
  • J. M. Bernardo and A. F. M. Smith (1994) Bayesian theory. Wiley. Cited by: 10.6.
  • T. Berners-Lee, J. Hendler and O. Lassila (2001) The semantic web: a new form of web content that is meaningful to computers will unleash a revolution of new possibilities. Scientific American May, pp. 28–37. Cited by: 14.6.
  • U. Bertelè and F. Brioschi (1972) Nonserial dynamic programming. Academic Press. Cited by: 4.11.
  • D. P. Bertsekas and J. N. Tsitsiklis (1996) Neuro-dynamic programming. Athena Scientific. Cited by: 12.12.
  • D. P. Bertsekas (1995) Dynamic programming and optimal control. Athena Scientific. Note: Two volumes. Cited by: 9.7.
  • P. Besnard and A. Hunter (2008) Elements of argumentation. MIT Press. Cited by: 5.10.
  • P. J. Bickel, E. A. Hammel and J. W. O’Connell (1975) Sex bias in graduate admissions: data from Berkeley. Science 187 (4175), pp. 398–404. External Links: Link Cited by: 1..
  • C. M. Bishop (1995) Neural networks for pattern recognition. Oxford University Press. Cited by: 7.10.
  • C. M. Bishop (2008) Pattern recognition and machine learning. Springer-Verlag. Cited by: 7.10.
  • A. Blum and M. Furst (1997) Fast planning through planning graph analysis. Artificial Intelligence 90, pp. 281–300. Cited by: 6.7.
  • D. G. Bobrow (1993) Artificial intelligence in perspective: a retrospective on fifty volumes of Artificial Intelligence. Artificial Intelligence 59, pp. 5–20. Cited by: 1.9.
  • D. G. Bobrow (1967) Natural language input for a computer problem solving system. In Semantic Information Processing, M. Minsky (Ed.), pp. 133–215. Cited by: 1.2.
  • M. Boddy and T. L. Dean (1994) Deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67 (2), pp. 245–285. Cited by: 1.9.
  • H. L. Bodlaender (1993) A tourist guide through treewidth. Acta Cybernetica 11 (1–2), pp. 1–21. Cited by: 8.8.
  • C. Boutilier, R. I. Brafman, C. Domshlak, H. H. H. and D. Poole (2004) CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research 21, pp. 135–191. Cited by: 9.7.
  • C. Boutilier, T. Dean and S. Hanks (1999) Decision-theoretic planning: structual assumptions and computational leverage. Journal of Artificial Intelligence Research 11, pp. 1–94. Cited by: 9.7.
  • K. A. Bowen (1985) Meta-level programming and knowledge representation. New Generation Computing 3 (4), pp. 359–383. Cited by: 14.6.
  • M. Bowling and M. Veloso (2002) Multiagent learning using a variable learning rate. Artificial Intelligence 136 (2), pp. 215–250. Cited by: 12.12.
  • R. J. Brachman and H. J. Levesque (Eds.) (1985) Readings in knowledge representation. Morgan Kaufmann. Cited by: 14.6.
  • R. J. Brachman and H. J. Levesque (2004) Knowledge representation and reasoning. Morgan Kaufmann. Cited by: 1.9, 14.6, 15.5.
  • L. Breiman, J. H. Friedman, R. A. Olshen and C. J. Stone (1984) Classification and regression trees. Wadsworth and Brooks. Cited by: 7.10.
  • L. Breiman (2001) Random forests. Machine Learning 45 (1), pp. 5–32. Cited by: 7.10.
  • P. Brémaud (1999) Markov chains: gibbs fields, monte carlo simulation and queues. Springer. Cited by: 8.8.
  • S. Brin and L. Page (1998) The anatomy of a large-scale hypertextual web search engine. Computer Networks and ISDN Systems (Proceedings of the Seventh International World Wide Web Conference) 30 (1–7), pp. 107–117. External Links: ISSN 0169-7552, Link Cited by: 8.5.1.
  • G. Briscoe and T. Caelli (1996) A compendium of machine learning, Volume 1: symbolic machine learning. Ablex. Cited by: 7.10.
  • R. A. Brooks (1986) A robust layered control system for a mobile robot. IEEE Journal of Robotics and Automation 2 (1), pp. 14–23. External Links: Link Cited by: 2.6.
  • R. A. Brooks (1991) Intelligence without representation. Artificial Intelligence 47, pp. 139–159. External Links: Link Cited by: 2.6.
  • R. A. Brooks (1990) Elephants don’t play chess. Robotics and Autonomous Systems 6, pp. 3–15. External Links: Link Cited by: 1.9.
  • D. Bryce and S. Kambhampati (2007) A tutorial on planning graph-based reachability heuristics. AI Magazine 28 (1), pp. 47–83. Cited by: 6.7.
  • E. Brynjolfsson and A. McAfee (2011) Race against the machine: how the digital revolution is accelerating innovation, driving productivity, and irreversibly transforming employment and the economy. Digital Frontier, Lexington, MA. Cited by: 16.3.
  • E. Brynjolfsson and A. McAfee (2014) The second machine age: work, progress, and prosperity in a time of brilliant technologies. W. W. Norton and Company. External Links: ISBN 0393239357, 9780393239355 Cited by: 16.2, 16.3.
  • B. G. Buchanan and E. Shortliffe (Eds.) (1984) Rule-based expert systems: the MYCIN experiments of the stanford heuristic programming project. Addison-Wesley. Cited by: 1.2.
  • B. G. Buchanan and E. A. Feigenbaum (1978) Dendral and Meta-Dendral: their applications dimension. Artificial Intelligence 11, pp. 5–24. Cited by: 1.2.
  • B. G. Buchanan (2005) A (very) brief history of artificial intelligence. AI Magazine 26 (4), pp. 53–60. Cited by: 1.9, Chapter 1.
  • W. L. Buntine (1994) Operations for learning with graphical models. Journal of Artificial Intelligence Research 2, pp. 159–225. Cited by: 15.5.
  • W. Buntine (1992) Learning classification trees. Statistics and Computing 2, pp. 63–73. Cited by: 10.6.
  • R. Burch (2008) Charles Sanders Peirce. The Stanford Encyclopedia of Philosophy. External Links: Link Cited by: 5.10.
  • L. Busoniu, R. Babuska and B. D. Schutter (2008) A comprehensive survey of multiagent reinforcement learning. EEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews 38 (2), pp. 156–172. Cited by: 12.12.
  • R. Calo, A. M. Froomkin and I. Kerr (2016) Robot law. Edward Elgar Publishing. Cited by: 16.3.
  • R. Calo (2014) The case for a federal robotics commission. Brookings Institution Center for Technology Innovation. Cited by: 16.3.
  • M. Campbell, A. J. Hoane Jr. and F. Hse (2002) Deep Blue. Artificial Intelligence 134 (1–2), pp. 57–83. External Links: Link Cited by: 11.1, 11.8.
  • E. Castillo, J. M. Gutiérrez and A. S. Hadi (1996) Expert systems and probabilistic network models. Springer-Verlag. Cited by: 8.8.
  • D. Chapman (1987) Planning for conjunctive goals. Artificial Intelligence 32 (3), pp. 333–377. Cited by: 6.7.
  • P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor and D. Freeman (1988) Autoclass: a Bayesian classification system. In Proc. Fifth International Conference on Machine Learning, pp. 54–64. Note: Reprinted in [J. W. Shavlik and T. G. Dietterich (Eds.) (1990)] Cited by: 10.6.
  • J. Cheng and M.J. Druzdzel (2000) AIS-BN: an adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks. Journal of Artificial Intelligence Research 13, pp. 155–188. External Links: Link Cited by: 8.8.
  • C. Chesnevar, A. Maguitman and R. Loui (2000) Logical models of argument. ACM Computer Surveys 32 (4), pp. 337–383. Cited by: 5.10.
  • N. Chomsky (1957) Syntactic structures. Mouton and Co.. Cited by: 13.6.
  • R. Chrisley and S. Begeer (2000) Artificial intelligence: critical concepts in cognitive science. Routledge. Cited by: 1.9, G. W. Leibniz (1677).
  • K. L. Clark (1978) Negation as failure. In Logic and Databases, H. Gallaire and J. Minker (Eds.), pp. 293–322. Cited by: 13.10, 5.10.
  • P. R. Cohen (2005) If not Turing’s test, then what?. AI Magazine 26 (4), pp. 61–67. Cited by: 1.9.
  • A. Colmerauer, H. Kanoui, P. Roussel and R. Pasero (1973) Un système de communication homme-machine en français. Technical report Groupe de Researche en Intelligence Artificielle, Université d’Aix-Marseille. Cited by: 5.10.
  • A. Colmerauer and P. Roussel (1996) The birth of Prolog. In History of Programming Languages–II, T. J. Bergin and R. G. Gibson (Eds.), pp. 331–367. External Links: Link Cited by: 1.2, 13.10.
  • I. M. Copi, C. Cohen and K. McMahon (2016) Introduction to logic. 14 edition, Macmillan. Cited by: 5.10.
  • T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein (2001) Introduction to algorithms. Second edition, MIT Press and McGraw-Hill. Cited by: 3.10.
  • T. M. Cover and J. A. Thomas (1991) Elements of information theory. Wiley. Cited by: 8.8.
  • J. Culberson and J. Schaeffer (1998) Pattern databases. Computational Intelligence 14 (3), pp. 318–334. Cited by: 3.10.
  • V. Dahl (1994) Natural language processing and logic programming. Journal of Logic Programming 19,20, pp. 681–714. Cited by: 13.10.
  • A. Darwiche (2009) Modeling and reasoning with bayesian networks. Cambridge University Press. Cited by: 10.6, 8.8, 8.8.
  • B. V. Dasarathy (1991) NN concepts and techniques. In Nearest Neighbour (NN) Norms: NN Pattern Classification Techniques, B. V. Dasarathy (Ed.), pp. 1–30. Cited by: 7.10.
  • E. Davis (1990) Representations of commonsense knowledge. Morgan Kaufmann. Cited by: 14.6.
  • E. Davis (2015) External Links: Link Cited by: 4., \pgfsys@color@rgb@stroke{1}{0}{0}\pgfsys@color@rgb@fill{1}{0}{0}Example 1.2.
  • J. Davis and M. Goadrich (2006) The relationship between precision-recall and ROC curves. In Proceedings of the 23rd International Conference on Machine Learning (ICML), pp. 233–240. Cited by: 7.10.
  • M. Davis, G. Logemann and D. Loveland (1962) A machine program for theorem proving. Communications of the ACM 5 (7), pp. 394–397. Cited by: 5.10.
  • M. Davis and H. Putnam (1960) A computing procedure for quantification theory. Journal of the ACM 7 (3), pp. 201–215. Cited by: 4.11.
  • J. de Kleer, A. K. Mackworth and R. Reiter (1992) Characterizing diagnoses and systems. Artificial Intelligence 56, pp. 197–222. Cited by: 5.10.
  • J. de Kleer (1986) An assumption-based TMS. Artificial Intelligence 28 (2), pp. 127–162. Cited by: 5.10.
  • L. De Raedt, A. Kimmig and H. Toivonen (2007) ProbLog: a probabilistic Prolog and its application in link discovery. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2462–2467. Cited by: 15.5.
  • L. De Raedt, P. Frasconi, K. Kersting and S. H. Muggleton (Eds.) (2008) Probabilistic inductive logic programming. Springer. Cited by: 15.5.
  • L. De Raedt, K. Kersting, S. Natarajan and D. Poole (2016) Statistical relational artificial intelligence: logic, probability, and computation. Morgan and Claypool. External Links: Document Cited by: 15.5.
  • T. Dean and K. Kanazawa (1989) A model for reasoning about persistence and causation. Computational Intelligence 5 (3), pp. 142–150. Cited by: 8.8.
  • T. L. Dean and M. P. Wellman (1991) Planning and control. Morgan Kaufmann. Cited by: 1.9, 2.6.
  • R. Dechter (1996) Bucket elimination: a unifying framework for probabilistic inference. In Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI-96), E. Horvitz and F. Jensen (Eds.), pp. 211–219. Cited by: 8.8.
  • R. Dechter and J. Pearl (1985) Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery 32 (3), pp. 505–536. Cited by: 3.10, 3.8.3.
  • R. Dechter (2003) Constraint processing. Morgan Kaufmann. Cited by: 4.11.
  • R. Dechter (2013) Reasoning with probabilistic and deterministic graphical models: exact algorithms. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 8.8.
  • F. Dellaert, D. Fox, W. Burgard and S. Thrun (1999) Monte Carlo localization for mobile robots. In IEEE International Conference on Robotics and Automation (ICRA), External Links: Link Cited by: 8.8.
  • A.P. Dempster, N.M. Laird and D.B. Rubin (1977) Maximum liklihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39, pp. 1–38. Note: with discussion Cited by: 10.6.
  • M. Denil, D. Matheson and N. de Freitas (2014) Narrowing the gap: random forests in theory and in practice. In International Conference on Machine Learning (ICML), Cited by: 7.10.
  • R. Descartes (1637) Discourse on the method of rightly conducting one’s reason and of seeking truth in the sciences. External Links: Link Cited by: Chapter 12.
  • T. G. Dietterich (2000a) An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization. Machine Learning 40 (2), pp. 139–158. Cited by: 7.10.
  • T. G. Dietterich (2000b) Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research 13, pp. 227–303. External Links: Link Cited by: 16.3.
  • T. G. Dietterich (2002) Ensemble learning. In The Handbook of Brain Theory and Neural Networks, M.A. Arbib (Ed.), pp. 405–408. External Links: Link Cited by: 7.10.
  • E. W. Dijkstra (1976) A discipline of programming. Prentice-Hall. Cited by: 6.7.
  • Edsger. W. Dijkstra (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1, pp. 269–271. External Links: Link Cited by: 3.10.
  • P. Domingos and D. Lowd (2009) Markov logic: an interface layer for artificial intelligence. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 15.5.
  • P. Domingos (2012) A few useful things to know about machine learning. Communications of the ACM 55 (10), pp. 78–87. Cited by: 7.10.
  • A. Doucet, N. de Freitas and N. Gordon (Eds.) (2001) Sequential monte carlo in practice. Springer-Verlag. Cited by: 8.8.
  • J. Doyle (1979) A truth maintenance system. AI Memo Technical Report 521, MIT Artificial Intelligence Laboratory. Cited by: 5.10.
  • K. Dresner and P. Stone (2008) A multiagent approach to autonomous intersection management. Journal of Artificial Intelligence Research 31, pp. 591–656. Cited by: 16.3.
  • R. O. Duda, P. E. Hart and D. G. Stork (2001) Pattern classification. 2nd edition, Wiley-Interscience. Cited by: 10.6, 7.10, 7.10.
  • P.M. Dung (1995) On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77 (2), pp. 321–357. Cited by: 5.10.
  • H. B. Enderton (1972) A mathematical introduction to logic. Academic Press. Cited by: 5.10.
  • A. Felner, R. E. Korf and S. Hanan (2004) Additive pattern database heuristics. Journal of Artificial Intelligence Research 22, pp. 279–318. Cited by: 3.10.
  • R. E. Fikes and N. J. Nilsson (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 (3–4), pp. 189–208. Cited by: 6.7.
  • K. D. Forbus (1996) Qualitative reasoning. In CRC Hand-book of Computer Science and Engineering, External Links: Link Cited by: 2.6.
  • M. Ford (2015) Rise of the robots: technology and the threat of a jobless future. Basic Books. Cited by: 16.3.
  • E. C. Freuder and A. K. Mackworth (2006) Constraint satisfaction: an emerging paradigm. In Handbook of Constraint Programming, F. Rossi, P. Van Beek and T. Walsh (Eds.), pp. 13–28. Cited by: 4.11.
  • N. Friedman and M. Goldszmidt (1996a) Building classifiers using Bayesian networks. In Proc. 13th National Conference on Artificial Intelligence, pp. 1277–1284. Cited by: 10.6.
  • N. Friedman and M. Goldszmidt (1996b) Learning Bayesian networks with local structure. In Proc. Twelfth Conference on Uncertainty in Artificial Intelligence (UAI-96), pp. 252–262. Cited by: 10.6.
  • N. Friedman, D. Greiger and M. Goldszmidt (1997) Bayesian network classifiers. Machine Learning 29, pp. 103–130. Cited by: 10.6.
  • D. M. Gabbay, C. J. Hogger and J. A. Robinson (Eds.) (1993) Handbook of logic in artificial intelligence and logic programming. Clarendon Press. Note: 5 volumes. Cited by: 5.10.
  • E. Gabrilovich, G. Heitz, W. Horn, N. Lao, K. Murphy, T. Strohmann, S. Sun and W. Zhang (2014) Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In 20th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Cited by: 14.6.
  • F. Galton (1886) Regression towards mediocrity in hereditary stature. Journal of the Anthropological Institute 15, pp. 246–263. External Links: Link Cited by: 7.4.
  • A. Gangemi, N. Guarino, C. Masolo and A. Oltramari (2003) Sweetening wordnet with dolce. AI Magazine 24 (3), pp. 13–24. Cited by: 14.6.
  • H. Garcia-Molina, J. D. Ullman and J. Widom (2009) Database systems: the complete book. 2nd edition, Prentice Hall. Cited by: 13.10.
  • H. Gardner (1985) The mind’s new science. Basic Books. Cited by: 1.9.
  • H. Geffner and B. Bonet (2013) A concise introduction to models and methods for automated planning. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 6.7, 6.7.
  • A. Gelman, J. B. Carlin, H. S. Stern and D. B. Rubin (2004) Bayesian data analysis. 2nd edition, Chapman and Hall/CRC. Cited by: 10.6.
  • M. Genesereth and M. Thielscher (2014) General game playing. Morgan and Claypool. External Links: Document Cited by: 11.8.
  • L. Getoor and B. Taskar (Eds.) (2007) Introduction to statistical relational learning. MIT Press. Cited by: 15.5.
  • Z. Ghahramani (2015) Probabilistic machine learning and artificial intelligence. Nature 521 (7553), pp. 452–459. External Links: ISBN 0028-0836, Link Cited by: 10.6.
  • A. Gibbard (1973) Manipulation of voting schemes: a general result. Econometrica 41, pp. 587–601. Cited by: 11.6.
  • X. Glorot, A. Bordes and Y. Bengio (2011) Deep sparse rectifier neural networks. In Proc. 14th International Conference on Artificial Intelligence and Statistics, pp. 315–323. Cited by: 7.10.
  • D. E. Goldberg (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley. Cited by: 4.11.
  • D. E. Goldberg (2002) The design of innovation: lessons from and for competent genetic algorithms. Addison-Wesley. Cited by: 4.11.
  • Y. Goldberg (2016) A primer on neural network models for natural language processing. Journal of Artificial Intelligence Research 57, pp. 345–420. External Links: Document Cited by: 7.10.
  • C. P. Gomes (2009) Computational sustainability: computational methods for a sustainable environment, economy, and society. The Bridge 39 (4), pp. 5–13. Cited by: 16.3.
  • I. Goodfellow, Y. Bengio and A. Courville (2016) Deep learning. MIT Press. External Links: Link Cited by: 7.10.
  • C. Green (1969) Application of theorem proving to problem solving. In Proc. 1st International Joint Conference on Artificial Intelligence, pp. 219–237. Cited by: 5.10.
  • P. Grenon and B. Smith (2004) SNAP and span: towards dynamic spatial ontology. Spatial Cognition and Computation 4 (1), pp. 69–103. External Links: Link Cited by: 14.6.
  • B. Grosz (2012) What question would Turing pose today?. AI Magazine 33 (4), pp. 73–81. Cited by: 1.9.
  • P. D. Grünwald (2007) The minimum description length principle. MIT Press. Cited by: 10.6, 8.8.
  • A. Halevy, P. Norvig and F. Pereira (2009) The unreasonable effectiveness of data. IEEE Intelligent Systems 24 (2), pp. 8–12. Cited by: 7.10.
  • J. Y. Halpern (2003) Reasoning about uncertainty. MIT Press. Cited by: 8.8.
  • F. M. Harper and J. A. Konstan (2015) The MovieLens datasets: history and context. ACM Transactions on Interactive Intelligent Systems 5 (4). External Links: Document Cited by: 15.5.
  • P. E. Hart, N. J. Nilsson and B. Raphael (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4 (2), pp. 100–107. Cited by: 3.10.
  • T. P. Hart and D. J. Edwards (1961) The tree prune (TP) algorithm. Memo Technical Report 30, MIT Artificial Intelligence Project. Cited by: 11.8.
  • T. Hastie, R. Tibshirani and J. Friedman (2009) The elements of statistical learning: data mining, inference, and prediction.. Second edition, Springer. Cited by: 7.10.
  • J. Haugeland (1985) Artificial intelligence: the very idea. MIT Press. Cited by: 1.2, 1.9, 2.6.
  • J. Haugeland (Ed.) (1997) Mind design II: philosophy, psychology, artificial intelligence. revised and enlarged edition, MIT Press. Cited by: 1.9, M. L. Minsky (1975), A. Newell and H. A. Simon (1976), A. Turing (1950).
  • D. Haussler (1988) Quantifying inductive bias: AI learning algorithms and Valiant’s learning framework. Artificial Intelligence 36 (2), pp. 177–221. Note: Reprinted in [J. W. Shavlik and T. G. Dietterich (Eds.) (1990)] Cited by: 7.10.
  • P. J. Hayes (1973) Computation and deduction. In Proc. 2nd Symposium on Mathematical Foundations of Computer Science, pp. 105–118. Cited by: 5.10.
  • D. Heckerman (1999) A tutorial on learning with Bayesian networks. In Learning in Graphical Models, M.I. Jordan (Ed.), Cited by: 10.6.
  • J. Hendler, T. Berners-Lee and E. Miller (2002) Integrating applications on the semantic web. Journal of the Institute of Electrical Engineers of Japan 122 (10), pp. 676–680. External Links: Link Cited by: 14.6.
  • M. Henrion (1988) Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In Uncertainty in Artificial Intelligence 2, J. F. Lemmer and L. N. Kanal (Eds.), pp. 149–163. Cited by: 8.8.
  • J. Hertz, A. Krogh and R. G. Palmer (1991) Introduction to the theory of neural computation. Lecture Notes, Volume I, Santa Fe Institute Studies in the Sciences of Complexity, Addison-Wesley. Cited by: 7.10.
  • C. Hewitt (1969) Planner: a language for proving theorems in robots. In Proc. 1st International Joint Conference on Artificial Intelligence, pp. 295–301. Cited by: 5.10.
  • W. Daniel. Hillis (2008) A forebrain for the world mind. Edge: World Question Center. External Links: Link Cited by: 16.3.
  • G. Hinton, L. Deng, D. Yu and G.E. Dahl (2012) Deep neural networks for acoustic modeling in speech recognition: the shared views of four research groups. Signal Processing Magazine, IEEE 29 (6), pp. 82–97. External Links: Document, Link Cited by: 7.10.
  • P. Hitzler, M. Krötzsch, B. Parsia, P. F. P. Schneider and S. Rudolph (Eds.) (2012) OWL 2 web ontology language primer (second edition). W3C Recommendation 11 December 2012. External Links: Link Cited by: 14.6.
  • J. R. Hobbs, M. E. Stickel, D. E. Appelt and P. Martin (1993) Interpretation as abduction. Artificial Intelligence 63 (1–2), pp. 69–142. Cited by: 5.10.
  • J. Hoffart, F.M. Suchanek, K. Berberich and G. Weikum (2013) YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia. Artificial Intelligence 194, pp. 28–61. Cited by: 14.6.
  • J. H. Holland (1975) Adaption in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press. Cited by: 4.11.
  • H. H. Hoos and T. Stützle (2004) Stochastic local search: foundations and applications. Morgan Kaufmann. Cited by: 4.11.
  • E. J. Horvitz (1989) Reasoning about beliefs and actions under computational resource constraints. In Uncertainty in Artificial Intelligence 3, L. Kanal, T. Levitt and J. Lemmer (Eds.), pp. 301–324. Cited by: 1.9.
  • E. J. Horvitz (2006) Eric Horvitz forecasts the future. New Scientist 2578, pp. 72. Cited by: Chapter 16.
  • R. A. Howard and J. E. Matheson (1984) Influence diagrams. In The Principles and Applications of Decision Analysis, R. A. Howard and J. E. Matheson (Eds.), Cited by: 9.7.
  • C. Howson and P. Urbach (2006) Scientific reasoning: the Bayesian approach. 3rd edition, Open Court. Cited by: 10.6.
  • IHTSDO (2016) SNOMED ct starter guide. International Health Terminology Standards Development Organisation. External Links: Link Cited by: 14.6.
  • Price,C. J. (2006) Qualitative futures. The Knowledge Engineering Review 21 (04), pp. 317–334. External Links: Document, Link Cited by: 2.6.
  • K. Janowicz, F. van Harmelen, J. A. Hendler and P. Hitzler (2015) Why the data train needs semantic rails. AI Magazine 36 (1), pp. 5–14. Cited by: 14.6.
  • E. T. Jaynes (2003) Probability theory: the logic of science. Cambridge University Press. External Links: Link Cited by: 10.6.
  • F. V. Jensen (1996) An introduction to Bayesian networks. Springer-Verlag. Cited by: 8.8.
  • B. Joy (2000) Why the future doesn’t need us. Wired. External Links: Link Cited by: 16.2.
  • D. Jurafsky and J. H. Martin (2008) Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition. Second edition, Prentice Hall. Cited by: 13.10, 8.8.
  • L. P. Kaelbling, M. L. Littman and A. W. Moore (1996) Reinforcement learning: a survey. Journal of Artificial Intelligence Research 4, pp. 237–285. Cited by: 12.12.
  • D. Kahneman (2011) Thinking, fast and slow. Allen Lane. Cited by: 2., 2.3, 2.6, (d), 6., 9.1.3, 9.7.
  • A. C. Kakas, R. A. Kowalski and F. Toni (1993) Abductive logic programming. Journal of Logic and Computation 2 (6), pp. 719–770. Cited by: 5.10.
  • A. Kakas and M. Denecker (2002) Abduction in logic programming. In Computational Logic: Logic Programming and Beyond, A. Kakas and F. Sadri (Eds.), pp. 402–436. Cited by: 5.10.
  • S. Kambhampati, C. A. Knoblock and Q. Yang (1995) Planning as refinement search: a unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence 76, pp. 167–238. Note: Special issue on Planning and Scheduling Cited by: 6.7.
  • H. Karimi, J. Nutini and M. Schmidt (2016) Linear convergence of gradient and proximal-gradient methods under the polyak-Łojasiewicz condition. In European Conference on Machine Learning (ECML), External Links: Link Cited by: 7.10.
  • H. Kautz and B. Selman (1996) Pushing the envelope: planning, propositional logic and stochastic search. In Proc. 13th National Conference on Artificial Intelligence, pp. 1194–1201. Cited by: 6.7.
  • M.J. Kearns and U.V. Vazirani (1994) An introduction to computational learning theory. MIT Press. Cited by: 7.10.
  • R. L. Keeney and H. Raiffa (1976) Decisions with multiple objectives. John Wiley and Sons. Cited by: 9.7.
  • K. Kelly (2008) A new kind of mind. Edge: World Question Center. External Links: Link Cited by: 16.3.
  • S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi (1983) Optimization by simulated annealing. Science 220, pp. 671–680. Cited by: 4.11.
  • D. Kirsh (1991a) Foundations of AI: the big issues. Artificial Intelligence 47, pp. 3–30. Cited by: 1.9.
  • D. Kirsh (1991b) Today the earwig, tomorrow man?. Artificial Intelligence 47, pp. 161–184. Cited by: 2.6.
  • B. Knoll, J. Kisynski, G. Carenini, C. Conati, A. Mackworth and D. Poole (2008) AIspace: interactive tools for learning artificial intelligence. In Proc. AAAI 2008 AI Education Workshop, pp. 3. Cited by: 16.3.
  • D. E. Knuth and R. W. Moore (1975) An analysis of alpha-beta pruning. Artificial Intelligence 6 (4), pp. 293–326. Cited by: 11.8.
  • D. Koller and N. Friedman (2009) Probabilisitic graphical models: principles and techniques. MIT Press. Cited by: 10.6, 8.8.
  • D. Koller and B. Milch (2003) Multi-agent influence diagrams for representing and solving games. Games and Economic Behavior 45 (1), pp. 181–221. External Links: Link Cited by: 11.8.
  • J. Kolodner and D. Leake (1996) A tutorial introduction to case-based reasoning. In Case-Based Reasoning: Experiences, Lessons, and Future Directions, D. Leake (Ed.), pp. 31–65. Cited by: 7.10.
  • Y. Koren, R. Bell and C. Volinsky (2009) Matrix factorization techniques for recommender systems. IEEE Computer 42 (8), pp. 30–37. Cited by: 15.5.
  • K. E. Korf (1985) Depth-first iterative deepening: an optimal admissible tree search. Artificial Intelligence 27 (1), pp. 97–109. Cited by: 3.10.
  • R. A. Kowalski and M. Sergot (1986) A logic-based calculus of events. New Generation Computing 4 (1), pp. 67–95. Cited by: 15.5.
  • R. A. Kowalski (1974) Predicate logic as a programming language. In Information Processing 74, pp. 569–574. Cited by: 5.10.
  • R. A. Kowalski (1988) The early history of logic programming. Communications of the ACM 31 (1), pp. 38–43. Cited by: 1.2, 13.10.
  • R. A. Kowalski (2014) Logic for problem solving, revisited. Books on Demand. Cited by: 13.10, 14.6, 15.5.
  • J. R. Koza (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press. Cited by: 4.11.
  • A. Krizhevsky, I. Sutskever and G. Hinton (2012) ImageNet classification with deep convolutional neural networks. In Proc. Advances in Neural Information Processing Systems 25, pp. 1090–1098. Cited by: 7.10.
  • M. Krötzsch (2012) OWL 2 Profiles: an introduction to lightweight ontology languages. In Proceedings of the 8th Reasoning Web Summer School, Vienna, Austria, T. Eiter and T. Krennwallner (Eds.), pp. 112–183. External Links: Link Cited by: 14.6.
  • B. Kuipers (2001) Qualitative simulation. In Encyclopedia of Physical Science and Technology, R. A. Meyers (Ed.), pp. 287–300. External Links: Link Cited by: 2.6.
  • I. Lakatos (1976) Proofs and refutations: the logic of mathematical discovery. Cambridge University Press. Cited by: 3.8.3.
  • A. Lally, J. M. Prager, M. C. McCord, B. K. Boguraev, S. Patwardhan, J. Fan, P. Fodor and J. Chu-Carroll (2012) Question analysis: how Watson reads a clue. IBM Journal of Research and Development 56 (3/4). External Links: Link Cited by: 1.2, 13.10.
  • P. Langley, W. Iba and K. Thompson (1992) An analysis of Bayesian classifiers. In Proc. 10th National Conference on Artificial Intelligence, pp. 223–228. Cited by: 10.6.
  • P.S. Laplace (1812) Théorie analytique de probabilités. Courcier. Cited by: 10.1.1, Chapter 8.
  • J.-C. Latombe (1991) Robot motion planning. Kluwer Academic Publishers. Cited by: 2.6.
  • E. L. Lawler and D. E. Wood (1966) Branch-and-bound methods: a survey. Operations Research 14 (4), pp. 699–719. Cited by: 3.10.
  • Y. LeCun, L. Bottou, G. Orr and K. Muller (1998) Efficient backprop. In Neural Networks: Tricks of the Trade, G. Orr and M. K. (Eds.), External Links: Link Cited by: 7.10.
  • Y. LeCun, Y. Bengio and G. Hinton (2015) Deep learning. Nature 521 (7553), pp. 436–444. External Links: ISBN 0028-0836, Link Cited by: 7.10.
  • G. W. Leibniz (1677) The method of mathematics: preface to the general science. Selections reprinted by [R. Chrisley and S. Begeer (2000)]. Cited by: Chapter 5.
  • D. B. Lenat and E. A. Feigenbaum (1991) On the thresholds of knowledge. Artificial Intelligence 47, pp. 185–250. Cited by: 1.9.
  • H. J. Levesque (1984) Foundations of a functional approach to knowledge representation. Artificial Intelligence 23 (2), pp. 155–212. Cited by: 5.10.
  • H. J. Levesque (2012) Thinking as computation. MIT Press. Cited by: 1.9.
  • H. J. Levesque (2014) On our best behaviour. Artificial Intelligence 212, pp. 27–35. Cited by: 1.1.1, 1.9.
  • M. Lichman (2013) UCI machine learning repository. University of California, Irvine, School of Information and Computer Sciences. External Links: Link Cited by: 7.10.
  • A. L. Liu, H. Hile, H. Kautz, G. Borriello, P. A. Brown, M. and K. Johnson (2006) Indoor wayfinding: developing a functional interface for individuals with cognitive impairments. In Proceedings of the 8th International ACM SIGACCESS Conference on Computers and Accessibility, pp. 95–102. Cited by: 16.3.
  • J. W. Lloyd (1987) Foundations of logic programming. Second edition, Symbolic Computation Series, Springer-Verlag. Cited by: 13.10, 5.10.
  • A. Lopez and F. Bacchus (2003) Generalizing GraphPlan by formulating planning as a CSP. In Proc. 18th International Joint Conference Artificial Intelligence (IJCAI), pp. 954–960. Cited by: 6.7.
  • B. López (2013) Case-based reasoning: a concise introduction. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 7.10.
  • T.J. Loredo (1990) From Laplace to supernova SN 1987A: Bayesian inference in astrophysics. In Maximum Entropy and Bayesian Methods, P.F. Fougère (Ed.), pp. 81–142. External Links: Link Cited by: 10.6.
  • D. G. Lowe (1995) Similarity metric learning for a variable-kernel classifier. Neural Computation 7, pp. 72–85. Cited by: 7.10.
  • D. G. Luenberger (1979) Introduction to dynamic systems: theory, models and applications. Wiley. Cited by: 2.6.
  • D. MacKay (2003) Information theory, inference, and learning algorithms. Cambridge University Press. Cited by: 10.6, 8.8.
  • A. K. Mackworth (1993) On seeing robots. In Computer Vision: Systems, Theory, and Applications, A. Basu and X. Li (Eds.), pp. 1–13. Cited by: 2.6.
  • A. K. Mackworth (2009) Agents, bodies, constraints, dynamics and evolution. AI Magazine. Cited by: 16.3.
  • A. K. Mackworth (1977) On reading sketch maps. In Proc. Fifth International Joint Conference on Artificial Intelligence, pp. 598–606. Cited by: 4.11.
  • F. Mahdisoltani, J. Biega and F. M. Suchanek (2015) YAGO3: a knowledge base from multilingual wikipedias. In Conference on Innovative Data Systems Research (CIDR 2015), External Links: Link Cited by: 14.6.
  • C. Manning and H. Schütze (1999) Foundations of statistical natural language processing. MIT Press. Cited by: 13.10, 8.8.
  • B. M. Marlin, R. S. Zemel, S. T. Roweis and M. Slaney (2011) Recommender systems, missing data and statistical model estimation. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pp. 2686–2691. External Links: Link Cited by: 10.6.
  • A. Mas-Colell, M. D. Whinston and J. R. Green (1995) Microeconomic theory. Oxford University Press. Cited by: 11.8.
  • J. E. Matheson (1990) Using influence diagrams to value information and control. In Influence Diagrams, Belief Nets and Decision Analysis, R. M. Oliver and J. Q. Smith (Eds.), pp. 25–48. Cited by: 9.7.
  • Mausam and A. Kolobov (2012) Planning with markov decision processes: an AI perspective. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 9.7.
  • D. McAllester and D. Rosenblitt (1991) Systematic nonlinear planning. In Proc. 9th National Conference on Artificial Intelligence, pp. 634–639. Cited by: 6.7.
  • J. McCarthy and P. J. Hayes (1969) Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence 4, M. Meltzer and D. Michie (Eds.), pp. 463–502. Cited by: 1.2, 15.5.
  • J. McCarthy (1986) Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence 28 (1), pp. 89–116. Cited by: 5.10.
  • W. McCulloch and W. Pitts (1943) A logical calculus of ideas immanent in nervous activity. Bulletin of Mathematical Biophysics 5, pp. 115–133. Cited by: 1.2, 7.10.
  • D. McDermott and J. Hendler (1995) Planning: what it is, what it could be, an introduction to the special issue on planning and scheduling. Artificial Intelligence 76, pp. 1–16. Cited by: 6.7.
  • M. McLuhan (1964) Understanding media: the extensions of man. New American Library. Cited by: 16.2.
  • R. Meir and G. Rätsch (2003) An introduction to boosting and leveraging. In Advanced Lectures on Machine Learning, pp. 119–184. External Links: Link Cited by: 7.10.
  • E. Mendelson (1987) Introduction to mathematical logic. Third edition, Wadsworth and Brooks. Cited by: 5.10.
  • D. Michie, D. J. Spiegelhalter and C. C. Taylor (Eds.) (1994) Machine learning, neural and statistical classification. Series in Artificial Intelligence, Ellis Horwood. Cited by: 7.10.
  • A. Mihailidis, J. Boger, M. Candido and J. Hoey (2007) The use of an intelligent prompting system for people with dementia. ACM Interactions 14 (4), pp. 34–37. Cited by: 16.3.
  • M. L. Minsky and S. Papert (1988) Perceptrons: an introduction to computational geometry. Expanded edition, MIT Press. Cited by: 1.2, 7.10.
  • M. L. Minsky (1961) Steps towards artificial intelligence. Proceedings of the IEEE 49, pp. 8–30. External Links: Link Cited by: 3.10.
  • M. L. Minsky (1975) A framework for representing knowledge. In The Psychology of Computer Vision, P. Winston (Ed.), pp. 211–277. Note: Alternative version is in [J. Haugeland (Ed.) (1997)] Cited by: 1.2.
  • M. L. Minsky (1986) The society of mind. Simon and Schuster. Cited by: 1.5.10.
  • M. L. Minsky (1952) A neural-analogue calculator based upon a probability model of reinforcement. Technical report Harvard University Psychological Laboratories. Cited by: 1.2, 7.10.
  • S. Minton, M. D. Johnston, A. B. Philips and P. Laird (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58 (1-3), pp. 161–205. Cited by: 4.11.
  • M. Mitchell (1996) An introduction to genetic algorithms. MIT Press. Cited by: 4.11.
  • T. M. Mitchell (1977) Version spaces: a candidate elimination approach to rule learning. In Proc. 5th International Joint Conference on Artificial Intelligence, pp. 305–310. Cited by: 7.10.
  • T. Mitchell (1997) Machine learning. McGraw-Hill. Cited by: 7.10, 7.10.
  • V. Mnih, K. Kavukcuoglu and D. Silver (2015) Human-level control through deep reinforcement learning. Nature 518, pp. 529–533. External Links: Link Cited by: 12.12.
  • K. Mohan and J. Pearl (2014) Graphical models for recovering probabilistic and causal queries from missing data. In Advances of Neural Information Processing 27 (NIPS Proceedings), M. Welling, Z. Ghahramani, C. Cortes and N. Lawrence (Eds.), pp. 1520–1528. External Links: Link Cited by: 10.6.
  • E. F. Moore (1959) The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pp. pp. 285–292. Cited by: 3.10.
  • B. Motik, P. F. Patel-Schneider and B. C. Grau (Eds.) (2012) OWL 2 web ontology language: direct semantics. 2nd edition, W3C Recommendation 11 December 2012. External Links: Link Cited by: 14.6.
  • S. Muggleton and L. De Raedt (1994) Inductive logic programming: theory and methods. Journal of Logic Programming 19,20, pp. 629–679. Cited by: 15.5.
  • S. Muggleton (1995) Inverse entailment and Progol. New Generation Computing 13 (3,4), pp. 245–286. Cited by: 15.5.
  • K. P. Murphy (2012) Machine learning: a probabilistic perspective. MIT Press. Cited by: 7.10, 8.8.
  • N. Muscettola, P.P. Nayak, B. Pell and B.C. Williams (1998) Remote agent: to boldly go where no AI system has gone before. Artificial Intelligence 103, pp. 5–47. Cited by: 10..
  • J. F. Nash (1950) Equilibrium points in N-person games. Proceedings of the National Academy of Sciences of the United States of America 36, pp. 48–49. Cited by: 11.4.
  • D. S. Nau (2007) Current trends in automated planning. AI Magazine 28 (4), pp. 43–58. Cited by: 16.3, 6.7.
  • J. V. Neumann and O. Morgenstern (1953) Theory of games and economic behavior. Third edition, Princeton University Press. Cited by: 11.1, 9.7.
  • A. Newell and H. A. Simon (1976) Computer science as empirical enquiry: symbols and search. Communications of the ACM 19, pp. 113–126. Note: Reprinted in [J. Haugeland (Ed.) (1997)] Cited by: 1.4.4, 1.9.
  • A. Newell and H. A. Simon (1956) The logic theory machine: a complex information processing system. Technical report Technical Report P-868, The Rand Corporation. External Links: Link Cited by: 1.2.
  • A. Y. Ng and S. J. Russell (2000) Algorithms for inverse reinforcement learning.. In International Conference on Machine Learning (ICML), pp. 663–670. Cited by: 16.3.
  • A. Y. Ng (2004) Feature selection, L1 vs. L2 regularization, and rotational invariance. In Proceedings of the Twenty-first International Conference on Machine Learning, Cited by: 7.10.
  • I. Niles and A. Pease (2001) Towards a standard upper ontology. In Proceedings of the 2nd International Conference on Formal Ontology in Information Systems (FOIS-2001), C. Welty and B. Smith (Eds.), External Links: Link Cited by: 14.6.
  • N. J. Nilsson (1971) Problem-solving methods in artificial intelligence. McGraw-Hill. Cited by: 3.10.
  • N. J. Nilsson (2007) The physical symbol system hypothesis: status and prospects. In 50 Years of AI, Festschrift, M. Lungarella (Ed.), pp. 9–17. External Links: Link Cited by: 1.9.
  • N. J. Nilsson (2010) The quest for artificial intelligence: a history of ideas and achievements. Cambridge University Press. Cited by: 1.9.
  • N. Nisan, T. Roughgarden, E. Tardos and V. V. Vazirani (Eds.) (2007) Algorithmic game theory. Cambridge University Press. Cited by: 11.8.
  • N. Nisan (2007) Introduction to mechanisn design (for computer scientists). In Algorithmic Game Theory, N. Nisan and other (Eds.), pp. 209–242. Cited by: 11.8.
  • J. Nocedal and S. Wright (2006) Numerical optimization. Springer-Verlag. Cited by: 7.10.
  • P. C. Ordeshook (1986) Game theory and political theory: an introduction. Cambridge University Press. Cited by: 11.8.
  • L. Page, S. Brin, R. Motwani and T. Winograd (1999) The pagerank citation ranking: bringing order to the web. Technical report Technical Report SIDL-WP-1999-0120, Stanford InfoLab. External Links: Link Cited by: 8.5.1.
  • K. Panton, C. Matuszek, D.B. Lenat, D. Schneider, M. W. , N. Siegel and B. Shepard (2006) Common sense reasoning – from Cyc to intelligent assistant. In Ambient Intelligence in Everyday Life, Y. Cai and J. Abascal (Eds.), pp. 1–31. Cited by: 14.6.
  • J. Pearl (1984) Heuristics. Addison-Wesley. Cited by: 11.8, 3.10.
  • J. Pearl (1988) Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann. Cited by: 8.8.
  • J. Pearl (2009) Causality: models, reasoning and inference. 2nd edition, Cambridge University Press. Cited by: 5.10, 8.8.
  • A. Pease (2011) Ontology: a practical guide. Articulate Software Press. Cited by: 14.6.
  • M. Peden (Ed.) (2004) World report on road traffic injury prevention. World Health Organization. Cited by: 16.3.
  • Y. Peng and J. A. Reggia (1990) Abductive inference models for diagnostic problem-solving. Symbolic Computation – AI Series, Springer-Verlag. Cited by: 5.10.
  • F. C. N. Pereira and S. M. Shieber (2002) Prolog and natural-language analysis. Microtome Publishing. Cited by: 13.10.
  • T. Piketty (2014) Capital in the twenty-first century. Harvard University Press. External Links: ISBN 9780674369559, Link Cited by: 16.2.
  • M. E. Pollack (2005) Intelligent technology for an aging population: the use of AI to assist elders with cognitive impairment. AI Magazine 26 (2), pp. 9–24. Cited by: 16.3.
  • D. Poole, R. Goebel and R. Aleliunas (1987) Theorist: a logical reasoning system for defaults and diagnosis. In The Knowledge Frontier: Essays in the Representation of Knowledge, N. Cercone and G. McCalla (Eds.), pp. 331–352. Cited by: 5.10.
  • D. Poole, A.K. Mackworth and R.G. Goebel (1998) Computational intelligence: a logical approach. Oxford University Press. Cited by: Preface.
  • D. Poole (1993) Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence 64 (1), pp. 81–129. Cited by: 15.5.
  • D. Poole (1997) The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence 94, pp. 7–56. Note: special issue on economic principles of multi-agent systems External Links: Link Cited by: 15.5.
  • M. I. Posner (Ed.) (1989) Foundations of cognitive science. MIT Press. Cited by: 1.9.
  • W. Powell (2014) Energy and uncertainty: models and algorithms for complex energy systems. AI Magazine 35 (3), pp. 8–21. Cited by: 12.12.
  • M.L. Puterman (1994) Markov decision processes: discrete stochastic dynamic programming. John Wiley and Sons. Cited by: 9.7.
  • J. R. Quinlan and R. M. Cameron-Jones (1995) Induction of logic programs: FOIL and related systems. New Generation Computing 13 (3,4), pp. 287–312. Cited by: 15.5.
  • J. R. Quinlan (1986) Induction of decision trees. Machine Learning 1, pp. 81–106. Note: Reprinted in [J. W. Shavlik and T. G. Dietterich (Eds.) (1990)] Cited by: 7.10.
  • J. R. Quinlan (1993) C4.5 programs for machine learning. Morgan Kaufmann. Cited by: 7.10.
  • L.R. Rabiner (1989) A tutorial on hidden Markov models and selected applications in speech recognition. Proceedings of the IEEE 77 (2), pp. 257–286. Cited by: 8.8.
  • R. Reiter (1991) The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, V. Lifschitz (Ed.), pp. 359–380. Cited by: 15.5.
  • R. Reiter (2001) Knowledge in action: logical foundations for specifying and implementing dynamical systems. MIT Press. Cited by: 15.5.
  • J. A. Robinson (1965) A machine-oriented logic based on the resolution principle. Journal ACM 12 (1), pp. 23–41. Cited by: 5.10.
  • F. Rosenblatt (1958) The perceptron: a probabilistic model for information storage and organization in the brain. Psychological Review 65 (6), pp. 386–408. Cited by: 1.2, 7.10, 7.3.2.
  • S. J. Rosenschein and L. P. Kaelbling (1995) A situated view of representation and control. Artificial Intelligence 73, pp. 149–173. Cited by: 2.6.
  • F. Rossi, K. B. Venable and T. Walsh (2011) A short introduction to preferences: between artificial intelligence and social choice. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 9.7.
  • R. Y. Rubinstein (1981) Simulation and the monte carlo method. John Wiley and Sons. Cited by: 8.8.
  • D. E. Rumelhart, G. E. Hinton and R. J. Williams (1986) Learning internal representations by error propagation. In Parallel Distributed Processing, D. E. Rumelhart and J. L. McClelland (Eds.), pp. 318–362. Note: Reprinted in [J. W. Shavlik and T. G. Dietterich (Eds.) (1990)] Cited by: 7.10.
  • B. Russell (1917) Mysticism and logic and other essays. Allen and Unwin. Cited by: Chapter 15.
  • S. Russell and P. Norvig (2010) Artificial intelligence: a modern approach. Third edition, Prentice Hall. External Links: Link Cited by: 1.9.
  • S.J. Russell (1997) Rationality and intelligence. Artificial Intelligence 94, pp. 57–77. Cited by: 1.9.
  • E. D. Sacerdoti (1975) The nonlinear nature of plans. In Proc. 4th International Joint Conference on Artificial Intelligence, pp. 206–214. Cited by: 6.7.
  • A. L. Samuel (1959) Some studies in machine learning using the game of checkers. IBM Journal on Research and Development 3 (3), pp. 210–229. Note: Reprinted in E. A. Feigenbaum and J. Feldman, editors, Computers and Thought, McGraw-Hill, New York, 1963. Cited by: 1.2, 11.1.
  • T. Sandholm (2007) Expressive commerce and its application to sourcing: how we conducted $35 billion of generalized combinatorial auctions. AI Magazine 28 (3), pp. 45–58. Cited by: 1.9.
  • M.A. Satterthwaite (1975) Strategy-proofness and Arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10, pp. 187–217. Cited by: 11.6.
  • L. J. Savage (1972) The foundation of statistics. 2nd edition, Dover. Cited by: 9.7.
  • R. C. Schank (1990) What is AI, anyway?. In The Foundations of Artificial Intelligence, D. Partridge and Y. Wilks (Eds.), pp. 3–13. Cited by: 1.9.
  • R. E. Schapire (2002) The boosting approach to machine learning: an overview. In MSRI Workshop on Nonlinear Estimation and Classification, Cited by: 7.10.
  • L. K. Schubert (1990) Monotonic solutions to the frame problem in the situation calculus: an efficient method for worlds with fully specified actions. In Knowledge Representation and Defeasible Reasoning, H. E. Kyburg, R. P. Loui and G. N. Carlson (Eds.), pp. 23–67. Cited by: 15.5.
  • K. Schwab and W. E. Forum (2016) The fourth industrial revolution. World Economic Forum. External Links: ISBN 9781944835002, Link Cited by: 16.2.
  • G. Schwarz (1978) Estimating the dimension of a model. Annals of Statistics 6 (2), pp. 461–464. External Links: Link Cited by: 10.6.
  • B. Settles (2012) Active learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 7.10.
  • R. Shachter and M. A. Peot (1992) Decision making using probabilistic inference methods. In Proc. Eighth Conference on Uncertainty in Artificial Intelligence (UAI-92), pp. 276–283. Cited by: 9.7.
  • M. Shanahan (1989) Prediction is deduction, but explanation is abduction. In Proc. 11th International Joint Conference on Artificial Intelligence (IJCAI-89), pp. 1055–1060. Cited by: 5.10.
  • M. Shanahan (1997) Solving the frame problem: a mathematical investigation of the common sense law of inertia. MIT Press. Cited by: 15.5.
  • N. Sharkey (2008) The ethical frontiers of robotics. Science 322 (5909), pp. 1800 – 1801. External Links: Link Cited by: 16.2, 16.3.
  • J. W. Shavlik and T. G. Dietterich (Eds.) (1990) Readings in machine learning. Morgan Kaufmann. Cited by: 7.10, P. Cheeseman, J. Kelly, M. Self, J. Stutz, W. Taylor and D. Freeman (1988), D. Haussler (1988), J. R. Quinlan (1986), D. E. Rumelhart, G. E. Hinton and R. J. Williams (1986), L. G. Valiant (1984).
  • M. W. Shelley (1818) Frankenstein; or, the modern prometheus. Lackington, Hughes, Harding, Mavor and Jones. Cited by: 16.3.
  • Y. Shoham and K. Leyton-Brown (2008) Multiagent systems: algorithmic, game theoretic, and logical foundations. Cambridge University Press. Cited by: 11.8, 11.8, Chapter 11.
  • Y. Shoham (2016) Why knowledge representation matters. Communications of the ACM 59 (1), pp. 47–49. External Links: Link Cited by: 1.9.
  • D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. van den Driessche, J. Schrittwieser, I. , V. Panneershelvam, M. Lanctot, Dieleman, D. Grewe, J. Nham, N. Kalchbrenner, Sutskever, T. Lillicrap, M. Leach, K. Kavukcuoglu, T. and D. Hassabis (2016) Mastering the game of Go with deep neural networks and tree search. Nature 529 (7587), pp. 484–489. External Links: ISBN 0028-0836, Link Cited by: 11.1, 11.8, 12.12.
  • H. A. Simon (1995) Artificial intelligence: an empirical science. Artificial Intelligence 77 (1), pp. 95–127. Cited by: 1.9.
  • H. A. Simon (1996) The sciences of the artificial. third edition, MIT Press. Cited by: 1.9, 2.6, Chapter 2.
  • P. W. Singer (2009) Robots at war: the new battlefield. The Wilson Quarterly. External Links: Link Cited by: 16.3.
  • P. W. Singer (2009) Wired for war: the robotics revolution and conflict in the 21st century. Penguin. Cited by: 16.3.
  • B. Smith (2003) Ontology. In Blackwell Guide to the Philosophy of Computing and Information, L. Floridi (Ed.), pp. 155–166. External Links: Link Cited by: 14.6.
  • B. Smith (2015) Basic formal ontology 2.0: specification and user’s guide. Technical report Institute for Formal Ontology and Medical Information Science (IFOMIS). External Links: Link Cited by: 14.6.
  • B. C. Smith (1991) The owl and the electric encyclopedia. Artificial Intelligence 47, pp. 251–288. Cited by: 1.9.
  • B. C. Smith (1996) On the origin of objects. MIT Press. Cited by: Chapter 14.
  • M. Somerville (2006) The ethical imagination: journeys of the human spirit. House of Anansi Press. Cited by: 16.2.
  • J. F. Sowa (2000) Knowledge representation: logical, philosophical, and computational foundations. Brooks Cole. Cited by: 1.9, 14.6, 14.6.
  • J. F. Sowa (2011) Future directions for semantic systems. In Intelligence-based Software Engineering, A. Tolk and L. C. Jain (Eds.), pp. 23–47. External Links: Link Cited by: 14.6.
  • J. C. Spall (2003) Introduction to stochastic search and optimization: estimation, simulation. Wiley. Cited by: 4.11.
  • D. J. Spiegelhalter, R. C. G. Franklin and K. Bull (1990) Assessment, criticism and improvement of imprecise subjective probabilities for a medical expert system. In Uncertainty in Artificial Intelligence 5, M. Henrion, R. D. Shachter, L.N. Kanal and J.F. Lemmer (Eds.), pp. 285–294. Cited by: 7.10.
  • P. Spirtes, C. Glymour and R. Scheines (2001) Causation, prediction, and search. 2nd edition, MIT Press. Cited by: 5.10, 8.8.
  • L. S. Sterling and E. Y. Shapiro (1994) The art of Prolog: advanced programming techniques. second edition, MIT Press. Cited by: 13.10.
  • N. A. Stillings, M. H. Feinstein, J. L. Garfield, E. L. Rissland, Rosenbaum, S. E. Weisler and L. Baker-Ward (1987) Cognitive science: an introduction. MIT Press. Cited by: 1.9.
  • P. Stone, R. Brooks, E. Brynjolfsson, R. Calo, O. Etzioni, G. Hager, J. Hirschberg, S. Kalyanakrishnan, Kamar, S. Kraus, K. Leyton-Brown, D. Parkes, W. Press, A. Saxenian, J. Shah, M. Tambe and A. Teller (2016) Artificial intelligence and life in 2030: one hundred year study on artificial intelligence: report of the 2015-2016 study panel. Technical report Stanford University. External Links: Link Cited by: 16.2, 16.3.
  • P. Stone and M. Veloso (2000) Multiagent systems: a survey from a machine learning perspective. Autonomous Robots 8, pp. 345–383. Cited by: 11.8.
  • P. Stone (2007) Learning and multiagent reasoning for autonomous agents. In The 20th International Joint Conference on Artificial Intelligence (IJCAI-07), pp. 13–30. External Links: Link Cited by: 16.3.
  • F. M. Suchanek, G. Kasneci and G. Weikum (2007) YAGO: a core of semantic knowledge – unifying WordNet and Wikipedia. In 16th international World Wide Web conference (WWW 2007), Cited by: 14.6.
  • R. S. Sutton and A. G. Barto (1998) Reinforcement learning: an introduction. MIT Press. Cited by: 12.12.
  • C. Szepesvári (2010) Algorithms for reinforcement learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 12.12.
  • A. Tarski (1956) Logic, semantics, metamathematics. Clarendon Press. Note: Papers from 1923 to 1938 collected and translated by J. H. Woodger. Cited by: 5.10.
  • A. Tate (1977) Generating project networks. In Proc. 5th International Joint Conference on Artificial Intelligence, pp. 888–893. Cited by: 6.7.
  • T. Tharp (2003) The creative habit: learn it and use it for life. Simon and Schuster. Cited by: Chapter 9.
  • S. Thrun (2006) Winning the DARPA grand challenge. In Innovative Applications of Artificial Intelligence Conference, (IAAI-06), pp. 16–20. Cited by: 16.2.
  • S. Thrun, W. Burgard and D. Fox (2005) Probabilistic robotics. MIT Press. Cited by: 8.8.
  • A. Turing (1950) Computing machinery and intelligence. Mind 59, pp. 433–460. Note: Reprinted in [J. Haugeland (Ed.) (1997)]. Cited by: 1.1.1, 1.9.
  • A. Tversky and D. Kahneman (1974) Judgment under uncertainty: heuristics and biases. Science 185, pp. 1124–1131. Cited by: 9.1.1.
  • L. G. Valiant (1984) A theory of the learnable. Communications of the ACM 27, pp. 1134–1142. Note: Reprinted in [J. W. Shavlik and T. G. Dietterich (Eds.) (1990)] Cited by: 7.10.
  • P. van Beek and X. Chen (1999) CPlan: a constraint programming approach to planning. In AAAI-99, pp. 585–590. Cited by: 6.7.
  • M. H. van Emden and R. A. Kowalski (1976) The semantics of predicate logic as a programming language. Journal ACM 23 (4), pp. 733–742. Cited by: 5.10.
  • U. Visser and H.-D. Burkhard (2007) RoboCup: 10 years of achievements and challenges. AI Magazine 28 (2), pp. 115–130. Cited by: 16.3.
  • P. Viswanathan, A. K. Mackworth, J. J. Little and A. Mihailidis (2007) Intelligent wheelchairs: collision avoidance and navigation assistance for older adults with cognitive impairment. In Proc. Workshop on Intelligent Systems for Assisted Cognition, Cited by: 16.3.
  • N. Vlassis (2007) A concise introduction to multiagent systems and distributed artificial intelligence. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 11.8.
  • D. Vrandečić and M. Krötzsch (2014) Wikidata: a free collaborative knowledgebase. Communications of the ACM 57 (10), pp. 78–85. Cited by: 14.6.
  • W3C OWL Working Group (Ed.) (2012) OWL 2 web ontology language document overview. 2nd edition, W3C Recommendation 11 December 2012. External Links: Link Cited by: 14.6.
  • P. P. Wakker (2010) Prospect theory: for risk and ambiguity. Cambridge University Press. Cited by: 9.7.
  • R. Waldinger (1977) Achieving several goals simultaneously. In Machine Intelligence 8: Machine Representations of Knowledge, E. Elcock and D. Michie (Eds.), pp. 94–136. Cited by: 6.7.
  • T. Walsh (2007) Representing and reasoning with preferences. AI Magazine 28 (4), pp. 59–69. Cited by: 9.7.
  • H. Wang (1960) Toward mechanical mathematics. IBM Journal of Research and Development 4 (1), pp. 2–22. External Links: Document Cited by: 1.2.
  • D. H. D. Warren and F. C. N. Pereira (1982) An efficient easily adaptable system for interpreting natural language queries. Computational Linguistics 8 (3–4), pp. 110–122. External Links: Link Cited by: 1.2.
  • B. L. Webber and N. J. Nilsson (Eds.) (1981) Readings in artificial intelligence. Morgan Kaufmann. Cited by: C. Green (1969).
  • G. Weiss (Ed.) (1999) Multiagent systems: a modern approach to distributed artificial intelligence. MIT Press. Cited by: 11.8.
  • D. S. Weld and J. de Kleer (Eds.) (1990) Readings in qualitative reasoning about physical systems. Morgan Kaufmann. Cited by: 2.6.
  • D. S. Weld (1992) Qualitative physics: albatross or eagle?. Computational Intelligence 8 (2), pp. 175–186. Note: Introduction to special issue on the future of qualitative physics. Cited by: 2.6.
  • D. S. Weld (1994) An introduction to least commitment planning. AI Magazine 15 (4), pp. 27–61. Cited by: 6.7.
  • D. S. Weld (1999) Recent advances in AI planning. AI Magazine 20 (2). External Links: Link Cited by: 6.7.
  • M. P. Wellman (2011) Trading agents. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan and Claypool. External Links: Document Cited by: 1.9.
  • A. N. Whitehead and B. Russell (1910) Principia mathematica. 2nd edn, 1925 (Vol. 1), 1927 (Vols 2, 3), Cambridge University Press. Cited by: 1.2.
  • D. Whitley (2001) An overview of evolutionary algorithms. Journal of Information and Software Technology 43, pp. 817–831. External Links: Link Cited by: 4.11.
  • D. E. Wilkins (1988) Practical planning: extending the classical ai planning paradigm. Morgan Kaufmann. Cited by: 6.7.
  • T. Winograd (1990) Thinking machines: Can there be? Are we?. In The Foundations of Artificial Intelligence: A Sourcebook, D. Partridge and Y. Wilks (Eds.), pp. 167–189. Cited by: 1.9.
  • T. Winograd (1972) Understanding natural language. Academic Press. Note: Also published in Cognitive Psychology, 3:1 (1972), pp. 1-191. Cited by: 1.1.1, 1.2.
  • William. A. Woods (2007) Meaning and links. AI Magazine 28 (4), pp. 71–92. Cited by: 14.6.
  • M. Wooldridge (2002) An introduction to multiagent systems. John Wiley and Sons. Cited by: 11.8.
  • Q. Yang (1997) Intelligent planning: a decomposition and abstraction-based approach. Springer-Verlag. Cited by: 6.7.
  • S. Yang and A. K. Mackworth (2007) Hierarchical shortest pathfinding applied to route-planning for wheelchair users. In Proc. Canadian Conference on Artificial Intelligence, AI-2007, Cited by: 16.3.
  • N. L. Zhang and D. Poole (1994) A simple approach to Bayesian network computations. In Proc. 10th Canadian Conference on Artificial Intelligence, pp. 171–178. Cited by: 8.8.
  • N. L. Zhang (2004) Hierarchical latent class models for cluster analysis. Journal of Machine Learning Research 5 (6), pp. 697–723. Cited by: 10.6.
  • Y. Zhang and A. K. Mackworth (1995) Constraint nets: a semantic model for hybrid dynamic systems. Theoretical Computer Science 138, pp. 211–239. Cited by: 2.6.
  • S. Zilberstein (1996) Using anytime algorithms in intelligent systems. AI Magazine 17 (3), pp. 73–83. Cited by: 1.9.