Title:

Fundamentals of Artificial Intelligence

Code:IZU
Ac.Year:2017/2018
Term:Summer
Curriculums:
ProgrammeFieldYearDuty
IT-BC-3BIT2ndCompulsory
Language of Instruction:Czech
Private info:http://www.fit.vutbr.cz/study/courses/IZU/private/
Credits:4
Completion:credit+exam (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:2600130
 ExaminationTestsExercisesLaboratoriesOther
Points:60202000
Guarantor:Zbořil František V., doc. Ing., CSc., DITS
Lecturer:Zbořil František, doc. Ing., Ph.D., DITS
Zbořil František V., doc. Ing., CSc., DITS
Instructor:Havlena Vojtěch, Ing., DITS
Rozman Jaroslav, Ing., Ph.D., DITS
Šoková Veronika, Ing., DITS
Šůstek Martin, Ing., DITS
Uhlíř Václav, Ing. et Ing., DITS
Žák Marek, Ing., DITS
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
Substitute for:
Artificial Intelligence (UIN), DITS
Schedule:
DayLessonWeekRoomStartEndLect.Gr.St.G.EndG.
Moncomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20408:0019:50
Moncomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20308:0009:50
Monexam - 1. oprava2018-05-28D10509:0011:502BIA
Monexam - 1. oprava2018-05-28D10509:0011:502BIB
Monexam - 1. oprava2018-05-28D10509:0011:503BIT
MonlecturelecturesE11211:0012:502BIB
MonlecturelecturesE10411:0012:502BIB
MonlecturelecturesE10511:0012:502BIB
MonlecturelecturesE11211:0012:503BITxxxx
Tuecomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20408:0019:50
TuelecturelecturesE11213:0014:502BIA
TuelecturelecturesE10413:0014:502BIA
TuelecturelecturesE10513:0014:502BIA
TuelecturelecturesE11213:0014:503BITxxxx
Wedcomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20408:0019:50
Wedexam - 2. oprava2018-06-06D10514:0016:502BIA
Wedexam - 2. oprava2018-06-06D10514:0016:502BIB
Wedexam - 2. oprava2018-06-06D10514:0016:503BIT
Thucomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20408:0013:50
Thucomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20308:0009:50
Thuexam - řádná2018-05-17D10513:0015:502BIA
Thuexam - řádná2018-05-17D10513:0015:502BIB
Thuexam - řádná2018-05-17D10513:0015:503BIT
Thuexam - řádná2018-05-17D020613:0015:502BIA
Thuexam - řádná2018-05-17D020613:0015:502BIB
Thucomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20315:0019:50
Fricomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20408:0013:50
Fricomp.lab4., 5., 6., 7., 10., 11., 12. of lecturesN20308:0013:50
FriNáhradní cvičení2018-05-04A21814:0015:50
Frináhradní cvičení2018-05-04E10414:0015:50
 
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 expert systems, computer vision and natural language processing.
Description:
  
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 optimization problems by nature-inspired algorithms (GA, ACO and PSO). Problem decomposition (And Or graphs), games playing (Mini-Max and Alfa-Beta algorithms). AI language PROLOG and implementations of basic search algorithms in this language. Machine learning principles. Statistical and structural pattern recognition. Basic principles of expert systems. Fundamentals of computer vision. Base principles of natural language processing. Application fields of artificial intelligence.
Knowledge and skills required for the course:
  
  • Basic knowledge of the programming in any procedural programming language.
  • Knowledge of secondary school level mathematics.
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.
Generic learning outcomes and competences:
  
  • 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.
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.
  4. Solving optimization problems using algorithms inspired by nature.
  5. Methods of game playing (two players).
  6. Logic and AI, resolution and it's application in problem solving and planning.
  7. PROLOG language and its use in AI.
  8. Machine learning.  
  9. Pattern recognition.
  10. Principles of expert systems.
  11. Principles of computer vision.
  12. Principles of natural language processing.
  13. Introduction into agent systems.
Syllabus of computer exercises:
 
  1. Problem solving - State Space Search.
  2. Problem solving - CSP.
  3. Problem solving - game playing.
  4. Predicate logic - method of resolution.
  5. PROLOG language - basic information.
  6. PROLOG language - simple individual programs.
  7. Simple programs for pattern recognition.
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
  • Ertel, W.: Introduction to Artificial Intelligence, Springer, second edition 2017, ISSN 1863-7310
  • 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
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
  • Ertel, W.: Introduction to Artificial Intelligence, Springer, second edition 2017, ISSN 1863-7310
Progress assessment:
  
  • 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.
Exam prerequisites:
  At least 15 points earned during semester (mid-term test + programs in computer exercises).
 

Your IPv4 address: 23.20.165.182
Switch to IPv6 connection

DNSSEC [dnssec]