COMP0009 Logic and Database Theory
This database contains the 2018-19 versions of syllabuses.
Note: Whilst every effort is made to keep the syllabus and assessment records correct, the precise details must be checked with the lecturer(s).
Logic and Database Theory
The module aims to introduce and familiarise students with logical and mathematical inference and with database theory, the latter having an emphasis on the fundamentals of relational database systems and SQL. Students learn a number of logical inference methods for classical logics.
On successful completion of the module, a student will be able to:
- understand how axiomatic systems can be used for propositional and predicate logic;
- understand the notions of soundness and completeness;
- understand how propositional and predicate tableaus work;
- have familiarity with other logics, including modal and temporal logics;
- be able to analyse relational databases.
Availability and prerequisites
This module delivery is available for selection on the below-listed programmes. The relevant programme structure will specify whether the module is core, optional, or elective.
In order to be eligible to select this module as optional or elective, where available, students must meet all prerequisite conditions to the satisfaction of the module leader. Places for students taking the module as optional or elective are limited and will be allocated according to the department’s module selection policy.
Programmes on which available:
In order to be eligible to select this module, students must have:
Propositional and Predicate logic
- Review of syntax and semantics.
- Deduction and Inference.
- Truth tables.
- Decidability of propositional logic.
- Proof by contradiction.
- Induction and structured induction.
- Hilbert systems.
- Axioms and inference rules for propositional logic.
- Axioms and inference rules for predicate logic.
- Tableau construction for propositional logic and predicate logic.
- Soundness and completeness theorems for first order logic.
- Semi-decidability of first order logic.
Finite computation methods
- Finite state machines.
- Regular languages.
- Kleene's theorem.
- Finite state machines with stacks.
- Database management systems (DBMS) and the relational database: essential concepts; data model; and architecture and primary functions of the DBMS.
- SQL: use of SQL as a language for database construction and data manipulation.
- Database design: a structured method for designing relational databases through: data modelling, schema specification, validation, and normalisation.
An indicative reading list is available via http://readinglists.ucl.ac.uk/departments/comps_eng.html.
The module is delivered through a combination of lectures, problem classes and programming exercises.
This module delivery is assessed as below:
Written examination (2hrs 30 mins)
In order to pass this Module Delivery, students must:
- achieve an overall weighted Module mark of at least 40.00%;
AND, when taken as part of BSc Computer Science; MEng Computer Science, and MEng Mathematical Computation:
- achieve a mark of at least 30.00% in any Components of assessment weighed ≥ 30% of the module.
Where a Component comprises multiple Assessment Tasks, the minimum mark applies to the overall component.