Abstract
One of the most popular formalisms of describing knowledge is Description Logics. It has become even more popular when OWL standard has emerged. The paper presents a new reasoning algorithm - the Cartographer Algorithm - that allows for inferring implicit knowledge from a terminology (TBox) and assertions (ABox) of an ontology. The paper describes the way of processing ontologies in terms of binary signatures and an efficient way of querying ontologies containing numerous individuals. In addition, results of experiments comparing the Cartographer Algorithm with other reasoners are presented. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Goczyla, K., Grabowska, T., Waloszek, W., & Zawadzki, M. (2005). The cartographer algorithm for processing and querying Description Logics ontologies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3528 LNAI, pp. 163–169). Springer Verlag. https://doi.org/10.1007/11495772_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
