Computational Logic

Code:

CC2003

Acronym:

CC2003

Level:

200

Keywords
Classification	Keyword
OFICIAL	Computer Science

Instance: 2024/2025 - 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	48	162
L:CC	94	study plan from 2021/22	2	-	6	48	162
L:F	2	Official Study Plan	2	-	6	48	162
			3
L:G	1	study plan from 2017/18	2	-	6	48	162
			3
L:IACD	85	study plan from 2021/22	2	-	6	48	162
L:M	19	Official Study Plan	2	-	6	48	162
			3
L:MA	0	Official Study Plan	3	-	6	48	162
L:Q	2	study plan from 2016/17	3	-	6	48	162

Teaching language

Suitable for English-speaking students

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

Proposicional logic: syntax and semantics; satisfazibility, validity. normal forms; SAT solvers; deduction systems; soundness and completeness of deduction systems; decidability. Fist-order logic: syntax and semantics;models; validity; normal forms; deduction systems; soundness and completeness; decidable fragments; first-order theories.

Automated theorem proving: Horn clauses; unification; resolution.

Mandatory literature

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

Complementary Bibliography

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

Teaching methods and learning activities

The teaching methods are based on expository lecturing and exercises complemented with programming coursework that enables the student practice the methods studied in the course.

Evaluation Type

Distributed evaluation without final exam

Assessment Components

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

Amount of time allocated to each course unit

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

Eligibility for exams

Students are required a minumum of 6 (out of 20) in each test. All the studens can take the resit exam.

Calculation formula of final grade

The final grade (FT - firts test, ST - second test)
F = FT*(0.5) + ST*(0.5)
FT,ST >= 6 e F >= 9.5

Classification improvement

The grade improvement exam is graded out of 20 points.

Observations

It is desirable, but not mandatory, that students have already passed the Discrete Structures course.