Description Logics are currently the most used formalisms for building ontologies, and have been proposed as standard languages for the specification of ontologies in the Semantic Web. The problem of adding rules to Description Logics is currently a hot research topic, due to the interest of Semantic Web applications towards the integration of rule-based systems with ontologies. Most of the approaches in this field concern the study of description logic knowledge bases augmented with rules expressed in Datalog and its nonmonotonic extensions. In this talk we present a set of computational results which identify, from the viewpoint of the expressive abilities of the two formalisms, minimal combinations of Description Logics and (nonmonotonic) Datalog in which reasoning is undecidable. Then, based on the above results, we briefly survey some recent proposals for overcoming such expressive limitations. © 2006 IEEE.
The limits and possibilities of combining description logics and datalog / Rosati, Riccardo. - (2006), pp. 3-4. (Intervento presentato al convegno RuleML 2006: 2006 Second International Conference on Rules and Rule Markup Languages for the Semantic Web tenutosi a Athens, GA nel 10 October 2006 through 11 October 2006) [10.1109/ruleml.2006.22].
The limits and possibilities of combining description logics and datalog
ROSATI, Riccardo
2006
Abstract
Description Logics are currently the most used formalisms for building ontologies, and have been proposed as standard languages for the specification of ontologies in the Semantic Web. The problem of adding rules to Description Logics is currently a hot research topic, due to the interest of Semantic Web applications towards the integration of rule-based systems with ontologies. Most of the approaches in this field concern the study of description logic knowledge bases augmented with rules expressed in Datalog and its nonmonotonic extensions. In this talk we present a set of computational results which identify, from the viewpoint of the expressive abilities of the two formalisms, minimal combinations of Description Logics and (nonmonotonic) Datalog in which reasoning is undecidable. Then, based on the above results, we briefly survey some recent proposals for overcoming such expressive limitations. © 2006 IEEE.File | Dimensione | Formato | |
---|---|---|---|
VE_2006_11573-206199.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
73.93 kB
Formato
Adobe PDF
|
73.93 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.