Course details

Fundamentals of Artificial Intelligence

IZU Acad. year 2014/2015 Summer semester 4 credits

Current academic year

Problem solving: State space search (BFS, DFS, DLS, IDS, BS, UCS, Backtracking, Forward checking, Min-conflict, BestFS, GS, A*, Hill Climbing, Simulated annealing methods). Solving of optimization problems using algorithms inspired by nature (GA, ACO and PSO). Problem decomposition (And Or graphs), games playing (Mini-Max and Alfa-Beta algorithms). Knowledge representation - basic schemes. AI languages (PROLOG, LISP) and implementations of basic search algorithms in these languages. Machine learning principles. Statistical and structural pattern recognition. Fundamentals of computer vision. Base principles of natural language processing. Application fields of artificial intelligence.

Guarantor

Zbořil František, doc. Ing., CSc. (DITS)

Language of instruction

Czech, English

Completion

Credit+Examination

Time span

Department

Department of Intelligent Systems (UITS)

Subject specific learning outcomes and competences

  • Students will learn terminology in Artificial Intelligence field both in Czech and in English language.
  • Students will learn read and so partly write logic and functional programs.

  • Students will acquaint with problem solving methods based on state space search and on decomposition problem into sub-problems.
  • Students will acquaint with basic game playing methods of two players.
  • Students will learn to solve optimization problems.
  • Students will acquaint with fundamentals of propositional and predicate logics and with their applications.
  • Students will learn how to use basic methods of machine learning.
  • Students will acquaint with fundamentals of machine vision and natural language processing.

Learning objectives

To give the students the knowledge of fundamentals of artificial intelligence, namely knowledge of problem solving approaches, machine learning principles and general theory of recognition. Students acquire base information about computer vision and natural language processing.

Prerequisite knowledge and skills

  • Basic knowledge of the programming in any procedural programming language.
  • Knowledge of secondary school level matematics.

Study literature

  • Russel,S., Norvig,P.: Artificial Intelligence, Prentice-Hall, Inc., 1995, ISBN 0-13-360124-2, second edition 2003, ISBN 0-13-080302-2, third edition 2010, ISBN 0-13-604259-7

Fundamental literature

  • Russel,S., Norvig,P.: Artificial Intelligence, Prentice-Hall, Inc., 1995, ISBN 0-13-360124-2, second edition 2003, ISBN 0-13-080302-2, third edition 2010, ISBN 0-13-604259-7
  • Luger,G.F.: Artificial Intelligence - Structures and strategies for Complex Problem Solving, 6th Edition,
    Pearson Education, Inc., 2009, ISBN-13: 978-0-321-54589-3, ISBN-10: 0-321-54589-3 

Syllabus of seminars

Syllabus of lectures:
  1. Introduction, Artificial Intelligence (AI) definition, types of AI problems, solving problem methods.
  2. State space search methods.
  3. Solving methods using decomposition problems into sub-problems (AND/OR graphs).
  4. Solving of optimization problems using algorithms inspired by nature - short introduction into Genetic algorithms, ACO (Ant Colony Optimization) and PSO (Particle Swarm Optimization).
  5. Methods of game playing (minimax, alpha-beta, games with unpredictability).
  6. Logic and AI, resolution and it's application in problem solving.
  7. Knowledge representation (basic schemes).
  8. Implementation of basic search algorithms in PROLOG.
  9. Implementation of basic search algorithms in LISP.
  10. Machine learning.  
  11. Fundamentals of pattern recognition theory. Classical classifiers, perceptron.
  12. Principles of computer vision.
  13. Principles of natural language processing.

Syllabus of computer exercises:
  1. Problem solving - simple programs.
  2. Problem solving - games playing.
  3. PROLOG language - basic information.
  4. PROLOG language - simple individual programs.
  5. LISP language - basic information.
  6. LISP language - simple individual programs.
  7. Simple programs for pattern recognition.

Progress assessment

At least 15 points earned during semester (mid-term test + programs in computer exercises).

Controlled instruction

  • Mid-term written examination - 20 points.
  • Programs in computer exercises - 20 points.
  • Final written examination - 60 points; The minimal number of points which can be obtained from the final written examination is 25. Otherwise, no points will be assigned to a student.

Course inclusion in study plans

  • Programme IT-BC-3, field BIT, 2nd year of study, Compulsory
Back to top