Description Logic Reasoning with Syntactic Updates

Abstract

Abstract. Various data sources on the Web tend to be highly dynamic; this is evident in prominent Web services frameworks in which devices register or deregister their descriptions quite rapidly and in Semantic Web portals which allow content authors to modify or extend underlying ontologies and submit content. Such applications often leverage Description Logic (DL) reasoning for a variety of tasks (e.g., classifying Web service descriptions, etc); however, this can introduce substantial overhead due to content fluctuation, as DL reasoners have only been considered for relatively static knowledge bases. This work aims to provide more efficient DL reasoning techniques for frequently changing instance bases (ABoxes). More specifically, we investigate the process of incrementally updating tableau completion graphs used for reasoning in the expressive DLs SHOQ and SHIQ, which correspond to a large subset of the W3C standard Web Ontology Language, OWL-DL. We present an algorithm for updating completion graphs under the syntactic addition and removal of ABox assertions. We also provide an empirical analysis of the approach through an implementation in the OWL-DL reasoner, Pellet.

Representation of conceptual ETL designs in natural language using Semantic Web technology

“…For further information on techniques for consistency checking, query answering, and classification we refer to e.g. [3,8,9,26]. As for now, in our work we do not support incremental reasoning and consequently, we do not support incremental production of only the affected parts of an ETL process.…”

Distributed RDFS knowledge-based system update in case of deletions

“…DeGiacomo et al [12] presented an algorithm for insertion and deletion in DL-lite logic. Haleshak et al [13] consider the process of incrementally updating tableau completion graphs created during consistency checking in the expressive description logics SHOQ(D) and SHIQ(D) but their algorithm has high overhead.…”

Knowledge-based coordination with a reliable semantic subscription mechanism

“…However, current research in the field of reasoning algorithms already addresses this problem. E.g., in [12], an algorithm is proposed that allows for performance improvements for dynamic knowledge bases of "up to three orders of magnitude". We plan to investigate these algorithms and to integrate this technology in the next version of SENS.…”