Università degli Studi di Pavia

Facoltà di Ingegneria


Artificial Intelligence

A.A. 2014-2015

First Semester

Fri: 11:00 a.m. - 1:00 p.m., Room E4

Fri: 2:00 p.m. - 4:00 p.m., Room E4

Lectures & Suggested Readings:

  • Reports of errors in the resources below are always welcome
    1. 2014.10.03 (theory)

      Introduction [pdf]

      Alan Turing (Wikipedia)
      Computer chess (Wikipedia)

      Shannon, C., "Programming a Computer for Playing Chess", Philosophical Magazine, 41 (314), 1950 [pdf]

      Campbell, M., Hoane, A. J., Hsu, F., "Deep Blue", Artificial Intelligence, 134 (1-2), 2001 [pdf]

      "Building Watson - A Brief Overview of the DeepQA Project", YouTube, 2011 [video]

      "Final Jeopardy! and the Future of Watson", TED, 2011 [video]

      Ferrucci, D., et al., "Building Watson: An Overview of the DeepQA Project", AI Magazine, 3 (31), 2010 [pdf]

    2. 2014.10.03 (theory)

      Symbolic reasoning [pdf]
      Language, schemas and reasoning

      Syllogism (ancient logic) (Wikipedia)

    3. 2014.10.10 (theory)

      Propositional logic [pdf]
      Boolean algebras, formal propositional language and its semantics, satisfiability, entailment

    4. 2014.10.17 (theory)

      Logical calculus and algorithms [pdf]
      Decision problems, entailment as a satisfiability problem (i.e. refutation), Semantic Tableau

    5. 2014.10.24 (theory)

      Propositional resolution [pdf]
      Resolution as inference rule, propositional resolution by refutation

    6. 2014.10.31 (theory)

      First-Order logic [pdf]
      First-Order semantic structures, language, validity

    7. 2014.11.07 (theory)

      Semi-decidability of First-Order logic [pdf]
      Prenex normal form, skolemization, Herbrand's theorem

    8. 2014.11.07 (theory)

      First-Order resolution [pdf]
      Clausal form, unification, resolution method for first-order logic

    9. 2014.11.14 (theory)

      SLD resolution [pdf]
      Horn clauses, SLD resolution, logic programming

      Re-definition of Prolog append/3 using the function cons/2 [pl]
      A note [pdf] describing the trace of an example of SLD resolution with append/3

      All Prolog examples are compatible with SWI-Prolog (free software) [link]

    10. 2014.11.21 (theory)

      Minimal models, logic programs [pdf]
      Herbrand models, minimal models, logic programming systems

    11. 2014.11.21 (theory)

      Plausible reasoning [pdf]
      Negation as failure, closed world assumption, deductive, inductive and abductive reasoning

      Christiansen, H., Abductive reasoning in Prolog and CHR, Roskilde University, Computer Science Dept. Denmark, 2005 [pdf]

      The Constraint Handling Rules (CHR) module is part of SWI-Prolog (see [link])

    12. 2014.11.28 (theory)

      Probabilitistic reasoning: representation and inference [pdf]
      Foundations of probability, random variables, Bayes' theorem, probabilistic inference

      Probability space (Wikipedia)
      Probability axioms (Wikipedia)
      Random variable (Wikipedia)

    13. 2014.12.05 (theory)

      Graphical models [pdf]
      Graphical models and factorization, d-separation, inference, computational methods

      Examples with "Bayes" (free software) available on AISpace
      [download] (see Belief and Decision Networks)

    14. 2014.12.12 (theory)

      Supervised learning [pdf]
      Learning proababilities from observations: maximum likelihood estimator, maximum a posteriori probability, conjugate prior distribution

    15. 2014.12.19 (theory)

      Unsupervised learning [pdf]
      Learning from incomplete observations: k-means, hidden random variables, EM algorithm. An example: latent Dirichlet allocation (LDA)

      A simple Java implementation of the EM algorithm for coin tossing [zip]

    16. 2015.01.09 (theory)

      Reinforcement learning [pdf]
      Multi-armed bandits and methods, Thompson sampling, Markov Decision Processes, value function, optimal policy, iterative learning algorithms

      Sutton, R.S., Barto, A.G., Reinforcement Learning: An Introduction, 2nd Edition (draft) [link]
      (at this time, the draft is freely available at the above link)

      Reinforcement Learning Simulator: a demo for the maze example implemented in Java [link]

    17. 2015.01.16 (theory)

      Online learning and self-organizing systems [pdf]

      Simple and exponential moving averages: a worksheet example [xlsx]

      Fritzke, B., Some Competitive Learning Methods, Ruhr-Universität Bochum, TR, 1997 [pdf]
      Self-Organizing Networks [Java applet]

      SOAM: self-organizing adaptive maps, seminar presentation [pdf]

    Instructor

    1. Marco Piastra

    2. Contact: marco.piastra@unipv.it


    Exams

    1. AI Question Time
      Mon 2015.01.19 Room E6 11am-1pm

    2. See Faculty website


    Further resources:

    (There is no required text for this course. The following books are recommended as optional readings)

    1. Mordechai Ben-Ari. Mathematical Logic for Computer Science (3rd Edition). Springer, 2012

    2. Artificial Intelligence: A Modern Approach (3rd Edition). Prentice Hall, 2009.


    Links

    1. Artificial Intelligence Reading Group


    1. Artificial Intelligence, A.A. 2013-2014 and before