Knowledge Representation and Reasoning
Systems Modelling and Data Analysis + Engineering of Intelligent Systems
Lectures: Tuesdays, C-2, Room 429, 15:30-17:00
Lectures 2019
02-26: CSP (MSL)
03-05: CSP (MSL)
03-12: CSP (MSL)
03-19: CSP (MSL)
03-26: KRR introduction (GJN)
04-02: LPP (GJN)
04-09: Planning (MSL)
04-16: Problog (MSL)
05-07: KR methods overview (GJN)
05-14: RBS (GJN)
05-21: LOD (GJN)
05-28: DL (GJN)
06-04: Wrap up and summary exam - zeroeth term
Useful Links
Background Material
Laboratories
Constraint Satisfaction and Discrete Optimization
The following classes will focus on modelling of discrete optimization and constraint satisfaction problems. Student will learn how to represent correctly different problems using constraint programming techniques.
Automated Planning
The following classes will cover automated planning problems. Student will learn how to represent planning problems using constraint programming and dedicated tools.
-
-
-
Probabilistic Programming
This part of the course will present probabilistic programming — a new programming paradigm meant to model domains uncertainty and imperfect knowledge.
-
-
-
Projects
There are three projects to choose from:
fox-geese-corn — simple planning problem.
gangs-wars — problem about optimal ordering of tasks. Quite simple, but it's very difficult to find the optimal solution.
production-planning — simplified problem of scheduling production at the factory.
All the project are available via gitlab.
Instructions, how to do the projects are included in the README.md
files.
The deadline is simply last class in the semester.
While grading I will check:
if the model is correct;
if the model allows to quickly find a good solution;
if the model is comprehensible;
what was your work hygiene (how often did you commit, did you contact in case of a problem, etc.)