| Lectures | MWF 9:35-10:25, Burnside Hall 1B23 Brigitte Pientka (bpientka@cs.mcgill.ca) |
|---|---|
| TA |
Xi (David) Li (Teaching Assistant) xli53@cs.mcgill.ca |
| Office Hours |
MWF 10:35-11:05, McC. Room 107N, Brigitte Pientka Tue 16:00-17:00, Trottier Room 3105, Xi Li (Teaching Assistant) Thu 16:00-17:00, Trottier Room 3105, Xi Li (Teaching Assistant) |
| Textbook |
Automated Theorem Proving Frank Pfenning. Course notes Copies will be available here for students. |
| Credit | 3 units |
| Grading | 30% Homework, 20% Midterm, 50% Final |
| Homework |
There will be 5 homeworks which include theoretical and
implementation exercises. You have 2 late days you can use throughout the semester Late homework will be accepted only under exceptional circumstances. |
| Midterm |
Fr, 28th Oct. Closed book, one sheet of notes permitted. |
| Final | To be announced |
| Academic integrity | McGill University values academic integrity. Therefore all students must understand the meaning and consequences of cheating, plagiarism and other academic offenses under the Code of Student Conduct and Disciplinary Procedures (see http://www.mcgill.ca/integrity for more information). Most importantly, work submitted for this course must represent your own efforts. Copying assignments or tests from any source, completely or partially, or allowing others to copy your work, will not be tolerated. |
| Topics |
Natural Deduction, Sequent Calculus, Proof terms, Type checking, Theorem proving, Unification, Redundancy elimination techniques, Functional and Logic Programming, Open problems and applications |
| Home | http://www.cs.mcgill.ca/~bpientka/courses/atp-05/ |