User Tools

Site Tools


teaching:is:main_is_old

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_old [2021/03/17 09:52]
Franconi Enrico [Lab]
teaching:is:main_is_old [2022/02/28 15:45] (current)
Franconi Enrico ↷ Page name changed from teaching:is:main_is to teaching:is:main_is_old
Line 1: Line 1:
-====== Artificial Intelligence (AI) ======+====== Artificial Intelligence (AI) - old course, valid until 2020/2021 ======
  
 ===== Watch the page ===== ===== Watch the page =====
Line 33: Line 33:
  
   * **Main book**: David Poole and Alan Mackworth. //Artificial Intelligence: Foundations of Computational Agents//. Cambridge University Press, 2010, 2nd edition 2017.   * **Main book**: David Poole and Alan Mackworth. //Artificial Intelligence: Foundations of Computational Agents//. Cambridge University Press, 2010, 2nd edition 2017.
-  * //Auxiliary book//: Stuart Jonathan Russell and Peter Norvig. //Artificial Intelligence: A Modern Approach//. Prentice Hall, 3rd edition 2016.+  * //Auxiliary book//: Stuart Jonathan Russell and Peter Norvig. //Artificial Intelligence: A Modern Approach//. Prentice Hall, 4th edition 2020.
   * Reading list from the UniBZ Library: [[https://eu.alma.exlibrisgroup.com/leganto/public/39UBZ_INST/lists/27091437790001241?auth=CAS|76212_19-20-2_CS Artificial Intelligence]]   * Reading list from the UniBZ Library: [[https://eu.alma.exlibrisgroup.com/leganto/public/39UBZ_INST/lists/27091437790001241?auth=CAS|76212_19-20-2_CS Artificial Intelligence]]
  
Line 54: Line 54:
   * Slides: Features and Constraints {{:teaching:is:lect.4.1.pdf|part 1}}, <del>{{:teaching:is:lect.4.2.pdf|part 2}}</del>,    * Slides: Features and Constraints {{:teaching:is:lect.4.1.pdf|part 1}}, <del>{{:teaching:is:lect.4.2.pdf|part 2}}</del>, 
     * Material {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_72.html|chapter 4}} of //Poole and Mackworth//     * Material {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_72.html|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}}</del>, <del>{{: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}} \\ <del>Slides: Diagnosis {{:teaching:is:lect.5.5.pdf|part 1}}, {{:teaching:is:lect.5.6.pdf|part 2}}, {{:teaching:is:lect.5.7.pdf|part 3}}, {{:teaching:is:lect.5.8.pdf|part 4}}</del>, <del>{{:teaching:is:lect.5.9.pdf|part 5}}</del>
     * Material {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_100.html|chapter 5}} of //Poole and Mackworth//     * Material {{http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_100.html|chapter 5}} of //Poole and Mackworth//
   * <del>Slides: Supervised learning and Decision Trees: {{ :teaching:is:lect1.pdf |part 1}}, {{ :teaching:is:lect2_ef.pdf |part 2}}, {{ :teaching:is:lect3_ef.pdf |part 3}}</del>.   * <del>Slides: Supervised learning and Decision Trees: {{ :teaching:is:lect1.pdf |part 1}}, {{ :teaching:is:lect2_ef.pdf |part 2}}, {{ :teaching:is:lect3_ef.pdf |part 3}}</del>.
Line 73: Line 73:
     * {{ :teaching:is:robot_4_-_tutorial_2.pdf |Tutorial 2}} with [[http://aispace.org/robot/help/RunRobotTutorial.avi|video]]     * {{ :teaching:is:robot_4_-_tutorial_2.pdf |Tutorial 2}} with [[http://aispace.org/robot/help/RunRobotTutorial.avi|video]]
     * {{ :teaching:is:robot_5_-_tutorial_3.pdf |Tutorial 3}} with [[http://aispace.org/robot/help/DebugTutorial.avi|video]]     * {{ :teaching:is:robot_5_-_tutorial_3.pdf |Tutorial 3}} with [[http://aispace.org/robot/help/DebugTutorial.avi|video]]
-  * <color #22b14c>LAB 2</color>: Graph Searching with uninformed techniques ({{ :teaching:is:search.jar.zip |applet}})+  * <color #22b14c>LAB 2</color>: Graph Searching with uninformed techniques ({{ :teaching:is:search_applet.zip |applet}})
     * Manuals:     * Manuals:
       * {{ :teaching:is:search_1_-_quick_start.pdf |Quick start}}       * {{ :teaching:is:search_1_-_quick_start.pdf |Quick start}}
Line 82: Line 82:
       * Tutorial 4: {{ :teaching:is:search_6_-_tutorial_4.pdf |Search Options}}       * Tutorial 4: {{ :teaching:is:search_6_-_tutorial_4.pdf |Search Options}}
     * 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.
-    * Exercise: practicing different search strategies with the graph in this {{teaching:is:search_bf_df_lcf.pdf|slides}} 
     * 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)
     * 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.
Line 89: Line 89:
     * 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]] (solved during the lab).+    * Exercise: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_71.html|3.4]] ([[teaching:is:heuristics-solution|solution]]).
   * <color #22b14c>LAB 4</color>: Constraints - Consistency   * <color #22b14c>LAB 4</color>: Constraints - Consistency
     * [[http://aispace.org/constraint/|Consistency Based CSP Solver]] ({{:teaching:is:constraint.jar.zip|applet}}):     * [[http://aispace.org/constraint/|Consistency Based CSP Solver]] ({{:teaching:is:constraint.jar.zip|applet}}):
     * 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, 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 104: Line 104:
           * 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 [[https://artint.info/2e/html/ArtInt2e.Ch5.S11.html|5.1, 5.2, 5.3, 5.4]] /*([[teaching:is:prop-rules-solutions|solutions]])*/+    * Do Exercises [[https://artint.info/2e/html/ArtInt2e.Ch5.S11.html|5.1, 5.2 (not question b), 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]]     * Find other AILog knowledge base examples [[https://www.cs.ubc.ca/~poole/aibook/code/ailog/ailog_code/ailog_code.html|here]]
-  * <color #22b14c>LAB 6</color>: Debug, Diagnosis, Abduction+<del>  * <color #22b14c>LAB 6</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 116: Line 116:
        * [[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, 5.9, 5.13]] /*([[teaching:is:diag-rules-solutions|solutions]])*/ </del>
   * <color #22b14c>LAB 7</color>: Individuals and Relations   * <color #22b14c>LAB 7</color>: Individuals and Relations
     * Keep using [[https://artint.info/code/ailog/ailog_man.html|AILog2]]     * Keep using [[https://artint.info/code/ailog/ailog_man.html|AILog2]]
     * Go through Section 8 of the [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man.html|manual]]     * Go through Section 8 of the [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_man.html|manual]]
 +    * Play with the relational representation of the [[https://artint.info/code/ailog/ailog_code/ch12/elect_relational.ail|electrical environment]] and with the [[https://artint.info/code/ailog/ailog_code/ch12/before.ail|AM and PM time representations]]
     * Do the following  exercises (you may use the AILog2 KBs listed in the [[https://artint.info/online.html|resources for Chapter 12]]):      * Do the following  exercises (you may use the AILog2 KBs listed in the [[https://artint.info/online.html|resources for Chapter 12]]): 
 /*       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.1,12.2]] (model theory) */ /*       * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.1,12.2]] (model theory) */
Line 125: Line 126:
        * [[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]])
  
-  * <color #22b14c>optional LAB</color>: Natural Language Processing +  * <color #22b14c>LAB 8</color>: Natural Language Processing 
-    * Exercises[[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.17]] - Natural Language Processing +    * Understand and play with the knowledge bases discussed in the lecture
-    * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/cfg_simple.ail|cfg_simple.ail]] a simple context free grammar and associated dictionary from Figures 12.6 and 12.7 in Section 12.5 (also in [[http://artint.info/code/Prolog/ch12/cfg_simple.pl|Prolog]]) +      * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/cfg_simple.ail|cfg_simple.ail]] a simple context free grammar and associated dictionary from Figures 12.6 and 12.7 in Section 12.5 (also in [[http://artint.info/code/Prolog/ch12/cfg_simple.pl|Prolog]]) /* 
-    * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/trans.ail|trans.ail]] generates canned English; from Figure 12.8 in Section 12.6.4 (also in [[http://artint.info/code/Prolog/ch12/trans.pl|Prolog]]) +      * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/trans.ail|trans.ail]] generates canned English; from Figure 12.8 in Section 12.6.4 (also in [[http://artint.info/code/Prolog/ch12/trans.pl|Prolog]]) */ 
-    * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/nl_numbera.ail|nl_numbera.ail]] a simple grammar that enforces number agreement and builds a parse tree; from Figure 12.9 in Section 12.6.5 (also in [[http://artint.info/code/Prolog/ch12/nl_numbera.pl|Prolog]]) +      * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/nl_numbera.ail|nl_numbera.ail]] a simple grammar that enforces number agreement and builds a parse tree; from Figure 12.9 in Section 12.6.5 (also in [[http://artint.info/code/Prolog/ch12/nl_numbera.pl|Prolog]]) 
-    * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/nl_interface.ail|nl_interface.ail]] a simple natural language interface to a database; from Figures 12.10 and 12.11 in Section 12.6.6 (also in [[http://artint.info/code/Prolog/ch12/nl_interface.pl|Prolog]])+      * [[http://www.inf.unibz.it/~franconi/teaching/artint.info/code/ailog/ailog_code/ch12/nl_interface.ail|nl_interface.ail]] a simple natural language interface to a database; from Figures 12.10 and 12.11 in Section 12.6.6 (also in [[http://artint.info/code/Prolog/ch12/nl_interface.pl|Prolog]]) 
 +    * Exercise: [[http://www.inf.unibz.it/~franconi/teaching/artint.info/html/ArtInt_308.html|12.17]] ([[teaching:is:nl-geo-solution|solution]]) - Following the code of the simple natural language interface to a database, construct a knowledge base with a grammar (where a relative clause could be treated similarly to a prepositional phrase) and a dictionary to find **__all__** the answers to the following geographical questions: 
 +      * Which is a country? 
 +      * Which is a Spanish speaking country? 
 +      * Which is the capital of Chile? 
 +      * Which is the capital of a large country? 
 +      * Which is a country that borders Chile? 
 +      * Which is a country that borders a country that borders Chile? 
 +      * Which is the capital of a country that borders Chile? 
 +      * Which country borders Chile? 
 +      * Which country that borders Chile borders Paraguay? 
 +    * using the following facts: 
 +<code> 
 +% country(C) is true if C is a country 
 +country(argentina). 
 +country(brazil). 
 +country(chile). 
 +country(paraguay). 
 +country(peru).
  
-Additional optional lab material:+% large(C) is true if the area of C is greater than 2m km^2 
 +large(brazil). 
 +large(argentina). 
 + 
 +% language(L) is true if L is a language 
 +language(spanish). 
 +langauge(portugese). 
 + 
 +% speaks(Country,Lang) is true of Lang is an official language of Country 
 +speaks(argentina,spanish). 
 +speaks(brazil,portugese). 
 +speaks(chile,spanish). 
 +speaks(paraguay,spanish). 
 +speaks(peru,spanish). 
 + 
 +capital(argentina,'Buenos Aires'). 
 +capital(chile,'Santiago'). 
 +capital(peru,'Lima'). 
 +capital(brazil,'Brasilia'). 
 +capital(paraguay,'Asunción'). 
 + 
 +% borders(C1,C2) is true if country C1 borders country C2 
 +borders(peru,chile). 
 +borders(chile,peru). 
 +borders(argentina,chile). 
 +borders(chile,argentina). 
 +borders(brazil,peru). 
 +borders(peru,brazil). 
 +borders(argentina,brazil). 
 +borders(brazil,argentina). 
 +borders(brazil,paraguay). 
 +borders(paraguay,brazil). 
 +borders(argentina,paraguay). 
 +borders(paraguay,argentina). 
 +</code> 
 + 
 + 
 +===Additional optional lab material===
  
   * LAB: Decision Trees   * LAB: Decision Trees
Line 175: Line 231:
   * Requirements: (1) a computer with a webcam and a microphone, (2) a smartphone with camera and internet connection, (3) sheets of paper to write the answers to the questions.   * Requirements: (1) a computer with a webcam and a microphone, (2) a smartphone with camera and internet connection, (3) sheets of paper to write the answers to the questions.
  
-  * Platform to communicate with the professor during the written exam (login with your UniBZ account): MS Teams at [[https://teams.microsoft.com/l/meetup-join/19%3ae275c0478a0c44139a1871b3cff3e77b%40thread.tacv2/1610963250892?context=%7b%22Tid%22%3a%2292513267-03e3-401a-80d4-c58ed6674e3b%22%2c%22Oid%22%3a%2275931671-91a8-4632-a7b6-8dfb24a1fb99%22%7d|this MS Teams link]] (the link will be updated on the day of the exam). Keep your video camera off in MS Teams (otherwise it wouldn't work in OWLTS). Connect to MS Teams five minutes before the start of the exam, and keep the connection open during the whole duration of the exam. \\ In case of technical problems, you can ask for help via chat using MS Teams with the faculty secretariat ([[https://teams.microsoft.com/l/chat/0/0?users=Christine.Kirchler@unibz.it|MS Teams link for Christine Kirchler]] or [[https://teams.microsoft.com/l/chat/0/0?users=Federica.Cumer@unibz.it|MS Teams link for Federica Cumer]]) or with the ICT technicians ([[https://teams.microsoft.com/l/chat/0/0?users=CCumer@unibz.it|MS Teams link for Cristiano Cumer]]).+  * Platform to communicate with the professor during the written exam (login with your UniBZ account): MS Teams at [[https://teams.microsoft.com/l/meetup-join/19%3ae275c0478a0c44139a1871b3cff3e77b%40thread.tacv2/1610963250892?context=%7b%22Tid%22%3a%2292513267-03e3-401a-80d4-c58ed6674e3b%22%2c%22Oid%22%3a%2275931671-91a8-4632-a7b6-8dfb24a1fb99%22%7d|this MS Teams link]] (the link will be updated on the day of the exam). Keep your video camera off in MS Teams (otherwise it wouldn't work in OWLTS). Connect to MS Teams five minutes before the start of the exam, and keep the connection open during the whole duration of the exam. \\ In case of technical problems, you can ask for help via chat using MS Teams with the faculty secretariat ([[https://teams.microsoft.com/l/chat/0/0?users=Christine.Kirchler@unibz.it|MS Teams link for Christine Kirchler]] or [[https://teams.microsoft.com/l/chat/0/0?users=Federica.Cumer@unibz.it|MS Teams link for Federica Cumer]]) or with the ICT technicians ([[https://teams.microsoft.com/l/chat/0/0?users=Denise.Delai@unibz.it|MS Teams link for Denise Delai]], [[https://teams.microsoft.com/l/chat/0/0?users=CCumer@unibz.it|MS Teams link for Cristiano Cumer]]).
  
   * Platform for the written exam (login with your UniBZ account): OWLTS at https://unibz.owlts.com .   * Platform for the written exam (login with your UniBZ account): OWLTS at https://unibz.owlts.com .
teaching/is/main_is_old.1615971153.txt.gz · Last modified: 2021/03/17 09:52 by Franconi Enrico