Many modern applications of description logics (DLs, for short), such as biomedical ontologies and semantic web policies, provide fresh motivations for extending DLs with nonmonotonic inferences—a topic that has attracted a significant amount of attention along the years. Despite this, nonmonotonic inferences are not yet supported by DL technology due to a number of issues related to expressiveness, computational complexity, and optimizations. This paper contributes to the practical support of nonmonotonic inferences in description logics by introducing a new semantics expressly designed to address knowledge engineering needs. This formalism has appealing expressiveness, enjoys nice computational properties, and constitutes an interesting solution to an ample class of application needs. The formalism is validated through extensive comparison with the other nonmonotonic DLs, and systematic scalability tests. The test case generator and its novel validation methodology constitute a further contribution of this paper.

A new semantics for overriding in description logics / Bonatti, PIERO ANDREA; Faella, Marco; Petrova, ILIANA MINEVA; Sauro, Luigi. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 222:(2015), pp. 1-48. [10.1016/j.artint.2014.12.010]

A new semantics for overriding in description logics

BONATTI, PIERO ANDREA;FAELLA, MARCO;PETROVA, ILIANA MINEVA;SAURO, LUIGI
2015

Abstract

Many modern applications of description logics (DLs, for short), such as biomedical ontologies and semantic web policies, provide fresh motivations for extending DLs with nonmonotonic inferences—a topic that has attracted a significant amount of attention along the years. Despite this, nonmonotonic inferences are not yet supported by DL technology due to a number of issues related to expressiveness, computational complexity, and optimizations. This paper contributes to the practical support of nonmonotonic inferences in description logics by introducing a new semantics expressly designed to address knowledge engineering needs. This formalism has appealing expressiveness, enjoys nice computational properties, and constitutes an interesting solution to an ample class of application needs. The formalism is validated through extensive comparison with the other nonmonotonic DLs, and systematic scalability tests. The test case generator and its novel validation methodology constitute a further contribution of this paper.
2015
A new semantics for overriding in description logics / Bonatti, PIERO ANDREA; Faella, Marco; Petrova, ILIANA MINEVA; Sauro, Luigi. - In: ARTIFICIAL INTELLIGENCE. - ISSN 0004-3702. - 222:(2015), pp. 1-48. [10.1016/j.artint.2014.12.010]
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/11588/612472
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 75
  • ???jsp.display-item.citation.isi??? 44
social impact