Extending the SHOIQ(D) tableaux with DL-safe rules: First results

Vladimir Kolovski, Bijan Parsia, Evren Sirin

    Research output: Chapter in Book/Conference proceedingConference contribution

    Abstract

    On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually produce undecidable formalisms, unless constrained in a specific way. We look at one of the most expressive - but decidable - such formalisms proposed: DL-safe rules, and present a tableaux-based algorithm for query answering in OWL-DL augmented with a DL-safe rules component. In this paper we present our algorithm which is an extension of the SHOIQ tableaux algorithm and show the preliminary empirical results. Knowing that we pay a high price in performance for this expressivity, we also explore possible optimizations.
    Original languageEnglish
    Title of host publicationCEUR Workshop Proceedings|CEUR Workshop Proc.
    PublisherRWTH Aachen University
    Pages192-199
    Number of pages7
    Volume189
    Publication statusPublished - 2006
    Event2006 International Workshop on Description Logics, DL 2006 - Windermere, Lake District
    Duration: 1 Jul 2006 → …

    Publication series

    NameCEUR Workshop Proceedings

    Conference

    Conference2006 International Workshop on Description Logics, DL 2006
    CityWindermere, Lake District
    Period1/07/06 → …

    Fingerprint

    Dive into the research topics of 'Extending the SHOIQ(D) tableaux with DL-safe rules: First results'. Together they form a unique fingerprint.

    Cite this