Università degli Studi di Pavia

Facoltà di Ingegneria


Artificial Intelligence

A.A. 2013-2014

First Semester

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

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

Lectures & Suggested Readings:

  • Reports of errors in the resources below are always welcome
    1. 2013.10.04 (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. 2013.10.04 (theory)

      Formal Logic [pdf]
      Language, schemas and reasoning

      Syllogism (ancient logic) (Wikipedia)

    3. 2013.10.11 (theory)

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

    4. 2013.10.18 (theory)

      Decisions and Algorithms [pdf]
      Decision problems, entailment as a satisfiability problem (i.e. refutation), computational complexity, Semantic Tableau

      The Halting Problem (Wikipedia)
      Big O notation (Wikipedia)
      The NP complexity class (Wikipedia)

    5. 2013.11.25 (theory)

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

    6. 2013.11.08 (theory)

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

    7. 2013.11.15 (theory)

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

    8. 2013.11.22 (theory)

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

    9. 2013.11.22 (lab)

      The world of lists in Prolog [pdf]
      Re-definition of append/3 using the function cons/2 [pl]

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

    10. 2013.11.29 (theory)

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

    11. 2013.11.29 (theory)

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

    12. 2013.12.06 (theory)

      Probabilitistic reasoning: representation [pdf]
      Foundations of probability, random variables, graphical models

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

    13. 2013.12.13 (theory)

      Probabilitistic reasoning: inference [pdf]
      Examples of graphical models, inference, computation methods

    14. 2013.12.13 (lab)

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

    15. 2013.12.20 (theory)

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

    16. 2013.12.20 (theory)

      Learning with numbers [pdf]
      K-means, Expectation-Maximization (EM) algorithm

      Ng, Andrew, The EM Algorithm, Stanford Engineering Everywhere (SEE), Course Notes [pdf]

    17. 2013.12.20 (lab)

      Examples of the K-means (i.e. Lloyd's) algorithm [Java applet]

      Examples of the EM algorithm for the mixture of Gaussians model [Java applet]

    18. 2014.01.10 (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)

    19. 2014.01.17 (theory)

      Self-organizing systems [pdf]

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

      Marsland, S., A self-organising network that grows when required, Neural Networks, 15, 2002 [pdf]

    Instructor

    1. Marco Piastra

    2. Contact: marco.piastra@unipv.it


    Exams

    1. AI Question Time
      Mon 2014.01.27 Aula E4 3pm-5pm

    2. See faculty website for information about exams


    Further resources:

    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, A.A. 2012-2013 and before