Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

Finite Entailment of UCRPQs over ALC Ontologies

Uproszczony widok
dc.abstract.enWe investigate the problem of finite entailment of ontology-mediated queries. We consider the expressive query language, unions of conjunctive regular path queries (UCRPQs), extending the well-known class of union of conjunctive queries, with regular expressions over roles. We look at ontologies formulated using the description logic ALC, and show a tight 2ExpTime upper bound for entailment of UCRPQs. At the core of our decision procedure, there is a novel automata-based technique introducing a stratification of interpretations induced by the deterministic finite automaton underlying the input UCRPQ.
dc.affiliationUniwersytet Warszawski
dc.conference.countryIzrael
dc.conference.datefinish2022-08-05
dc.conference.datestart2022-07-31
dc.conference.placeHaifa
dc.conference.seriesInternational Conference on the Principles of Knowledge Representation and Reasoning
dc.conference.seriesInternational Conference on the Principles of Knowledge Representation and Reasoning
dc.conference.seriesshortcutKR
dc.conference.shortcutKR 2022
dc.conference.weblinkhttps://kr2022.cs.tu-dortmund.de/
dc.contributor.authorMurlak, Filip
dc.contributor.authorIbáñez-García, Yazmín
dc.contributor.authorGutowski, Albert
dc.contributor.authorGutiérrez-Basulto, Víctor
dc.date.accessioned2024-01-25T00:41:08Z
dc.date.available2024-01-25T00:41:08Z
dc.date.issued2022
dc.description.financePublikacja bezkosztowa
dc.identifier.doi10.24963/KR.2022/19
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/107175
dc.identifier.weblinkhttp://dx.doi.org/10.24963/kr.2022/19
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.pages184–194
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.titleFinite Entailment of UCRPQs over ALC Ontologies
dc.typeJournalArticle
dspace.entity.typePublication