A Worst-case Optimal Algorithm for SHOIQ
Abstract
In this work, we propose a worst-case optimal algorithm for deciding consistency in the description logic SHOIQ. The construction of this algorithm is founded on the standard tableau-based method for SHOIQ and the technique used for designing a NExpTime algorithm for the two-variable fragment of first-order logic with counting quantifiers C^2.
Cer article propose un algorithme optimal dans le pire des cas pour vérifier la cohérence d'une base de connaissances en SHOIQ.
| Origin | Files produced by the author(s) |
|---|