Introduction to Description Logics
Lectures: 24 h
Recommended for:
Graduate Students. (Fördjupningskurs C4-C3)
The course last ran:
1995/96.
Goals:
Description logics (or terminological logics or concept languages) are computationally attractive limited subsets of first-order logic.
They are used for representing concepts and individuals in a given world and then drawing logical inferences from the given information.
The inferences center around, but are not limited to, classification. There are a number of implemented description logic systems which are used for building a variety of applications including software management systems, planning systems, telephone configuration systems and natural language understanding. Description logic systems are particularly suitable for applications where classification is a useful inference. At the conclusion of this course you will have:
- a good understanding of the principles of description logics
- used a number of different description logic systems, and compared their differences
- an understanding of the central algorithms used in description logic systems, in particular subsumption and classification
- looked briefly at some areas of current development in description logics.
Prerequisites:
basic course in logic (e.g. Logic for ida-ites, Logik grundkurs (TDDA15)).
Organization:
lectures + seminars (prepared by the participants) + labs.
Contents:
- Introduction to the field, what description logics are, KL-ONE
- Representing knowledge in description logics
- The algorithms: classification, subsumption, other inferencing
- Completeness, Correctness, Complexity
- Revision and update of knowledge bases
- Systems: KRIS, LOOM, CLASSIC, CRACK, FaCTS
- Applications using description logics
- Connection to databases
- Integrating different kinds of reasoning with description logics
Literature:
Articles.
Teachers:
Patrick Lambrix.
Examiner:
Patrick Lambrix.
Schedule:
February 99.
Examination:
seminars, lab assignments, experience report.
Credit:
4 credits.
Page responsible: Anne Moe