89-948 |
AI Programming Techniques |
Harold Boley |
| 2 Std. Vorlesung | ||
| Di. 15.30 - 17.00 Uhr, 57-309 | ||
| A) | A self-contained introduction to programming techniques for Artificial Intelligence (AI) is given. On the basis of a functional-logic programming kernel the following techniques are treated: deterministic and non-deterministic programs; depth-first and breadth-first search; backward and forward chaining; finite domains and negative constraints; concept hierarchies, sorts, and signatures; (meta-)interpreters and program transformation; uncertainty, genetic, and inductive programs. All notions are illustrated by concrete examples from engineering and other disciplines. | |
| B) | Yoav Shoham: Artificial Intelligence Techniques in Prolog. Morgan Kaufmann
Publ., Engl.
Material on functional-logic programming techniques with AI applications: http://www.dfki.uni-kl.de/~vega/relfun.html |
|
| C) | Programming skills and interest in AI (Lisp and Prolog will be recapitulated if/when needed) | |
| D) | Oral examinations with Prof. Richter | |
| E) | Demos of AI programs will be integrated with the lectures | |