Finite Model Reasoning in Horn-SHIQ
نویسندگان
چکیده
Finite model reasoning in expressive DLs such as ALCQI and SHIQ requires non-trivial algorithmic approaches that are substantially differerent from algorithms used for reasoning about unrestricted models. In contrast, finite model reasoning in the inexpressive fragment DL-LiteF of ALCQI and SHIQ is algorithmically rather simple: using a TBox completion procedure that reverses certain terminological cycles, one can reduce finite subsumption to unrestricted subsumption. In this paper, we show that this useful technique extends all the way to the popular and much more expressive Horn-SHIQ fragment of SHIQ.
منابع مشابه
Query Answering in the Description Logic Horn - SHIQ
We provide an ExpTime algorithm for answering conjunctive queries (CQs) in Horn-SHIQ, a Horn fragment of the well-known Description Logic SHIQ underlying the OWL-Lite standard. The algorithm employs a domino system for model representation, which is constructed via a worst-case optimal tableau algorithm for Horn-SHIQ; the queries are answered by reasoning over the domino system. Our algorithm n...
متن کاملFinite Model Reasoning in Horn Description Logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted to the inexpressive DL DL-LiteF , and is shown here to extend to the expressive Horn DL Horn-ALCFI. The m...
متن کاملConsequence-Driven Reasoning for Horn SHIQ Ontologies
We present a novel reasoning procedure for Horn SHIQ ontologies—SHIQ ontologies that can be translated to the Horn fragment of first-order logic. In contrast to traditional reasoning procedures for ontologies, our procedure does not build models or model representations, but works by deriving new consequent axioms. The procedure is closely related to the so-called completion-based procedure for...
متن کاملOn the Complexity of Horn Description Logics
Horn-SHIQ has been identified as a fragment of the description logic SHIQ for which inferencing is in PT with respect to the size of the ABox. This enables reasoning with larger ABoxes in situations where the TBox is static, and represents one approach towards tractable description logic reasoning. In this paper, we show that reasoning in Horn-SHIQ, in spite of its low datacomplexity, is E...
متن کاملTowards Practical Query Answering for Horn-SHIQ
Query answering has become a prominent reasoning task in Description Logics. This is witnessed not only by the high number of publications on the topic in the last decade, but also by the increasing number of query answering engines. A number of systems provide full conjunctive query (CQ) answering capabilities, including [1, 23, 25, 4, 11]. A common feature of these approaches is that they rel...
متن کامل