Programming in Logic
Instance: 2019/2020 - 1S
Cycles of Study/Courses
Teaching Staff - Responsibilities
Teaching - Hours
Suitable for English-speaking students
- Provide students with fundamental concepts of logic programming
- Develop in students Prolog programming skills
- Explain the relationship between logic programming and mathematical logic
- Foster in students the motivation for logic programming
- Introduce students to applications of logic programming practices
- Involve students in practical projects lin ogic programming
- To relate Logic Programming with other disciplines of the course
Learning outcomes and competences
After completing the course, students should be able to:
- Identify what kinds of problems logic programming should or can be applied
- Understand the limitations of logical languages and their implementations
- Know how to develop relatively complex programs
- Know how to solve complex problems using logi programming
- Be very familiar with the syntax and semantics of the Prolog language
- To be able to make a connection between Logic Programming and other curricular units in the course
Pre-requirements (prior knowledge) and co-requirements (common knowledge)
Previous knowledge of mathematical logic and artificial intelligence may help, but these are not required.
Introduction to logic programming and Prolog language
- The expressive power of Prolog. Knowledge representation.
How logic programming works
- Unification, Substitution, Proof, SLD Resolution, Backtracking.
- Integer arithmetic with Prolog using terms. Lists in Prolog. Cut, negation as failure, cut-fail.
- Symbolic manipulation. Operators. Problem solving as search. Heuristics. Best first. Hill Climbing. DCG notation. Language processing. Minimax algorithm for adversarial games.
- Difference lists and incomplete structures. Second Order Predicates. Second Order Programming.
Sterling Leon; The art of prolog
. ISBN: 0-262-19250-0
Bratko Ivan 1946-; Prolog programming for artificial intelligence
. ISBN: 978-0-201-14224-2 pbk
Teaching methods and learning activities
- Theoretical classes with group discussions.
- Lab classes with theoretical and programming tasks, where students have the opportunity to discuss problems and solutions in group and with the lecturer.
- Group assignments to be done partly in lab classes and partly in student's own time.
Using Moodle for intermediate tests and lists of exercises.
Physical sciences > Computer science > Cybernetics > Artificial intelligence
Physical sciences > Computer science > Programming
Distributed evaluation with final exam
|Trabalho prático ou de projeto
Amount of time allocated to each course unit
|Frequência das aulas
Eligibility for exams
Grade above zero in the continuous evaluation component
Calculation formula of final grade
Final Grade = 0.6*EF + 0.4*AC
EF = Final Exam
AC = Continuous Evaluation, including assignments and tests.
It consists of theoretical and practical activity. Students must deliver implementation and an explanatory report. If time permits, they will make the presentation of their projects.
Special assessment (TE, DA, ...)
Assessment in the special season is made with a test in the classroom or in a computer lab.
Only the final exam can be subject to appeal in the seasons made available to each student.