Foundations of knowledged based systems (search, rules, description logics, answer set programming).
Lecturers
Lecture-Part: Uwe Egly und Thomas Eiter
Exercise-Part: Christoph Redl
Course of Action and Topics of the Lecture
- Mon Oct 3: Introduction+History+Architecture (Egly)
- Fri Oct 7: Search for problem solving I (Egly)
- Mon Oct 10: Search for problem solving II (Egly)
- Wed Oct 12 to Thu Oct 13: Mandatory entry test
- Fri Oct 14: Rules I (Egly)
- Mon Oct 17: Rules II (Egly)
- Fri Oct 21: Rules III (Egly)
- Mon Oct 24: Description Logics I (Eiter)
- Fri Oct 28: Description Logics II (Eiter)
- Mon Oct 31: No lecture
- Fri Nov 4: Description Logics III (Eiter)
- Mon Nov 7: Answer Set Programming I (Eiter)
- Fri Nov 11: No lecture
- Mon Nov 14: Answer Set Programming II (Eiter)
- Fri Nov 18: Answer Set Programming III (Eiter)
- Fri Nov 25 23:55: Deadline Project 1 (TUWEL)
- Nov 26 23:55: Deadline for Project 1 solution discussion (TUWEL)
- Nov 28-30: Project 1 solution discussion
- Dec 9 23:55: Deadline for Exercise Checkmarks (TUWEL)
- Dec 11 23:55: Deadline for Registration for an Exercise Discussion Slot (TUWEL)
- Dec 12 to Dec 16: Exercise Discussions
- Sun Jan 8 23:55: Deadline Project 2 (TUWEL)
- Mon Jan 9 8:15-9:45: Questions & Answers Session (FH HS 3)
- Mon Jan 9: Main Exam, 13:30-15:30, GM2
Exercise-Part
Mandatory registration within Sep 19-Oct 7
2 Projects
In addition to the 3 exercise sheets, two projects must be solved using ontologies and answer set programming:
- Submission via TUWEL
- Manual grading with mandatory discussion timeslot for Ontology project
- Automatic grading with testcases for ASP project
Project submission deadlines:
- Ontology Project: week 48 of 2016
- Answer Set Programming Project: week 1 of 2017
Important:
- Both projects must be worked out and submitted on time (no belated submission possible).
- Files must comply with the project specification!
- No group work!
- Exercises and projects must be worked out individually
- Finalisation of points after plagiarism check (possibility of fines and negative grades)
Used tools:
Exercises
Exercises will be handed out via TUWEL throughout the semester. The exercises can optionally be solved at home. Students can then check the examples they solved via TUWEL; checkmarks may be changed arbitrarily until the deadline. Afterwards there will be a discussion of your solutions. To this end we will offer slots of 1 hour length (3 students simultanously). The dates of the slots are to be announced. Both checking the examples and registering for a discussion slot needs to be done until Dec 4, 23:55 (strict deadline). (Note: Checking and registration for a slot is separate in TUWEL, but has the same deadline!)
In the discussion, students will be asked questions about their solutions of examples they checked. The discussion will be evaluated with 0-15 points, which are weighted with the fraction of checked examples and rounded to the next integer.
Example: Student X checked 70% of the examples and the discussion is evaluated with 12 points. Therefore he gets 8 exercise points.
In case a student does not participate in the discussion, no exercise points will be awarded!
References
- S. Russell, P. Norvig: Artificial Intelligence: A Modern Approach (Third Edition). Prentice Hall, 2009
- Charles Forgy: Rete: A Fast Algorithm for the Many Pattern/Many Object Pattern Match Problem. Artificial Intelligence 19:17-37, 1982
- Sebastian Rudolph: Foundations of Description Logics. Reasoning Web 2011, LNCS 6848, pp. 76-136, 2011. Springer
- Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph: Chapter OWL Formal Semantics. In Foundations of Semantic Web Technologies. Chapman & Hall/CRC, 2009, 455 pages.
- Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph: Chapter Ontology Engineering. In Foundations of Semantic Web Technologies. Chapman & Hall/CRC, 2009, 455 pages.
- Thomas Eiter, Giovambattista Ianni, and Thomas Krennwallner. Answer Set Programming: A Primer. Reasoning Web 2009, LNCS 5689, pp. 40-110, 2009. Springer
Exercise-Part
- Entry exam is totalling 3 pts.
- The 2 projects are totalling 17 pts.
- The exercises are totalling 15 pts.
Zero tolerance for unfair practice (e.g., plagiarism, copied solutions, ...). All involved persons will be fined with 0 pts. (you may get a negative certificate).
Lecture-Part
- Written closed book exam
- Total pts: 65
The total number of points is the sum of the entry exam (max. 3 pts), the projects (max. 17 pts), the exercises (max. 15 pts) and the final exam (max. 80 pts). This sums up to 100 pts in total.
Grading
Necessary requirements for a positive certificate (you must get enough points to satisfy each individual item on the list below):
- >= 2 points on the entry exam;
- >= 9 points for the two projects; and
- >= 32.5 points for the written final exam; and
- >= 51 points in total.
Because of the criteria, exercise points are not needed for a positive grade, but the less points you earn in the exercise part, the harder it is to earn the required total number of points!
If you did not satisfy all items from the requirements list above, you will get a negative certificate:
- In case you fail an item from the projects part, you will get a negative certificate and you have to redo the whole course.
- If you fail the lecture part, you will get a negative certificate, but you may be able to get a positive certificate (thus overriding your previous attempts) if you pass the written final exam at one of the side exam dates. You will have thus 4 tries (main exam + 3 side exams) to pass the written final exam.
Only after you have satisfied each individual item on the requirements list above, you will be graded as follows:
- < 51 pts: N5 (Nicht Genügend)
- >= 51 pts: G4 (Genügend)
- >= 63 pts: B3 (Befriedigend)
- >= 75 pts: U2 (Gut)
- >= 88 pts: S1 (Sehr Gut)
