FPF:UIAI042 Artificial Intelligence - Course Information
UIAI042 Artificial Intelligence
Faculty of Philosophy and Science in OpavaSummer 2014
- Extent and Intensity
- 2/0/0. 4 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Jozef Kelemen, DrSc. (lecturer)
- Guaranteed by
- prof. RNDr. Jozef Kelemen, DrSc.
Institute of Computer Science – Faculty of Philosophy and Science in Opava - Prerequisites (in Czech)
- ! UIN1009 Artificial Intelligence
- 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
- Applied Computer Science (programme FPF, B1802 AplI)
- Course objectives
- Introduction, the history, and the Turing test. Reactivity vs. memory. Definition of the reactive agents, examples, case studies of the architecture. Decentralization and communication of agents, the subsumption architecture, artificial neural network, leasing and adaptability. The way from reactivity to representation on the example of the systems Toto and MetaToto. Specification of the notion knowledge , an example of the system STRIPS, and the deliberative robotics. The state space and search, qualitative and quantitative heuristics, the evaluation function and the system GPS. The associative representation and the natural language understanding problem. Procedural representation, calling procedures by goals, logic programming. The frame representation scheme, representation of the defaults, non-monoton inferences and logics. Learning systems, Summary.
- Syllabus
- 13. Introduction, history, and the Turing test.
14. Reactivity and deliberation, the subsumption architecture.
15. Decentralization and communication.
16. Artificial neural networks.
17. From subsumption to deliberation (from Toto to MetaToto).
18. Knowledge and STRIPS.
19. The state space and the search procedures, types of heuristics.
20. The General Problem Solver.
21. The associative representation scheme. Example of computational learning.
22. The procedural representation scheme, and calling programs by goals.
23. The frame representation scheme. Default values and non-monotonicity.
24. Resume.
- 13. Introduction, history, and the Turing test.
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
- Teacher's information
- * 75% attendance in course, active participation
* success rate of 70 % from written test
- Enrolment Statistics (recent)
- Permalink: https://is.slu.cz/course/fpf/summer2014/UIAI042