CLASSIC: a structural data model for objects
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
On the Problem of Computing Small Representations of Least Common Subsumers
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Computing Least Common Subsumers in Description Logics with Existential Restrictions
Computing Least Common Subsumers in Description Logics with Existential Restrictions
Finding informative commonalities in concept collections
Proceedings of the 17th ACM conference on Information and knowledge management
A practical approach for computing generalization inferences in EL
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Hi-index | 0.00 |
Least Common Subsumers in Description Logics have shown their usefulness for discovering commonalities among all concepts of a collection. Several applications are nevertheless focused on searching for properties shared by significant portions of a collection rather than by the collection as a whole. Actually, this is an issue we faced in a real case scenario that provided initial motivation for this study, namely the process of Core Competence extraction in knowledge intensive companies. The paper defines four reasoning services for the identification of meaningful common subsumers describing partial commonalities in a collection. In particular Common Sub-sumers adding informative content to the Least Common Subsumer are investigated, with reference to different DLs.