User Tools

Site Tools


teaching:is:main_is

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:is:main_is [2025/03/10 19:19]
Franconi Enrico [Slides & Reference Material]
teaching:is:main_is [2025/06/22 18:12] (current)
Franconi Enrico [Final Exam]
Line 37: Line 37:
   * Slides: {{ :teaching:is:lect.1.0.pdf |Welcome Aboard}}   * Slides: {{ :teaching:is:lect.1.0.pdf |Welcome Aboard}}
   * Slides: Artificial Intelligence and Agents {{ :teaching:is:ai-new-lect.1.0.pdf |parts 1 & 2}}, {{ :teaching:is:lect_01_3_h.pdf |part 3}}, {{ :teaching:is:lect_01_4_h.pdf |part 4}}, {{ :teaching:is:lect.2.1.pdf |part 5}}   * Slides: Artificial Intelligence and Agents {{ :teaching:is:ai-new-lect.1.0.pdf |parts 1 & 2}}, {{ :teaching:is:lect_01_3_h.pdf |part 3}}, {{ :teaching:is:lect_01_4_h.pdf |part 4}}, {{ :teaching:is:lect.2.1.pdf |part 5}}
-    * Material: {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_2.html|chapter 1}} and {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_33.html|chapter 2}} of //Poole and Mackworth//+    * Material: {{https://artint.info/3e/html/ArtInt3e.Ch1.html|chapter 1}} and {{https://artint.info/3e/html/ArtInt3e.Ch2.html|chapter 2}} of //Poole and Mackworth//
   * Slides: States and Searching {{:teaching:is:lect.3.1.pdf|part 1}}, {{:teaching:is:lect.3.2.pdf|part 2}}, {{:teaching:is:lect.3.3.pdf|part 3}}, {{:teaching:is:lect.3.4.pdf|part 4}}    * Slides: States and Searching {{:teaching:is:lect.3.1.pdf|part 1}}, {{:teaching:is:lect.3.2.pdf|part 2}}, {{:teaching:is:lect.3.3.pdf|part 3}}, {{:teaching:is:lect.3.4.pdf|part 4}} 
-    * Material: {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_46.html|chapter 3}} of //Poole and Mackworth// +    * Material: {{https://artint.info/3e/html/ArtInt3e.Ch3.html|chapter 3}} of //Poole and Mackworth// 
-  * Slides: Features and Constraints {{:teaching:is:lect.4.1.pdf|part 1}}, {{:teaching:is:lect.4.2.pdf|part 2}}+  * Slides: Features and Constraints {{:teaching:is:lect.4.1.pdf|part 1}}, <del>{{:teaching:is:lect.4.2.pdf|part 2}}</del>
     * Material: chapter 4 of //Poole and Mackworth//     * Material: chapter 4 of //Poole and Mackworth//
   * Slides: Propositions and Inference {{:teaching:is:lect.5.1.pdf|part 1}}, {{:teaching:is:lect.5.2.pdf|part 2}}, {{:teaching:is:lect.5.3.pdf|part 3}}, {{:teaching:is:lect.5.4.pdf|part 4}} \\ Slides: Diagnosis {{:teaching:is:lect.5.5.pdf|part 1}}, <del>{{:teaching:is:lect.5.6.pdf|part 2}}</del>, {{:teaching:is:lect.5.7.pdf|part 3}}, <del>{{:teaching:is:lect.5.8.pdf|part 4}}, {{:teaching:is:lect.5.9.pdf|part 5}}</del>    * Slides: Propositions and Inference {{:teaching:is:lect.5.1.pdf|part 1}}, {{:teaching:is:lect.5.2.pdf|part 2}}, {{:teaching:is:lect.5.3.pdf|part 3}}, {{:teaching:is:lect.5.4.pdf|part 4}} \\ Slides: Diagnosis {{:teaching:is:lect.5.5.pdf|part 1}}, <del>{{:teaching:is:lect.5.6.pdf|part 2}}</del>, {{:teaching:is:lect.5.7.pdf|part 3}}, <del>{{:teaching:is:lect.5.8.pdf|part 4}}, {{:teaching:is:lect.5.9.pdf|part 5}}</del> 
     * Material: chapter 5 of //Poole and Mackworth//     * Material: chapter 5 of //Poole and Mackworth//
-  * Slides: Deterministic Planning {{ :teaching:is:lect.8.1 v4.pdf |part 1}}, {{ :teaching:is:lect.8.2 v4.pdf |part 2}}, {{ :teaching:is:lect.8.3 v4.pdf |part 3}}, {{ :teaching:is:lect.8.4 v4.pdf |part 4}}  +  * <del>Slides: Deterministic Planning {{ :teaching:is:lect.8.1 v4.pdf |part 1}}, {{ :teaching:is:lect.8.2 v4.pdf |part 2}}, {{ :teaching:is:lect.8.3 v4.pdf |part 3}}, {{ :teaching:is:lect.8.4 v4.pdf |part 4}} </del> 
-    * Material: chapter 6 of //Poole and Mackworth//+    * <del>Material: chapter 6 of //Poole and Mackworth// </del>
 /*  * Slides: Multiagent Systems and Games {{ :teaching:is:lect.10.1_v4.pdf |part 1}} /*  * Slides: Multiagent Systems and Games {{ :teaching:is:lect.10.1_v4.pdf |part 1}}
     * Material: chapter 10 of //Poole and Mackworth// */     * Material: chapter 10 of //Poole and Mackworth// */
Line 68: Line 68:
     * Explore with the search applet the **Delivery Robot (Acyclic)**, the **Delivery Robot (cyclic)**, the **Vancouver Neighbourood**, the **Module 4** sample problem graphs: with //Depth First//, //Breadth First//, //Lowest Cost First// search strategies using different //Neighbour Ordering Strategies//; practice also with the //quiz// facility.     * Explore with the search applet the **Delivery Robot (Acyclic)**, the **Delivery Robot (cyclic)**, the **Vancouver Neighbourood**, the **Module 4** sample problem graphs: with //Depth First//, //Breadth First//, //Lowest Cost First// search strategies using different //Neighbour Ordering Strategies//; practice also with the //quiz// facility.
     * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercise]] 3.B.         * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercise]] 3.B.    
-    * Exercise: practicing different search strategies with the graph in this {{teaching:is:search_bf_df_lcf.pdf|slides}} /* ({{ :teaching:is:search-problem.xml.zip |solution}} as a XML file for the applet) */+    * Exercise: practicing different search strategies with the graph in this {{teaching:is:search_bf_df_lcf.pdf|slides}} ({{ :teaching:is:search-problem.xml.zip |solution}} as a XML file for the applet) 
     * Create your own problem graph for a delivery robot starting from a map with edge costs.     * Create your own problem graph for a delivery robot starting from a map with edge costs.
     * Create a problem graph for a simple problem chosen by you.     * Create a problem graph for a simple problem chosen by you.
     * IMPORTANT: learn how to write on paper the frontier evolution for each search.     * IMPORTANT: learn how to write on paper the frontier evolution for each search.
 +      * describe a search on a graph by writing the frontier (i.e., a set of paths) at each step of the search, and by specifying the selected path from the frontier in one step leading to the next step.
 * <color #22b14c>LAB 2</color>: Graph Searching with Heuristics * <color #22b14c>LAB 2</color>: Graph Searching with Heuristics
     * Explore the **Delivery Robot (Acyclic)**, the **Delivery Robot (cyclic)**, the **Vancouver Neighbourood**, the **Module 4** sample problem graphs: with //Best First, Heuristic Depth First, A*, Branch and Bound// search strategies, with or without //Multiple-Path Pruning// or //Loop Detection//, using different //Neighbour Ordering Strategies//. Explore also the behaviour with the abovementioned search graphs with potentially non terminating depth first strategies (e.g., //Depth First// or //Heuristic Depth First//) without cycle checking, and with loop detection or multiple path pruning.     * Explore the **Delivery Robot (Acyclic)**, the **Delivery Robot (cyclic)**, the **Vancouver Neighbourood**, the **Module 4** sample problem graphs: with //Best First, Heuristic Depth First, A*, Branch and Bound// search strategies, with or without //Multiple-Path Pruning// or //Loop Detection//, using different //Neighbour Ordering Strategies//. Explore also the behaviour with the abovementioned search graphs with potentially non terminating depth first strategies (e.g., //Depth First// or //Heuristic Depth First//) without cycle checking, and with loop detection or multiple path pruning.
     * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercises]] 3.C, 3.D, 3.E.      * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercises]] 3.C, 3.D, 3.E. 
-    * Exercise: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_71.html|3.4]] /* ([[teaching:is:heuristics-solution|solution]]). */+    * Exercise: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_71.html|3.4]]([[teaching:is:heuristics-solution|solution]]). 
     * IMPORTANT:      * IMPORTANT: 
       * learn how to write on paper the frontier evolution for each search;       * learn how to write on paper the frontier evolution for each search;
Line 83: Line 84:
      * Explore with the CSP applet the sample problems: Simple Problem 1, Simple Problem 2, Scheduling Problem 1, Crossword Problem 1, Crossword Problem 2. These sample problems have been seen already in the course lectures; for the crossword problems, try to reconstruct the crossword graphical structure.      * Explore with the CSP applet the sample problems: Simple Problem 1, Simple Problem 2, Scheduling Problem 1, Crossword Problem 1, Crossword Problem 2. These sample problems have been seen already in the course lectures; for the crossword problems, try to reconstruct the crossword graphical structure.
     * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercises]] 4.A, 4.B.      * Do the [[http://www.aispace.org/exercises.shtml|Practice Exercises]] 4.A, 4.B. 
-    * Exercises: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_99.html|4.2, 4.3 (only a,b), 4.5]] - CSP and arc consistency /* ([[teaching:is:csp-solutions|solutions]]). */+    * Exercises: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_99.html|4.2, 4.3 (only a,b), 4.5]] - CSP and arc consistency ([[teaching:is:csp-solutions|solutions]]).
 * <color #22b14c>LAB 5</color>: Propositions and Inference * <color #22b14c>LAB 5</color>: Propositions and Inference
     * Getting started with [[https://artint.info/code/ailog/ailog_man.html|AILog2]], a representation and reasoning system for definite clauses, with declarative debugging tools.     * Getting started with [[https://artint.info/code/ailog/ailog_man.html|AILog2]], a representation and reasoning system for definite clauses, with declarative debugging tools.
Line 94: Line 95:
           * Mac: <html><tt>ailog: load '/path-to-kbfile/kbfile.ail'.</tt></html>           * Mac: <html><tt>ailog: load '/path-to-kbfile/kbfile.ail'.</tt></html>
     * Play with the [[https://artint.info/code/ailog/ailog_code/ch05/elect_prop.ail|elect_prop.ail]] electrical wiring example 5.7 from Section 5.3 of the book and the slides.     * Play with the [[https://artint.info/code/ailog/ailog_code/ch05/elect_prop.ail|elect_prop.ail]] electrical wiring example 5.7 from Section 5.3 of the book and the slides.
-    * Do Exercises [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_137.html|5.1, 5.2, 5.3, 5.4]]  /([[teaching:is:prop-rules-solutions|solutions]]) */+    * Do Exercises [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_137.html|5.1, 5.2, 5.3, 5.4]] ([[teaching:is:prop-rules-solutions|solutions]]) 
     * Find other AILog knowledge base examples[[https://www.cs.ubc.ca/~poole/aibook/code/ailog/ailog_code/ailog_code.html|here]]  (play with askable and debugging)     * Find other AILog knowledge base examples[[https://www.cs.ubc.ca/~poole/aibook/code/ailog/ailog_code/ailog_code.html|here]]  (play with askable and debugging)
  
 * <color #22b14c>LAB 6</color>: Assumables and Consistency-based Diagnosis * <color #22b14c>LAB 6</color>: Assumables and Consistency-based Diagnosis
-    * Excercises {{ :teaching:is:exercise_5.9_5.13.pdf |5.9 and 5.13}} and {{ :teaching:is:exercise_5.17.pdf |5.17}}.  \\ Use [[https://artint.info/code/ailog/ailog_man.html|AILog2]] to verify the correctness of your answers; AILog2 can assert assumables (see [[https://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man_14.html|manual]]), and can ask for the derivation of the false atom. /* \\ ([[teaching:is:assumables-solutions|solutions]]) */+    * Excercises {{ :teaching:is:exercise_5.9_5.13.pdf |5.9 and 5.13}} and {{ :teaching:is:exercise_5.17.pdf |5.17}}.  \\ Use [[https://artint.info/code/ailog/ailog_man.html|AILog2]] to verify the correctness of your answers; AILog2 can assert assumables (see [[https://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man_14.html|manual]]), and can ask for the derivation of the false atom. \\ ([[teaching:is:assumables-solutions|solutions]])
  
-* <color #22b14c>LAB 7</color>: Debug, Diagnosis, Abduction+* <color #22b14c>LAB 7</color>: Debug, Diagnosis /*, Abduction */
      * Keep using [[https://artint.info/code/ailog/ailog_man.html|AILog2]]      * Keep using [[https://artint.info/code/ailog/ailog_man.html|AILog2]]
      * Go through Sections 6, 7, 9 of the [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man.html|manual]]      * Go through Sections 6, 7, 9 of the [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man.html|manual]]
Line 108: Line 109:
        * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_bug2.ail|elect_bug2.ail]] the buggy electrical wiring example from Exercise 5.6         * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_bug2.ail|elect_bug2.ail]] the buggy electrical wiring example from Exercise 5.6 
        * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_bug3.ail|elect_bug3.ail]] a buggy electrical wiring example, which fails to prove lit_l2, but should succeed         * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_bug3.ail|elect_bug3.ail]] a buggy electrical wiring example, which fails to prove lit_l2, but should succeed 
-       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_cbd.ail|elect_cbd.ail]] electrical wiring example for consistency-based diagnosis; Example 5.20 in [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_124.html|Section 5.4.3]] +       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_cbd.ail|elect_cbd.ail]] electrical wiring example for consistency-based diagnosis; Example 5.20 in [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_124.html|Section 5.4.3]] /* 
-       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_abd.ail|elect_abd.ail]] electrical wiring example with abduction; Example 5.31 in [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_133.html|Section 5.6]] +       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch05/elect_abd.ail|elect_abd.ail]] electrical wiring example with abduction; Example 5.31 in [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_133.html|Section 5.6]] */ 
-       * Exercises: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_137.html|5.5, 5.6, 5.7, 5.9, 5.13]]  /* ([[teaching:is:diag-rules-solutions|solutions]]) */ +       * Exercises: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_137.html|5.5, 5.6, 5.7]]  ([[teaching:is:diag-rules-solutions|solutions]]) 
-* <color #22b14c>LAB 8</color>: Planning with Certainty+<del><color #22b14c>LAB 8</color>: Planning with Certainty</del>
   * Do {{ :teaching:is:ex_strips.pdf |Practice Exercise 8.A}} and {{ :teaching:is:ex_csp_planning.pdf |Practice Exercise 8.B}} /* ({{ :teaching:is:ex_strips_sol.pdf |Practice Exercise 8.A solution}} and {{ :teaching:is:ex_csp_planning_sol.pdf |Practice Exercise 8.B solution}}). */   * Do {{ :teaching:is:ex_strips.pdf |Practice Exercise 8.A}} and {{ :teaching:is:ex_csp_planning.pdf |Practice Exercise 8.B}} /* ({{ :teaching:is:ex_strips_sol.pdf |Practice Exercise 8.A solution}} and {{ :teaching:is:ex_csp_planning_sol.pdf |Practice Exercise 8.B solution}}). */
   * Using the {{ :teaching:is:stripstocsp.jar.zip |STRIPS-to-CSP applet}} exercise with the coffee delivery problems (simple and complete) pre-loaded on the applet - [[https://aispace.org/strips_to_csp/|tutorial]]   * Using the {{ :teaching:is:stripstocsp.jar.zip |STRIPS-to-CSP applet}} exercise with the coffee delivery problems (simple and complete) pre-loaded on the applet - [[https://aispace.org/strips_to_csp/|tutorial]]
Line 127: Line 128:
        * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.4,12.5,12.6]] (top-down derivation) with the [[https://artint.info/code/ailog/ailog_code/ch12/west.ail|knowledge base about rooms]]         * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.4,12.5,12.6]] (top-down derivation) with the [[https://artint.info/code/ailog/ailog_code/ch12/west.ail|knowledge base about rooms]] 
        * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.8,12.9,12.14]] (SLD-resolution with functions) /*do also 12.15*/         * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.8,12.9,12.14]] (SLD-resolution with functions) /*do also 12.15*/ 
-       /* * ([[teaching:is:ind-solutions|solutions]]) */+       * ([[teaching:is:ind-solutions|solutions]] to all exercises
                
 =====Final Exam===== =====Final Exam=====
Line 140: Line 141:
 No "mock" exam paper is provided, given the quite simplifying specifications given above. No "mock" exam paper is provided, given the quite simplifying specifications given above.
  
 +**Modular Course**
  
 +This course, //Foundations of Artificial Intelligence//, is the module 1 within the //Artificial Intelligence// course, which includes also the module 2 //Machine Learning in Practice//.
 +
 +There is formally a unique final exam for the //Artificial Intelligence// course: the exam covers the topics addressed in //module 1// and //module 2// and consists of two parts, one for each module, and each one counting 50% of the final grade. In order pass the exam, the students should get at least 18/30 in each part. A student may take the two parts of the exam in different sessions; a positive evaluation of one part remains valid for all three regular exam 
 +sessions of the academic year.
teaching/is/main_is.1741630777.txt.gz · Last modified: 2025/03/10 19:19 by Franconi Enrico