FranconiSpace

User Tools

Site Tools

You are here: FranconiSpace » Teaching » is » Foundations of Artificial Intelligence
Trace: • FranconiSpace
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/02/26 18:00]
Franconi Enrico [Official course presentation form] 		teaching:is:main_is [2025/04/30 10:27] (current)
Franconi Enrico [Lab]
Line 10: Line 10:
 ===== Timetable ===== ===== Timetable =====
  
-The official week-by-week Faculty timetable: [[https://www.unibz.it/en/timetable/?searchByKeywords=Artificial+Intelligence&sourceId=unibz&department=224&degree=13618%2C13778&studyPlan=18364%2C18928&toDate=2024-07-31&page=1|lectures and labs]] of the course.+The official week-by-week Faculty timetable: [[https://www.unibz.it/en/timetable/?searchByKeywords=Foundation+of+Artificial+Intelligence&sourceId=unibz&department=224&degree=13778%2C13995&studyPlan=18928%2C19687&fromDate=2025-03-04&toDate=2025-07-31|lectures and labs]] of the course.
 Note that a LAB slot may be transformed into a LECTURE slot and vice-versa, and this will be decided week by week; lectures and labs have equal importance. Note that a LAB slot may be transformed into a LECTURE slot and vice-versa, and this will be decided week by week; lectures and labs have equal importance.
  
Line 35: Line 35:
 /* The striked-through text (i.e., <del>text</del>) corresponds to parts not done this year. */ /* The striked-through text (i.e., <del>text</del>) corresponds to parts not done this year. */
  
-  * Slides: {{ :teaching:is:lect_01_0_h.pdf |Welcome Aboard}} +  * Slides: {{ :teaching:is:lect.1.0.pdf |Welcome Aboard}} 
-  * Slides: Artificial Intelligence and Agents {{ :teaching:is:lect_01_1.pdf |parts 1 & 2}}, {{ :teaching:is:lect_01_3_h.pdf |part 3}}, {{ :teaching:is:lect_01_4_h.pdf |part 4}} +  * 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: chapter 1 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: 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}}, {{:teaching:is:lect.4.2.pdf|part 2}}
     * Material: chapter 4 of //Poole and Mackworth//     * Material: chapter 4 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 128: Line 129:
        * [[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]]) */
 +       
 +=====Final Exam=====
 +
 +The exam paper will contain problem solving, verification, and transfer of knowledge questions, where you have to apply the techniques, the theory, and the basic principles of the technologies studied during the course to concrete examples. There will be no pure theory question.
 +
 +The exam is evaluated based on correctness of answers, clarity of answers, ability to summarise, evaluate, and establish relationships between topics, skills in critical thinking, quality of argumentation, problem solving ability.
 +
 +The questions will be mirroring the exercises done in the lab and the exercises from the main course book.
 +Answers to questions should be formulated precisely and completely, of course. Regarding the topic that have been done during the lab using simulation software, the written answer in the exam paper should contain the information relevant to the question as it would be provided by the simulation, and as it is discussed in the book and during the lectures and labs. You can bring your own written notes to the exam, and nothing else.
 +
 +No "mock" exam paper is provided, given the quite simplifying specifications given above.
 +
 +
teaching/is/main_is.1740589229.txt.gz · Last modified: 2025/02/26 18:00 by Franconi Enrico

Page Tools

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki