<div class="csl-bib-body">
<div class="csl-entry">Gottlob, G., Pieris, A., & Šimkus, M. (2018). The Impact of Active Domain Predicates on Guarded Existential Rules. <i>Fundamenta Informaticae</i>, <i>159</i>(1–2), 123–146. https://doi.org/10.3233/fi-2018-1660</div>
</div>
-
dc.identifier.issn
0169-2968
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/145851
-
dc.description.abstract
It is realistic to assume that a database management system provides access to the active domain via built-in relations. Therefore, databases that include designated predicates that hold the active domain, which we call product databases, form a natural notion that deserves our attention. An important issue then is to look at the consequences of product databases for the expressiveness and complexity of central existential rule languages. We focus on guarded-based existential rules, and we investigate the impact of product databases on their expressive power and complexity. We show that the queries expressed via (frontier-)guarded rules gain in expressiveness, and in fact, they have the same expressive power as Datalog. On the other hand, there is no impact on the expressiveness of the queries specified via weakly-(frontier-)guarded rules since they are powerful enough to explicitly compute the predicates needed to access the active domain. We also observe that there is no impact on the complexity of the query languages in question.
en
dc.language.iso
en
-
dc.publisher
IOS Press
-
dc.relation.ispartof
Fundamenta Informaticae
-
dc.subject
Theoretical Computer Science
en
dc.subject
Information Systems
en
dc.subject
Algebra and Number Theory
en
dc.subject
Computational Theory and Mathematics
en
dc.subject
complexity
en
dc.subject
conjunctive queries
en
dc.subject
tuple-generating dependencies
en
dc.subject
expressive power
en
dc.subject
Rule-based languages
en
dc.subject
ontology-mediated queries
en
dc.subject
existential rules
en
dc.subject
guardedness
en
dc.title
The Impact of Active Domain Predicates on Guarded Existential Rules
en
dc.type
Artikel
de
dc.type
Article
en
dc.contributor.affiliation
University of Edinburgh, United Kingdom of Great Britain and Northern Ireland (the)
-
dc.description.startpage
123
-
dc.description.endpage
146
-
dc.type.category
Original Research Article
-
tuw.container.volume
159
-
tuw.container.issue
1-2
-
tuw.journal.peerreviewed
true
-
tuw.peerreviewed
true
-
wb.publication.intCoWork
International Co-publication
-
tuw.researchTopic.id
I1
-
tuw.researchTopic.name
Logic and Computation
-
tuw.researchTopic.value
100
-
dcterms.isPartOf.title
Fundamenta Informaticae
-
tuw.publication.orgunit
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
tuw.publisher.doi
10.3233/fi-2018-1660
-
dc.identifier.eissn
1875-8681
-
dc.description.numberOfPages
24
-
wb.sci
true
-
wb.sciencebranch
Informatik
-
wb.sciencebranch.oefos
1020
-
wb.facultyfocus
Logic and Computation (LC)
de
wb.facultyfocus
Logic and Computation (LC)
en
wb.facultyfocus.faculty
E180
-
item.openairetype
research article
-
item.fulltext
no Fulltext
-
item.cerifentitytype
Publications
-
item.languageiso639-1
en
-
item.openairecristype
http://purl.org/coar/resource_type/c_2df8fbb1
-
item.grantfulltext
none
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence
-
crisitem.author.dept
E184 - Institut für Informationssysteme
-
crisitem.author.dept
E192-02 - Forschungsbereich Databases and Artificial Intelligence