Course: 2024/2025

Logic

(15970)

Requirements (Subjects that are assumed to be known)

There are no course dependencies

Learning outcomes:
R1. Knowledge and Understanding: knowledge and understanding of the mathematics and other basic sciences underlying Computer Science and Engineering, and specific knowledge of Computer Science, Computer Engineering, and Information Systems.
R3, Engineering Design: ability to develop and design complex products, processes, and systems to meet established requirements, that can include an awareness of non-technical ¿ societal, health and safety, environmental, economic and industrial¿ considerations; to select and apply relevant design methodologies.
R4. Investigations: ability to use the appropriate methods to pursue detailed investigations and research of technical issues in Computer Science and Engineering.
R5. Engineering Practice: Bachelor Degree graduates will be able to demonstrate understanding and knowledge to solve problems, carry out investigations, design devices or processes within the field of Computer Science and Engineering according to cost, quality, security, efficiency, respect for the environment and ethical considerations. These abilities include the knowledge, use and limitations of computer systems, process engineering, computer architectures, computational models, equipment, practical work, technical bibliography, and information sources.
Generic and transversal competences:
CGB3: Ability to understand the basics of logic and its application to solve engineering problems

Skills and learning outcomes

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

* Theory sessions: 1 ECTS. Sessions used to introduce the key concepts. Students will receive class notes and references to pursue independent work.
* Exercise sessions: 1 ECTS. Guided work sessions devoted mainly to solve Logic exercises related to the theoretical contents.
* Independent practical work: 2,5 ECTS. Independent work to be carried out either individually or in small groups focused on thematic sets of exercises provided by the professors.
* Continuous assessment tests: 1 ECTS. There are two midterms that evaluate progress during the term.
* Office hours: time outside of class scheduled by professors to meet with students either individually or in groups.
* Final exam: 0,5 ECTS. Global evaluation of the knowledge and skills developed over the term.

Assessment System

- % end-of-term-examination 40
- % of continuous assessment (assigments, laboratory, practicals...) 60

Extraordinary call: regulations

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 may change due academic events or other reasons.