Data Access With Horn Ontologies: Where Description Logics Meet Existential Rules

dc.contributor.author	Mugnier, Marie-Laure
dc.date.accessioned	2021-04-23T09:36:44Z
dc.date.available	2021-04-23T09:36:44Z
dc.date.issued	2020
dc.description.abstract	Two main families of ontology languages are considered in the context of data access, namely Horn description logics and existential rules. In this paper, we review the semantic relationships between these families in the light of the ontology-mediated query answering problem. To this end, we rely on the standard translation of description logics in first-order logic and on the notion of semantic emulation. We focus on description logics and classes of existential rules for which the conjunctive query answering problem has polynomial data complexity.	de
dc.identifier.doi	10.1007/s13218-020-00678-3
dc.identifier.pissn	1610-1987
dc.identifier.uri	http://dx.doi.org/10.1007/s13218-020-00678-3
dc.identifier.uri	https://dl.gi.de/handle/20.500.12116/36319
dc.publisher	Springer
dc.relation.ispartof	KI - Künstliche Intelligenz: Vol. 34, No. 4
dc.relation.ispartofseries	KI - Künstliche Intelligenz
dc.subject	Data access
dc.subject	Existential rules
dc.subject	Horn description logics
dc.subject	Ontology-mediated query answering
dc.title	Data Access With Horn Ontologies: Where Description Logics Meet Existential Rules	de
dc.type	Text/Journal Article
gi.citation.endPage	489
gi.citation.startPage	475

Sammlungen