Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
نویسندگان
چکیده
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.
منابع مشابه
A Tableaux Decision Procedure for SHOIQ
This paper presents a tableaux decision procedure for SHOIQ, the DL underlying OWL DL. To the best of our knowledge, this is the first goal-directed decision procedure for SHOIQ.
متن کاملExtending CARIN to the Description Logics of the SH Family
This work studies the extension of the existential entailment algorithm of CARIN to DLs of the SH family. The CARIN family of knowledge representation languages was one of the first hybrid languages combining DATALOG rules and Description Logics. For reasoning in one of its prominent variants, which combines ALCNR with non-recursive DATALOG, the blocking conditions of the standard tableaux proc...
متن کاملA Tableau Decision Procedure for SHOIQ
OWL DL, a newW3C ontology language recommendation, is based on the expressive description logic SHOIN . Although the ontology consistency problem for SHOIN is known to be decidable, up to now there has been no known “practical” decision procedure, i.e., a goal directed procedure that is likely to perform well with realistic ontology derived problems. We present such a decision procedure for SHO...
متن کاملAn EXPSPACE Tableaux-Based Algorithm for SHOIQ
In this paper, we propose an EXPSPACE tableaux-based algorithm for SHOIQ. The construction of this algorithm is founded on the standard tableauxbased 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.
متن کاملDescription Logic vs. Order-Sorted Feature Logic
We compare and contrast Description Logic (DL) and Order-Sorted Feature (OSF) Logic from the perspective of using them for expressing and reasoning with knowledge structures of the kind used for the Semantic Web. Introduction The advent of the Semantic Web has spurred a great deal of interest in various Knowldege Representation formalisms for expressing, and reasoning with, so-called formal ont...
متن کامل