This offering is not in the current catalogue. The information is retained from an earlier publication. Check the provider's current offering.
Umeå University
Artificial Intelligence - Methods and Applications
Modern intelligent systems are transforming the daily life of society. These kind of systems are designed and implemented considering Artificial Intelligent (AI) models and algorithms. This course aims to present different AI theories and algorithms in order to give a solid background in the area, as well as practic…
- Higher education
- Information unavailable
- 2 November 2026
- Umeå
- Information unavailable
- 50 %
Overview
Modern intelligent systems are transforming the daily life of society. These kind of systems are designed and implemented considering Artificial Intelligent (AI) models and algorithms. This course aims to present different AI theories and algorithms in order to give a solid background in the area, as well as practical knowledge about how to implement real intelligent systems. The main theme of the course is theories and algorithms from classical AI. During the course, the students will acquire knowledge about different paradigms of AI, e.g. logic-based and data-driven methods as well as rational intelligent agents. The course consists of two parts: **Part 1, theory, 4.5 credits** Topics covered: - Search algorithms, e.g., adversarial search and games. - Answer Set Programming (ASP), e.g., stable models, optimization modelling. - Knowledge representation, e.g., description logics. - Probability theory, e.g., axioms, conditional probability, Bayes' rule. - Probabilistic reasoning, e.g., Bayesian networks. - Probabilistic reasoning over time, e.g., hidden markov models. - Sequential decision making, e.g., markov decision processes, stochastic planning. - Reinforcement learning. - Agent architectures, e.g., BDI agents. - Multi-criteria decision-making, e.g., utility functions, evaluation of alternatives, pareto-optimality. **Part 2, practice, 3 credits.** In the laboratory part some of the theories and techniques discussed in the theoretical part are put into practice.
Admission scores
Entry requirements
At least 90 ECTS, including 60 ECTS Computing Science, or at least 120 ECTS within a study programme. At least 7.5 ECTS data structures and algorithms; 7.5 ECTS artificial intelligence; 7.5 ECTS discrete mathematics; and 7.5 ECTS logics. Proficiency in English equivalent to the level required for basic eligibility for higher studies.
The text is reproduced from the Susa source. Antagningsdata does not map GY11 and GY25 or assess personal eligibility.
Source, measure and data quality
- Source
- Skolverket Susa-navet
- Period
- 2026-11-02
- Measure
- Entry-requirement text reproduced from the published Susa data; no personal eligibility assessment is made.
- Population
- Education offering e.uoh.umu.5dv181.a5701.20262
- Last checked
- 2026-09-23T10:39:35.037285+00:00
- Limitation
- Antagningsdata does not map GY11 and GY25. General and specific conditions are not separated without structured source data.
Programme content
Study structure
Application and important dates
- Programme or course starts
- Programme or course ends
Salary and salary distribution
Common occupations after graduation
Students
Geographical background
Previous upper-secondary schools and programmes
Completion and outcomes
About the provider
Sources and data quality
Education facts for the selected offering come from Skolverket Susa-navet.
Retrieved . Published . Times are shown in Swedish local time.
Source identity and publication version
- Publication version
- 8e217193-f5fa-4778-b085-a4521fd03e8d
- Education identity in the source
- i.uoh.umu.5dv181.a5701.20262
- Offering identity in the source
- e.uoh.umu.5dv181.a5701.20262
- Education-form source code
- HS
- Education code in the source
- 5DV181
- Change time according to the source
- 2026-03-02T08:14:47
The provider, education and education offering are separate identities. Application information should be checked on the official website. Supplementary statistics have not been obtained from this source.