Are you a student that has questions regarding this course?
If you are registered for a current course round, ask your question in Canvas. You find your course round in Canvas from the Personal Menu, in a link below the course information. Example: HT17-1
In the News feed, you find updates for pages, schedule and posts from teachers (when aimed also at earlier registered students).
Teacher Alf Thomas Sjöland edited 11 October 2017
Summary of lecture week 7
Meta programming. The primitives var, nonvar, ground.¶ The primitives findall, bagof and setof.
Self interpreters. The Vanilla prolog interpreter.
Expert systems in Prolog.
Teacher Alf Thomas Sjöland edited 2 October 2017
Summary of lecture week 5
Negation with the NAF-rule (negation as failure).
W defined the !-primitive and introduced "if-then-else"-syntax.
Search in graphs, and problem formulation med generate-and-test.
permute to generate all possible permutations of a list.
Some examples: N-queens, missionaries and cannibals,
Finding a path in a graph. Avoiding loops in graph search.
Different search methods for parallellism in Prolog was skipped.
All questions on the material are welcome! Use e-mail or this News feed.
Teacher Alf Thomas Sjöland edited 29 September 2017
Summary of the lecture week 4
Algorithms over trees and lists. A dictionary implementerad with a sorted open-ende binary tree.
Reverse, append, merge to keep lists sorte n Defining flatten on nested lists. The accumulating parameter technique. append3. Considering the complexity. Using ap oend3 to divide a list in three parts.
Difference lists. Implementing append for difference lists. Complexity. Consider similarities between using difflists and the accumulating parameter technique.
Generalising an algorithm by defining separate clauses for representations and equality.
"abstract data types"