Computing Least Common Subsumers in Description Logics (1992)
Cached
Download Links
- [www-2.cs.cmu.edu]
- [www.cs.man.ac.uk]
- [ftp.cs.rutgers.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | PROCEEDINGS OF THE 10TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE |
| Citations: | 71 - 13 self |
BibTeX
@INPROCEEDINGS{Cohen92computingleast,
author = {William W. Cohen and Alex Borgida and Haym Hirsh},
title = {Computing Least Common Subsumers in Description Logics },
booktitle = {PROCEEDINGS OF THE 10TH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE},
year = {1992},
pages = {754--760},
publisher = {MIT Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Description logics are a popular formalism for knowledge representation and reasoning. This paper introduces a new operation for description logics: computing the "least common subsumer" of a pair of descriptions. This operation computes the largest set of commonalities between two descriptions. After arguing for the usefulness of this operation, we analyze it by relating computation of the least common subsumer to the well-understood problem of testing subsumption; a close connection is shown in the restricted case of "structural subsumption". We also present a method for computing the least common subsumer of "attribute chain equalities", and analyze the tractability of computing the least common subsumer of a set of descriptions---an important operation in inductive learning.
