Teadmispõhise tarkvaraarenduse meetodid / Methods of Knowledge Based Software Development - 2015

Course code: ITI8600 (Ainekaart eesti keeles ITI8600)

Language: The default language of the course is English, but if all students understand Estonian, it will be in Estonian

Lecturers:

• Tanel Tammet, tanel.tammet@ttu.ee, 6203457, TTÜ ICT-426
• Juhan Ernits, juhan.ernits@ttu.ee, 6202326, TTÜ ICT-428 (handles ÕIS registrations)

Past editions

This course will be offered for the first time in 2015. It is the result of combining two previously offered courses, Knowledge Search, Formalization and Storing, Principles of Artificial Intelligence and applied logic

Time, place, result

• Lectures: Mondays 17:45-19:15, SOC-211B, SOC-211C
• Labs: Tuesdays 17:45-19:15, ICT-401

Grading

The final grade will be based on 40% of points from homework assignments and 60% of the result of an exam.

There will be four homework assignments, one for each course. Assignments will give up to 10 points each. In order to successfully pass the course, at least three homeworks must be successfully defended.

Homeworks can be done alone or in pairs. Pairs will be formed randomly by the lecturers, separately for each homework. As said, you can always opt to do it alone.

Homework has to be presented during lab time to the lecturer on site: email submissions are not accepted. Both pair members must be present during presentation: in case one of them is not present, the homework of the missing person is not considered to be defended. It is also not guaranteed that both pair members get the same grade.

The homeworks have to be submitted to the university git and then defended: git details will be presented later by Juhan.

Homework deadline policy:

• Defended code must be submitted for defence latest one date before the defence deadline (example: defence deadline 22. Sept, submission 21. Sept).
• In case the homework is defended in time, you have one extra week to add missing details/improvements without losing points.
• In case the homework is not defended in time, you have two extra weeks to defend it, but in this case you will get only half the points.
• No homeworks are accepted after the two extra weeks after the deadline have passed.
• In order to be accepted to exam you have to successfully defend at least three of the four homeworks.

Course structure

The course will consist of four interconnected blocks covering crucial areas of the subject:

Search algorithms

Homework will be presented at the 8. September. Homework defence deadline: 22. September.

• Tree search, depth first search, breadth first search, depth limited search (recap of what you know)
• Heuristic search (A*), formulating problems to be solved by search
• Stochastic local search
• Adversarial search (games, minimax, alpha-beta pruning)

Knowledge representation

Homework defence deadline: 20. October.

Useful in-depth material for reading as free pdf-s:

• Knowledge Representation and Reasoning
• Handbook of Knowledge Representation
• Interesting to browse: recent conference proceedings
• Interesting to browse: course materials, course materials

Block structure:

Reasoning and deduction

Homework defence deadline: 17. November.

Useful books for reading:

• T.Tamme, T.Tammet, R.Prank. Loogika: mõtlemisest tõestamiseni. TÜ Kirjastus, 2002
• Geoff reasoning course notes

Test and compare simple propositional solver algorithms:

• logictools.org

Learning

Homework defence deadline: 15. December.