A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic (1994)
| Venue: | Journal of Artificial Intelligence Research |
| Citations: | 155 - 14 self |
BibTeX
@ARTICLE{Borgida94asemantics,
author = {Alex Borgida and Peter F. Patel-Schneider},
title = {A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic},
journal = {Journal of Artificial Intelligence Research},
year = {1994},
volume = {1},
pages = {277--308}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper analyzes the correctness of the subsumption algorithm used in classic, a description logic-based knowledge representation system that is being used in practical applications. In order to deal efficiently with individuals in classic descriptions, the developers have had to use an algorithm that is incomplete with respect to the standard, model-theoretic semantics for description logics. We provide a variant semantics for descriptions with respect to which the current implementation is complete, and which can be independently motivated. The soundness and completeness of the polynomial-time subsumption algorithm is established using description graphs, which are an abstracted version of the implementation structures used in classic, and are of independent interest. 1. Introduction to Description Logics Data and knowledge bases are models of some part of the natural world. Such models are often built from individual objects that are inter-related by relationships and g...
