Name
Abstract | ||
|---|---|---|
rea- soning. We propose to apply this technique to knowledge bases defined in Description Logics. For this, we introduce a normal form, called link- less concept descriptions. We present an algorithm, which can be used to transform a given concept description into an equivalent linkless concept description. The normal form supports a linear satisfiability check and ecient projection operators. Techniques like structural subsumption al- gorithms ((BN03)), normalization ((BH98) and absorption ((Hor98)) are related to our approach. Further (SK96) introduces the idea of approxi- mating FL concept descriptions by FL concept descriptions. |
Year | Venue | Keywords |
|---|---|---|
2007 | KESE | projection operator,knowledge base,description logic,normal form,satisfiability |
DocType | Citations | PageRank |
Conference | 3 | 0.38 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulrich Furbach | 1 | 639 | 88.23 |
| Claudia Obermaier | 2 | 6 | 1.11 |