Computational Logic

Code:

CC2003

Acronym:

CC2003

Level:

200

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2022/2023 - 1S

Active?	Yes
Responsible unit:	Department of Computer Science
Course/CS Responsible:	Bachelor in Computer Science

Cycles of Study/Courses

Acronym	No. of Students	Study Plan	Curricular Years	Credits UCN	Credits ECTS	Contact hours	Total Time
L:B	0	Official Study Plan	3	-	6	56	162
L:CC	86	study plan from 2021/22	2	-	6	56	162
L:F	0	Official Study Plan	2	-	6	56	162
			3
L:G	1	study plan from 2017/18	2	-	6	56	162
			3
L:IACD	62	study plan from 2021/22	2	-	6	56	162
L:M	7	Official Study Plan	2	-	6	56	162
			3
L:MA	0	Official Study Plan	3	-	6	56	162
L:Q	0	study plan from 2016/17	3	-	6	56	162

Teaching language

Portuguese

Objectives

It is intended that the student learns the fundamental concepts regarding reasoning and is able to correctly use the deductive systems; understands the relationship between semantics and deductive systems and their characterization from the point of view of decidability; recognizes the role of formal systems in the various areas of Computer Science, in particular in the area of logic programming.

Learning outcomes and competences

To know the main topics of propositional logic and first order logic, and its application to logic programming.

Working method

Presencial

Pre-requirements (prior knowledge) and co-requirements (common knowledge)

Discrete Structures

Program

Propositional logic: syntax and semantics; satisfiability, validity, logical consequence. Normal forms. Algorithms for checking satisfiability.
Deductive systems. Soundness and completeness; decidability.

Fist-order logic: First order language. Syntax.
Semantics: structures, interpretations, models.
Deductive systems: Soundness and completeness. 

Logic Programming: Horn clauses, unification and resolution.

Mandatory literature

Huth Michael 1962-; Logic in Computer Science. ISBN: 0-521-54310-X

Complementary Bibliography

Barwise Jon; Language, proof, and logic. ISBN: 1-57586-374-X
C.J. Hogger; Essentials of logic programming. ISBN: 0-19-853832-4
Almeida José Bacelar 070; Rigorous software development. ISBN: 9780857290175

Teaching methods and learning activities

Expository lectures and practical classes where students practice the concepts studied in the course by means of solving practical exercises.

Evaluation Type

Evaluation with final exam

Assessment Components

designation	Weight (%)
Exame	100,00
Total:	100,00

Amount of time allocated to each course unit

designation	Time (hours)
Estudo autónomo	106,00
Frequência das aulas	56,00
Total:	162,00

Eligibility for exams

- In the middle of the semester there is a non-mandatory test, quoted with 20 points.
- The regular exam consists of two parts. 
-Students must obtain a minimum of 6 values (out of 20) in each of the parts.
- Students with a score of six or more values in the test may choose not to take the first part of the exam and take
the grade obtained in the test for the calculation of the final grade (arithmetic mean).



All the studens can take the resit exam.

Calculation formula of final grade

The final grade F is given by the formula
F = FP*(0.5) + SP*(0.5)

(FP - first part, SP - second part)
FP,SP >= 6 e F >= 9.5

Classification improvement

Students can take the resit exam to raise their grade.

Observations

All students are rated in the same way.