Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
I semestre dal Oct 1, 2013 al Jan 31, 2014.
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.
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.
|Ricardo Caferra, Alexander Leitsch, Nicolas Peltier
||Automated Model Building
||Kluwer Academic Publishers
|Daniel Kroening, Ofer Strichman
||Decision Procedures. An algorithmic point of view
|Chin-Liang Chang, Richard Char-Tung Lee
||Symbolic Logic and Mechanical Theorem Proving
||The Resolution Calculus
||The Universal Computer. The Road from Leibniz to Turing. Turing Centenary Edition.
||Taylor and Francis Group
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.