Module Details
The information contained in this module specification was correct at the time of publication but may be subject to change, either during the session because of unforeseen circumstances, or following review of the module at the end of the session. Queries about the module should be directed to the member of staff with responsibility for the module.
Title LOGIC IN COMPUTER SCIENCE
Code COMP118
Coordinator Dr A Hernich
Computer Science
Andre.Hernich@liverpool.ac.uk
Year CATS Level Semester CATS Value
Session 2016-17 Level 4 FHEQ Second Semester 7.5

Aims
  1. To introduce the notation and concepts of formal logic.
  2. To describe and emphasise the role of formal logic in Computer Science and Information Systems.
  3. To promote the importance of formal notations as the necessary means of ensuring clarity, precision and absence of ambiguity.
  4. To provide a solid foundation for modules that make use of formal logic such as artificial intelligence, formal methods, knowledge representation, multi-agent systems, ontology languages, and advanced web technologies.

Learning Outcomes

To translate natural language descriptions and reasoning processes to and from logical equivalents in the propositional and predicate logic.

To evaluate first-order predicate logic formulae in relational stuctures and understand the relationship to relational databases.

To state state and apply a proof system (either tableaux or sequent) for propositional and predicate logic.


Syllabus
1  1. Introduction: the unusual effectiveness of logic in computer science (1 lecture)

2. Propositional logic (5 lectures):
(a) Reminder: syntax and semantics of propositional logic,
(b) SAT, logical consequence, logical equivalence, and normal forms,

(c) a proof system for propositional logic. 

3. Introduction to First-order Predicate Logic (11 lectures):

(a) syntax of first-order predicate logic,

(b) semantics of first-order predicate logic,

(c) evaluating first-order predicate logic and relational databases,

(d) a proof system for first-order predicate logic,

(e) undecidability of first-order predicate logic.

4. Outlook: the unusual effectiveness of logic in computer science (1 lecture)


Teaching and Learning Strategies

Lecture - Lecture

Tutorial - Tutorial

Teaching Schedule
  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 18
Lecture
  5
Tutorial
      23
Timetable (if known)              
Private Study 52
TOTAL HOURS 75

Assessment
EXAM Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Unseen Written Exam  90 mins  2  80  Yes  Standard UoL penalty applies  Written Exam Notes (applying to all assessments) - Class test 1 The resit exam will replace both exam and CA tasks. This work is marked anonymously. - Class test 2 The resit exam will replace both exam and CA tasks. This work is marked anonymously. - Written examination. - Practical assessment is employed for both formative assessment and summative assessment. Students will get short formative feedback on a weekly basis from the module demonstrators during tutorial / lab sessions. More detailed summative and formative feedback will be returned following assessment of the continuously assessed (CA) work. Resit exam will replace failed CA components, the Learning Outcomes will be covered in the resit exam.  
CONTINUOUS Duration Timing
(Semester)		 % of
final
mark		 Resit/resubmission
opportunity		 Penalty for late
submission		 Notes
Coursework  25 minutes  2  10  Yes  Standard UoL penalty applies  Class Test 1 
Coursework  25 minutes  2  10  Yes  Standard UoL penalty applies  Class Test 2 

Recommended Texts
Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.
Explanation of Reading List: