COMP60121: Automated Reasoning (2008-2009)
- 22 Jan 2009:
Appendix with definitions to exam paper
- 15 Jan 2009:
Renate will be available for questions and feedback on the
coursework of her part on Friday, 23 January, 11:00-12:00, Rm 2.15.
- 4 Nov 2008:
There is a mistake in Question 5 of the Week 5 coursework sheet for
COMP60121. Please replace condition (ii) of the splitting rule by the
(ii) C and D denote non-empty clauses which do have any
first-order variables in common, and neither contains only
propositional symbols introduced by previous applications of the
Otherwise, nothing needs to change. (Thanks to Nikesh for
- 28 Oct 2008:
Submission deadline of Week 5, Part II, coursework extended to 7 November, 4pm.
- 12 October 2008:
Lectures of Part II on "Advanced Topics" start at 2pm on Monday, 13
Follow this link for the course unit description, giving details about
the aims and learning outcomes of the course, reading material,
assessment, and the syllabus.
Locations and times
Refer to the ACS Timetable
- Times: 9:00-17:00 on Mondays, 29 September - 7 November.
- Venues: Lectures and exercise classes will be in Room 2.15, unless otherwise stated.
The labs will be in the MSc lab (2.25a & 2.25b).
For Part I:
For Part II:
- Week 1: Exercise to recapitulate the basics of sets and relations,
submission deadline 6 Oct 2008, 9am.
- Week 3, Part II: see handout,
submission deadline 20 Oct 2008, 9am.
- Week 4, Part II: see handout,
submission deadline 27 Oct 2008, 9am.
- Week 5, Part II: see handout,
submission deadline extended to 7 November, 4pm.
Handing in your work
Please hand in your written coursework as a hard copy to the Student Support Office, Room LF21.
Familiarity with propositional logic (also known as
classical logic or Boolean logic).
Knowledge of first-order logic and some logic programming experience
would be some advantage, but is not essential.
To refresh your knowledge on propositional logic, and also first-order
logic, we recommend
- Kelly, J. The Essence of Logic. Pearson.
- Almost any introductory level textbook on Automated Reasoning, Artificial
Intelligence, KR&R, Logic, foundations of CS.
To refresh your knowledge on sets, relations and function we recommend
- Chapter 5.2 in
Cormen, T. H. and Leiserson, C. E. and Rivest, R. L. (1992),
Introduction to Algorithms.
The MIT Electrical Engineering and Computer Science Series,
- Chapter 1.1 and 1.3 of
"Interactive Real Analysis".
This website includes interactive exercises with answers.
- Any book on the mathematical foundations of CS or discrete mathematics.
The course does not follow a specific book: copies
of the slides are made available.
Recommended reading material is listed in the
course unit description in the ACS Syllabus.
Further references may be given during
There is no need to buy a book.
All books are available in the Resources Centre Library or the main
60% coursework, 40% exam
Renate A. Schmidt
FM Group |
School Computer Science |
Last modified: 22 Jan 09
Copyright © 2008-09
Renate A. Schmidt,
School of Computer Science, Man Univ, email@example.com