Machine Learning - Special issue on COLT '94
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Computing Least Common Subsumers in Description Logics with Existential Restrictions
Computing Least Common Subsumers in Description Logics with Existential Restrictions
An Axiomatic Approach to Feature Term Generalization
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
Computing Least Common Subsumers in Expressive Description Logics
AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Approximating Most Specific Concepts in Description Logics with Existential Restrictions
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
A Refinement Operator for Description Logics
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
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
Semantic Composition of Lecture Subparts for a Personalized e-Learning
ESWC '07 Proceedings of the 4th European conference on The Semantic Web: Research and Applications
Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On the Influence of Description Logics Ontologies on Conceptual Similarity
EKAW '08 Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Analogical Reasoning in Description Logics
Uncertainty Reasoning for the Semantic Web I
Message models and aggregation in knowledge based middleware for rich sensor systems
Proceedings of the Sixth International Workshop on Data Management for Sensor Networks
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
Matching in hybrid terminologies
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Non-standard inferences in description logics
Non-standard inferences in description logics
Reasoning and explanation in EL and in expressive description logics
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
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
A new n-ary existential quantifier in description logics
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Subsumption in w.r.t. hybrid TBoxes
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Knowledge compilation for automated Team Composition exploiting standard SQL
Proceedings of the 27th Annual ACM Symposium on Applied Computing
A framework for semantic-based similarity measures for ELH-concepts
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Most specific generalizations w.r.t. general EL-TBoxes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Computing the least common subsunier (les) is an inference task that can be used to support, the "bottom-up" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions, but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential restrictions. Our approach for computing the lcs is based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisins between these trees. The lcs operation then corresponds to the product operation on trees.