Domenico Cantone, Cristiano Longo, Marianna Nicolosi-Asmundo, and Daniele Francesco Santamaria University of Catania, Dept, of Mathematics and Computer Science email: { cant one, longo ,nicolosi}@dmi .unict . it , daniele . f . santamariaOgmail . com
Abstract. In this paper wc use results from Computable Set Theory
as a means to represent and reason about description logics and rule languages for the semantic web. Specifically, we introduce the description logic 'D(4LQSJ?)(D)-allowing features such as min/max cardinality constructs on the left-hand/righthand side of inclusion axioms, role chain axioms, and datatypes-which turn out to be quite expressive if compared with S1ZOIQ(D ), the de scription logic underpinning the Web Ontology Language OWL. Then we show that the consistency problem for T>(4LQSi?}(D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment 4LQSR of set theory, in volving variables of four sorts and a restricted form of quantification. Wc prove also that, under suitable not very restrictive constraints, the con sistency problem for T>(4LQS,J?)(D)-knowledge bases is NP-complete. Finally, we provide a 4LQSR-translation of rules belonging to the Se mantic Web Rule Language (SWRL).