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:
Master's degree in Computer Science and Engineering - 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. 2010/2011
| Modules | Credits | TAF | SSD |
|---|
Tre insegnamenti a scelta tra i seguenti | Modules | Credits | TAF | SSD |
|---|
| Modules | Credits | TAF | SSD |
|---|
Tre insegnamenti a scelta tra i seguenti | Modules | Credits | TAF | SSD |
|---|
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.
Algorithms - INTELLIGENZA ARTIFICIALE (2009/2010)
Teaching code
4S02709
Teacher
Credits
4
Also offered in courses:
- Artificial Intelligence of the course Masters in Intelligent and Multimedia Systems
Language
Italian
Scientific Disciplinary Sector (SSD)
ING-INF/05 - INFORMATION PROCESSING SYSTEMS
Period
1st Semester dal Oct 1, 2009 al Jan 31, 2010.
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; informed search procedures and heuristic search. Constraint problem solving. Knowledge representation: use of propositional logic and first-order logic; normal forms; equality. Algorithms for satisfiability (SAT). Theorem proving: resolution and rewriting.
| Author | Title | Publishing house | Year | ISBN | Notes |
|---|---|---|---|---|---|
| Stuart Russell, Peter Norvig | Artificial Intelligence: A Modern Approach (Edizione 2) | Prentice Hall | 2003 | 0137903952 | Testo adottato |
| Judea Pearl | Heuristics: Intelligent search strategies for computer problem solving (Edizione 1) | Addison Wesley | 1985 | 0-201-0559 | Testo complementare |
| Stuart Russell, Peter Norvig | Intelligenza artificiale: Un approccio moderno (Edizione 2) | Pearson Education Italia | 2005 | 88-7192-22 | Traduzione italiana del testo adottato |
| Chin-Liang Chang, Richard Char-Tung Lee | Symbolic Logic and Mechanical Theorem Proving (Edizione 1) | Academic Press | 1973 | 0121703509 | Testo complementare |
Examination Methods
The grade in Artificial Intelligence is worth 1/3 of the grade in the Algorithms exam, and it is determined by the grade in a written test.