Daniele Francesco Santamaria

Web Ontology Representation and Reasoning via Fragments of Set Theory

In this paper we use results from Computable Set Theory as a means to represent and reason about description logics and rule languages for the semantic web.

A Set-Theoretic Approach to ABox Reasoning Services

In this paper we consider the most common ABox reasoning services for the description logic \(\mathcal {DL}\langle \mathsf {4LQS}^{\mathsf{R},\!\times }\rangle (\mathbf {D})\) (\(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\), for short) and prove their decidability via a reduction to the satisfiability problem for the set-theoretic fragment \(\mathsf {4LQS^R}\). The description logic \(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\) is very expressive, as it admits various concept and role constructs and data types that allow one to represent rule-based languages such as SWRL.

An Optimized KE-Tableau-Based System for Reasoning in the Description Logic \({\mathcal {DL}}_{{\mathbf {D}}}^{4,\!\times }\)

We present a KE-tableau-based procedure for the main TBox and ABox reasoning tasks for the description logic \(\mathcal {DL}\langle \mathsf {4LQS^{R,\!\times }}\rangle (\mathbf {D})\), in short \(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\). The logic \(\mathcal {DL}_{\mathbf {D}}^{4,\!\times }\), representable in the decidable multi-sorted quantified set-theoretic fragment \(\mathsf {4LQS^R}\), combines the high scalability and efficiency of rule languages such as the Semantic Web Rule Language (SWRL) with the expressivity of description logics.