FI:U520 Umělá inteligence pro VT

U520 Umělá inteligence pro VT

Faculty of Informatics
Spring 1996

Extent and Intensity

0/0. 0 credit(s). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium), z (credit).

Teacher(s)

doc. RNDr. Václav Sedláček, CSc. (lecturer)

Guaranteed by

Contact Person: doc. RNDr. Václav Sedláček, CSc.

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 / plans the course is directly associated with

Syllabus

Introduction - what is AI, pattern recognition, sceene analysis, knowledge representations, understanding natural languages, problem solving
State space and its representations
Basic methods of state space search, breadth-first search, depth-first search, heuristics, heuristic search, optimal solutions, admissibility, better informed algorithms
AND-OR graphs, methods of their representation, search processes in AND-OR graphs, heuristics, admissibility
Games, game graph, minimax procedures, alfa-beta procedures
Simple resolution
Predicate calculus of the first order, normal forms, clauses Herbrand interpretations, unification algorithms, resolution, resolution completness
Systematic resolutions generations
Expert systems
Prolog applications in AI

Language of instruction

Czech

The course is also listed under the following terms Spring 1997, Spring 1998.