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.

The 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.

CURRICULUM TIPO:

1° Year 

ModulesCreditsTAFSSD
12
B
ING-INF/05
6
B
ING-INF/05
6
B
ING-INF/05
12
B
ING-INF/05

2° Year   activated in the A.Y. 2014/2015

ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative
4
F
-
ModulesCreditsTAFSSD
12
B
ING-INF/05
6
B
ING-INF/05
6
B
ING-INF/05
12
B
ING-INF/05
activated in the A.Y. 2014/2015
ModulesCreditsTAFSSD
6
B
INF/01
Altre attivita' formative
4
F
-
Modules Credits TAF SSD
Between the years: 1°- 2°

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.




S Placements in companies, public or private institutions and professional associations

Teaching code

4S02796

Credits

6

Language

Italian

Scientific Disciplinary Sector (SSD)

INF/01 - INFORMATICS

Period

I semestre dal Oct 1, 2013 al Jan 31, 2014.

Location

VERONA

Learning outcomes

The class presents problems, methods and systems in automated reasoning. The treatment combines theoretical foundations with algorithmic and practical issues, emphasizing mechanization throughout. The student learns how to design, apply, and evaluate methods and systems for automated reasoning, with attention to applications in analysis, verification, and synthesis of systems, and artificial intelligence.

Program

Foundations of automated reasoning: theorem proving and model building. Inference systems, such as: instance-based (e.g., hyper-linking), ordering-based (e.g., completion), and subgoal-reduction based (e.g., model elimination). Search plans. Algorithmic reasoning in specific fields, such as: decision procedures for satisfiability modulo theories (SMT); constraint-based reasoning. Design and use of general-purpose or special-purpose reasoners.

Reference texts
Author Title Publishing house Year ISBN Notes
Ricardo Caferra, Alexander Leitsch, Nicolas Peltier Automated Model Building (Edizione 1) Kluwer Academic Publishers 2004 1-4020-265
Daniel Kroening, Ofer Strichman Decision Procedures. An algorithmic point of view Springer 2008 978-3-540-74104-6
Chin-Liang Chang, Richard Char-Tung Lee Symbolic Logic and Mechanical Theorem Proving (Edizione 1) Academic Press 1973 0121703509
Alexander Leitsch The Resolution Calculus (Edizione 1) Springer 1997 3540618821
Martin Davis The Universal Computer. The Road from Leibniz to Turing. Turing Centenary Edition. Taylor and Francis Group 2012 978-1-4665-0519-3

Examination Methods

The grade is given by 30% C1 + 30% C2 + 40% P, where C1 is the midterm exam, C2 is the final exam and P is a project. The grade thus generated is registered at the first exam session in February.
Alternatively, the grade is given by 100% E, where E is a written test, hard enough to match the difficulty of C1 + C2 + P.
Registration: all grades will be registered.
Withdrawal: Students may withdraw by informing the instructor.
Cheating: All tests and projects are individual work. Cheating is strictly forbidden and will determine lowering of grades.

Students with disabilities or specific learning disorders (SLD), who intend to request the adaptation of the exam, must follow the instructions given HERE