A Worst-Case Optimal Tableaux-Based Algorithm for SHOIQ - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2011

A Worst-Case Optimal Tableaux-Based Algorithm for SHOIQ

Abstract

In this paper, we propose a novel tableaux-based algorithm for checking consistency of a $\mathcal{SHOIQ}$ knowledge base. This algorithm creates a structure consisting of a set of trees which are linked together by a partitioning function over the set of all the trees' nodes. This construction allows us to avoid building explicitly a graph with cycles and ensures that the size of created structures is exponential in size of SHOIQ knowledge bases. From this, we show that the novel algorithm is worst-case optimal for checking consistency of a SHOIQ knowledge base.
Cer article propose un algorithme optimal dans le pire des cas pour vérifier la cohérence d'une base de connaissances en SHOIQ.
Fichier principal
Vignette du fichier
novel-SHOIQ.pdf (190.58 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Dates and versions

inria-00570161 , version 1 (27-02-2011)
inria-00570161 , version 2 (17-03-2011)
inria-00570161 , version 3 (02-06-2012)

Identifiers

  • HAL Id : inria-00570161 , version 1

Cite

Chan Le Duc, Myriam Lamolle, Olivier Curé. A Worst-Case Optimal Tableaux-Based Algorithm for SHOIQ. [Research Report] 2011, pp.19. ⟨inria-00570161v1⟩
288 View
358 Download

Share

Gmail Mastodon Facebook X LinkedIn More