Summary of lecture week 5

Negation with the NAF-rule (negation as failure).

We defined the !-primitive (cut) 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.