Checking date: 06/07/2020

Course: 2020/2021

Study: Bachelor in Computer Science and Engineering (218)

Coordinating teacher: QUINTANA MONTERO, DAVID

Department assigned to the subject: Department of Computer Science and Engineering

Type: Basic Core
ECTS Credits: 6.0 ECTS


Branch of knowledge: Engineering and Architecture

Competences and skills that will be acquired and learning results. Further information on this link
General skills: - Analysis (PO a) - Abstraction (PO a) - Modeling and problem solving (PO c) - To be able to apply basic deductive logic concepts (PO c) - Ability to understand the basics of logic and its application to solve engineering problems (CGB3) Specific skills: - Cognitive 1. To know first-order logic, derive logical proofs and deductions, understand the basics of its application to computing and being able to use automated deduction systems (PO a) - Procedural/Instrumental 2. Students will evaluate different resolution methods as well as their advantages and disadvantages (PO b) 3. Students will apply the right technique to every problem introduced (PO c) - Attitude 4. Students will work in teams (PO d) 5. Students will use computational logic tools (PO e) 6. Students will have a written final exam (PO g)
Description of contents: programme
1- Introduction to formal systems Calculus. Definition Consideration on calculi 2- Representation and syntax in propositional calculus Introduction to propositional calculus Syntax 3- Proof theory in propositional calculus. Kleene¿s algebra Introduction to Kleene¿s algebra Proof and deduction Proof with assumptions 4- Representation and syntax in predicate logic Introduction to predicate calculus Syntax 5- Proof theory in predicate calculus. Kleene¿s algebra Introduction to Kleene¿s algebra Proof and deduction 6- Semantic theory for propositional and predicate calculi Semantic theory for propositional calculus Semantic theory for predicate calculus (I) 7- Resolution method Prenex normal form Skolem normal form Resolution method 8- Computational logic and applications Horn clause and chaining methods Introduction to Prolog
Learning activities and methodology
The course will consist of lectures, where the theory will be introduced, and practical sessions. The aim of the lectures is providing the student with the theoretical background on Logic, its implications, and its usefulness in the context of Computer Science. (PO a) The practical sessions will consist of Computational Logic exercises related to the concepts presented in the lectures. They will cover modeling and representation aspects as well as practical use of deduction and proof methods. Additionally, there will be some sessions devoted to the introduction of logic programming (PROLOG) and automatic deduction. (PO a, c, d, f, g) The exercises will be published in aula global and will be solved in class. There will also be activities that will require students to work at home and submit the results in groups. (PO a, c, d, g, k) During the semester, there will be two assessments focused on the theoretical contents of the course.
Assessment System
  • % end-of-term-examination 40
  • % of continuous assessment (assigments, laboratory, practicals...) 60
Basic Bibliography
  • Cuena, J. Lógica Informática. Alianza Informática. 1996
Additional Bibliography
  • Alfredo Deaño. Lógica Computacional. Alianza. 1978
  • D. van Dalen. Logic and Structure. Springer. 2004
  • M. Huth and M. Ryan. Logic in Computer Science: Modelling and Reasoning about Systems. Cambridge University Press. 2004

The course syllabus and the academic weekly planning may change due academic events or other reasons.