Aulas Teóricas
Apontamentos
- [Aula I]: Intro. Why Prolog?
- [Aula II]: Search and pruning through the standard graph search;
- [Aula III]: Lists and their application through graph representation and topologicall sorting
- [Aula IV]: More than lists: using long terms and arithmetic
- [Aula V]: Back to lists, functional style programming with maplist and foldl.
- [Aula VI]: Meta-Programs, Prolog in Prolog, Depth-First Search
- [Aula VII]: Sorting and Trees, Randomization
- [Aula VIII]: The delay mechanism and search: NQueens
Slides
-
Aula01: Intro
- Aula02: Family Program
- Aula03: Execution
- Aula04: Arithmetics
- Aula05: Listas
- Aula07: Ugly Stuff
- Aula08: Symbolic Manipulation
- Aula09: Symbolic Manipulation II
- Aula10: Problem Solving
- Aula11: Problem Solving
- Aula12: Problem Solving
- Aula14: Difference Lists
- Aula15: Difference Structures
- Aula16: Second Order
- Aula17: Beyond Sets