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

 
Year CATS Level Semester CATS Value
Session 2019-20 Level 4 FHEQ Second Semester 7.5

Aims

To introduce the notation and concepts of formal logic. To describe and emphasise the role of formal logic in Computer Science and Information Systems. To promote the importance of formal notations as the necessary means of ensuring clarity, precision and absence of ambiguity. 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

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

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

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

(S1) Numeracy – general mathematical awareness and its application in practical contexts

(S2) Problem-solving – analysing facts and situations and applying creative thinking to develop appropriate solutions.


Syllabus

 

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

Teaching Method 1 - Lecture
Description: Lecture
Attendance Recorded: Yes

Teaching Method 2 - Tutorial
Description: Tutorial
Attendance Recorded: Not yet decided


Teaching Schedule

  Lectures Seminars Tutorials Lab Practicals Fieldwork Placement Other TOTAL
Study Hours 18

  5

      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
             
CONTINUOUS Duration Timing
(Semester)
% of
final
mark
Resit/resubmission
opportunity
Penalty for late
submission
Notes
             

Recommended Texts

Reading lists are managed at readinglists.liverpool.ac.uk. Click here to access the reading lists for this module.