|Monday||3:30 PM - 5:30 PM||lesson||Lecture Hall C|
|Thursday||4:30 PM - 6:30 PM||lesson||Lecture Hall G|
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 fields
such as analysis, verification, synthesis of systems, artificial intelligence, mathematics, robotics
Foundations of automated reasoning: theorem proving and model building. Inference systems. Instance-based inference systems (e.g., hyper-linking). Ordering-based inference systems (e.g., resolution and paramodulation/superposition). Subgoal-reduction based inference systems (e.g., model elimination). Search plans. Algorithmic reasoning in specific fields, such as: decision procedures for satisfiability (SAT) and satisfiability modulo theories (SMT); reasoning about constraints. Design and use of general-purpose or special-purpose reasoners.
|Ricardo Caferra, Alexander Leitsch, Nicolas Peltier||Automated Model Building (Edizione 1)||Kluwer Academic Publishers||2004||1-4020-265|
|Rolf Socher-Ambrosius, Patricia Johann||Deduction Systems (Edizione 1)||Springer Verlag||1997||0387948473|
|Raymond M. Smullyan||First-order logic||Dover Publications||1995||0486683702|
|Allan Ramsay||Formal Methods in Artificial Intelligence (Edizione 1)||Cambridge University Press||1989||0521424216|
|John Harrison||Handbook of Practical Logic and Automated Reasoning (Edizione 1)||Cambridge University Press||2009||9780521899574|
|Chin-Liang Chang, Richard Char-Tung Lee||Symbolic Logic and Mechanical Theorem Proving (Edizione 1)||Academic Press||1973||0121703509|
|Aaron R. Bradley, Zohar Manna||The Calculus of Computation - Decision Procedures with Applications to Verification (Edizione 1)||Springer||2007||9783540741|
|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|
Exams (First take): 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.
Exams (Later takes): The grade is given by 100% E, where E is a written exam, as hard as midterm, final, and project combined.
There is no difference between students who attend and students who do not attend.