Examples in the course are presented in the Prolog programming language, students independently have to manage the principles of Prolog at the level of understanding the program operation.
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
Fields of study the course is directly associated with
there are 29 fields of study the course is directly associated with, display
Introduction to problem solving in the area of artificial intelligence (with algorithms in the Prolog programming language). The main aim of the course is to provide information about fundamental algorithms used in AI.
The Prolog language.
Operations and data structures.
State space searching.
Heuristics, Best-first search, A* search.
Problem decomposition, AND/OR graphs.
Constraint Satisfaction Problems.
Games and basic game strategies.
Intelligent agents, propositional logic, first order predicate logic.
TIL - transparent intensional logic.
Knowledge representation and reasoning.
Learning, decision trees, neural networks.
Natural language processing.
Stuart Russel \& Peter Norvig: Artificial intelligence : a modern approach, 2nd.ed., Prentice Hall, 2003.
BRATKO, Ivan. Prolog programming for artificial intelligence. 3rd ed. Harlow: Addison-Wesley, 2001. xxi, 678 s. ISBN 0-201-40375-7. info
NORVIG, Peter and Stuart Jonathan RUSSELL. Artificial intelligence :a modern approach. Upper Saddle River: Prentice Hall, 1995. xxviii, 93. ISBN 0-13-103805-2. info
Lectures with recommended self-study of examples, with voluntary student talks.
The final grade consists of 2 written tests and voluntary student presentations.