Computing Least Common Subsumers in Description Logics with Existential Restrictions (1999)

by Franz Baader , Ralf Küsters , Ralf Molitor
Citations:89 - 24 self

Active Bibliography

72 Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles – - 2003
9 Restricted Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles – - 2003
277 Basic Description Logics – - 2003
1 Subsumption in EL w.r.t. hybrid TBoxes
1 Computing Most Specific Concepts in Description Logics with Existential Restrictions – - 2000
42 Rewriting concepts using terminologies – - 2000
8 What's in an Attribute? - Consequences for the Least Common Subsumer – - 2001
16 Approximating Most Specific Concepts in Description Logics with Existential Restrictions – - 2001
40 Polynomial time reasoning in a description logic with existential restrictions
2 Similarity-based Learning Methods for the Semantic Web
6 Structural subsumption and least common subsumers in a description logic with existential and number restrictions
16 Computing Least Common Subsumers in ALEN – - 2001
22 Is tractable reasoning in extensions of the description logic EL useful in practice – - 2005
Partial and Informative Common Subsumers in Description Logics
5 Partial and informative common subsumers of concepts collections in description logics – - 2008
1 Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
87 A Temporal Description Logic for Reasoning about Actions and Plans – - 1998
16 Description logics with inverse roles, functional restrictions, and n-ary relations – - 1994
84 On the Correspondence between Description Logics and Logics of Programs – - 1994