Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea magistrale in Ingegneria e scienze informatiche - Enrollment from 2025/2026The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
Modules | Credits | TAF | SSD |
---|
2° Year activated in the A.Y. 2017/2018
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
2 courses to be chosen among the following
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Foundations of Computing - INTELLIGENZA ARTIFICIALE (2016/2017)
Teaching code
4S02789
Teacher
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
II sem. dal Mar 1, 2017 al Jun 9, 2017.
Learning outcomes
The class presents the main techniques for problem solving, based on the central paradigm of symbolic representation. The objective is to provide the students with the ability to design, apply and evaluate algorithms for difficult problems, meaning that their mechanical solution captures aspects of artificial intelligence or computational rationality.
Program
Problem solving as search in a state space; un-informed search procedures; heuristic search procedures; adversarial search. Problem solving based on constraint processing (satisfaction and optimization). Logic-based knowledge representation: normal forms; equality. Theorem proving: satisfiability (SAT), resolution, rewriting. Intelligent agents: planning, multi-agent systems, coordination. Probabilistic reasoning, decision theory.
Author | Title | Publishing house | Year | ISBN | Notes |
---|---|---|---|---|---|
Stuart Russell, Peter Norvig | Artificial Intelligence: A Modern Approach (Edizione 2) | Prentice Hall | 2003 | 0137903952 |
Examination Methods
The final grade for the IA module can be achieved with a single test or with partial tests. The single written test will be done at the exam date. The partial tests includes two written tests (one during the course and one at the end of the course) or a written test (done during the course) and a project (usually with a consistent programming part).