Reasoners for OWL DL, while dealing with a decidable sublanguage, will be subject to higher worst-case complexity.
而OWLDL的推理机处理的尽管是一个可判定的子语言，会有更高的最坏情况复杂度。
Finally, the time complexity in the best and the worst case was analyzed.
最后分析了该方法在最好和最坏情况下的时间复杂度。
Finally, the time complexity in the best and the worst case was analyzed.
最后分析了该方法在最好和最坏情况下的时间复杂度。
应用推荐