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⟨4LQS^R⟩(D)–allowing features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes–which turn 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⟨4LQS^R⟩(D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment 4LQS^R 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 4LQS^R-translation of rules belonging to the Semantic Web Rule Language (SWRL).

Web Ontology Representation and Reasoning via Fragments of Set Theory

CANTONE, Domenico;NICOLOSI ASMUNDO, MARIANNA;Santamaria D. F.
2015-01-01

Abstract

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⟨4LQS^R⟩(D)–allowing features such as min/max cardinality constructs on the left-hand/right-hand side of inclusion axioms, role chain axioms, and datatypes–which turn 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⟨4LQS^R⟩(D)-knowledge bases is decidable by reducing it, through a suitable translation process, to the satisfiability problem of the stratified fragment 4LQS^R 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 4LQS^R-translation of rules belonging to the Semantic Web Rule Language (SWRL).
2015
978-3-319-22001-7
Consistency problems; Description logic; Knowledge basis; Restrictive constraints; Satisfiability problems; Semantic Web Rule Language( SWRL)
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/73161
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 9
social impact