2015/05/08 by Domenico Cantone, Cantone, Domenico, Cristiano Longo +6
Computer Science · #Advanced Database Systems and Queries #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1505.02075
arxiv created 2015/05/08 · openalex publication_date 2015/05/08 · arxiv updated 2015/05/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. Specifically, we introduce the description logic DL⟨ 4LQSR⟩(\D)--admitting features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes--which turns out to be quite expressive if compared with SROIQ(\D), the description logic underpinning the Web Ontology Language OWL. Then we show that the consistency problem for DL⟨ 4LQSR⟩(\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, involving variables of four sorts and a restricted form of quantification. We prove also that, under suitable not very restrictive constraints, the consistency problem for DL⟨ 4LQSR⟩(\D)-knowledge bases is NP-complete. Finally, we provide a 4LQSR-translation of rules belonging to the Semantic Web Rule Language (SWRL).