The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
History of programming languages---II
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
A Resolution-Based Decision Procedure for $\boldsymbol{\mathcal{SHOIQ}}$
Journal of Automated Reasoning
Prolog Based Description Logic Reasoning
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Efficient description logic reasoning in prolog: The dlog system
Theory and Practice of Logic Programming
A resolution based description logic calculus
Acta Cybernetica
| Hi-index | 0.00 |
Description Logics (DLs) [1] is family of logic languages designed to be a convenient means of knowledge representation. They can be embedded into FOL, but - contrary to the latter - they are decidable which gives them a great practical applicability. A DL knowledge base consists of two parts: the TBox (terminology box) and the ABox (assertion box). The TBox contains general background knowledge in the form of rules that hold in a specific domain. The ABox stores knowledge about individuals. For example, let us imagine an ontology about the structure of a university. The TBox might contain statements like “Every department has exactly one chair”, “Departments are responsible for at least 4 courses and for each course there is a department responsible for it”. In contrast, the ABox might state that “The Department of Computer Science is responsible for the course Information Theory” or that “Andrew is the chair of the the Department of Music”.