Entry requirements

90 credits in information systems or equivalent

Learning outcomes

Regarding knowledge and understanding the student is, after the course, expected to be able to:

- Describe how declarative programming languages can be built-up and relate these to logic

- Explain and utilise the concepts in programming languages based on logic

- Describe how an interpreter for a logic-based language functions

- Describe different declarative problem solving methods

Regarding skills and abilities the student is, after the course, expected to be able to:

- Solve provided tasks in a logic programming language

- Apply different declarative problem solving methods to solve provided tasks

Regarding judgement and approach the student is, after the course, expected to be able to:

- Discuss and evaluate different declarative problem solving methods in relation to different types of assignments

- Relate declarative programming languages to other types of programming languages

Content

Introduction to declarative programming languages

Logic programming:

Definitions, programs, databases, rules, facts, recursion, recursive data structures, program structures, built-in predicates, negation through failure, set expressions, search spaces, efficient limitation of the search space, tail recursion, accumulator pairs

Problem solving methods:

Divide-and-conquer, generate-and-test, meta-programming

Instruction

Lectures, lessons, seminars and laboratory work.

Assessment

Examination, assignments and attendance to lectures. As grades on the course, one of the expressions passed with distinction, passed and failed is used.