Browse wiki
From Semantic Portal Wiki
| Ankesh Summary Abox Gregory Todd Williams 2 |
| Modification dateThis property is a special property in this wiki. | 8 October 2008 20:08:44 + |
|---|---|
| Question answer | I think this computation is done prior to … I think this computation is done prior to application of tableaux algorithm. It simply refers to cardinality of R-successors initially in the Abox. This value would be used to calculate upper bound using the formula in section 3.2. Precisely it would give the cardinality of P(a). Filtering is done before application of tableaux algorithm. However, I'm not sure if taking the maximum works even when R is transitive. e maximum works even when R is transitive. |
| Question asked | Section 3.4 describes associating with each role R that is part of a cardinality restriction the maximum number of R-neighbors that any individual a has in A. Does this require running the tableau algorithm, or is this simply a way of saying |
| Question asked by | Gregory Todd Williams + |
| Question for the Presentation | Summary Abox Ankesh + |
| Categories | Presentation Questions |
| hide properties that link here |
| No properties link to this page. |
