6 ECTS credits
150 h study time

Offer 1 with catalog number 4014885FNR for all students in the 1st semester at a (F) Master - specialised level.

Semester
1st semester
Enrollment based on exam contract
Impossible
Grading method
Grading (scale from 0 to 20)
Can retake in second session
Yes
Taught in
English
Faculty
Faculty of Sciences and Bioengineering Sciences
Department
Computer Science
Educational team
Geraint Wiggins (course titular)
Activities and contact hours
26 contact hours Lecture
26 contact hours Seminar, Exercises or Practicals
Course Content

1) Theoretical background: syntax, semantics and proof theory of clausal logic
2) From logic programming to Prolog: SLD-resolution, steering the search process, negation as failure
3) Applications: knowledge representation, search algorithms, meta-programming
4) Evaluation variants: co-routining evaluation
5) Advanced reasoning techniques: definite clause grammars in natural language processing, constraint logic programming

 
Course material
Digital course material (Required) : All transparencies and their accompanying code are available on the website.
Digital course material (Required) : Simply Logical - Intelligent Reasoning by Example, Freely available at http://www.cs.bris.ac.uk/~flach/SimplyLogical.html, Peter Flach, http://www.cs.bris.ac.uk/~flach/SimplyLogical.html, 1994
Additional info

All transparencies and their accompanying code are available on the website.

Book:
Simply Logical - Intelligent Reasoning by Example
Peter Flach, Wiley, 1994
Freely available at http://www.cs.bris.ac.uk/~flach/SimplyLogical.html

Learning Outcomes

Algemene competenties

The goal of this course is three-fold:
- to offer students insight into the theoretical background that underlies the declarative programming paradigm
- to familiarize students with specific programming languages in this paradigm
- to acquaint students with applications in the domain of artificial intelligence and automated reasoning for which declarative programming is well-suited

The corresponding competences are:

Knowledge and Understanding:
Students have to be able to describe and motivate the underlying principles of declarative programming and logic programming in particular. Based on this theoretical background, students have to be capable of deriving the declarative as well as the procedural interpretation of a concrete logic program.

Application of Knowledge and Understanding:
Students have to be able to apply their newly gained knowledge to typical problems in artificial intelligence.
To this end, the students will develop modest logic programs during the exercise sessions.
Students also have to be able to design a more elaborate knowledge-based system and implement this using logic programming techniques. To this end, students will complete an individual programming project.

Making Judgements:
Students have to be capable of determining whether a given problem lends itself to an implementation that is based on logic programming.

Communication:
Students have to be able to motivate the decisions they make with respect to the aforementioned project, demonstrating that they can communicate clearly on the above topics.

Learning Skills:
Referencing the concepts taught in this course, students will be able to acquaint themselves independently with programming languages from the declarative paradigm and recognize opportunities for applying such languages in practice.

Grading

The final grade is composed based on the following categories:
Written Exam determines 50% of the final mark.
SELF Practical Assignment determines 50% of the final mark.

Within the Written Exam category, the following assignments need to be completed:

  • Closed Book Written Exam with a relative weight of 100 which comprises 50% of the final mark.

    Note: an oral test with written preparation about the entire course

Within the SELF Practical Assignment category, the following assignments need to be completed:

  • Autotutorial with a relative weight of 5 which comprises 5% of the final mark.

    Note: an oral defense of the aforementioned programming project
    The end result is calculated as the average of the results on both parts. If one of both results is 7 or less, however, the end result cannot exceed 7.
  • Formative project in Prolog with a relative weight of 15 which comprises 15% of the final mark.
  • Summative project in Prolog with a relative weight of 30 which comprises 30% of the final mark.

Additional info regarding evaluation

The exam consists of two parts:
- a written exam about the entire course (50%)
- three programming projects, 1 being an on-line quiz, and 2 solving a given problem in prolog (50%)
The end result is calculated as the average of the results on both parts.

 
Allowed unsatisfactory mark
The supplementary Teaching and Examination Regulations of your faculty stipulate whether an allowed unsatisfactory mark for this programme unit is permitted.

Academic context

This offer is part of the following study plans:
Master of Applied Sciences and Engineering: Computer Science: Artificial Intelligence
Master of Applied Sciences and Engineering: Computer Science: Multimedia
Master of Applied Sciences and Engineering: Computer Science: Software Languages and Software Engineering
Master of Applied Sciences and Engineering: Computer Science: Multimedia for Northwestern Polytechnical University (NPU)
Master of Applied Sciences and Engineering: Computer Science: Data Management and Analytics
Master of Applied Informatics: Profile Profile Big Data Technology
Master of Applied Informatics: Profile Profile Artificial Intelligence