The Impact of Active Domain Predicates on Guarded Existential Rules.
Saved in:
| Title: | The Impact of Active Domain Predicates on Guarded Existential Rules. |
|---|---|
| Authors: | Gottlob, Georg1 georg.gottlob@cs.ox.ac.uk, Pieris, Andreas2 apieris@inf.ed.ac.uk, Šimkus, Mantas3 simkus@dbai.tuwien.ac.at |
| Source: | Fundamenta Informaticae. 2018, Vol. 159 Issue 1-2, p123-146. 24p. |
| Subjects: | Database management, Datalog (Computer program language), Query languages (Computer science), Domain-specific programming languages, Computational complexity |
| 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 guardedbased 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 128442913 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The Impact of Active Domain Predicates on Guarded Existential Rules. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Gottlob%2C+Georg%22">Gottlob, Georg</searchLink><relatesTo>1</relatesTo><i> georg.gottlob@cs.ox.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Pieris%2C+Andreas%22">Pieris, Andreas</searchLink><relatesTo>2</relatesTo><i> apieris@inf.ed.ac.uk</i><br /><searchLink fieldCode="AR" term="%22Šimkus%2C+Mantas%22">Šimkus, Mantas</searchLink><relatesTo>3</relatesTo><i> simkus@dbai.tuwien.ac.at</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Fundamenta+Informaticae%22">Fundamenta Informaticae</searchLink>. 2018, Vol. 159 Issue 1-2, p123-146. 24p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Database+management%22">Database management</searchLink><br /><searchLink fieldCode="DE" term="%22Datalog+%28Computer+program+language%29%22">Datalog (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Query+languages+%28Computer+science%29%22">Query languages (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Domain-specific+programming+languages%22">Domain-specific programming languages</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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 guardedbased 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Fundamenta Informaticae is the property of Polskie Towarzystwo Matematyczne and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=128442913 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.3233/FI-2018-1660 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 24 StartPage: 123 Subjects: – SubjectFull: Database management Type: general – SubjectFull: Datalog (Computer program language) Type: general – SubjectFull: Query languages (Computer science) Type: general – SubjectFull: Domain-specific programming languages Type: general – SubjectFull: Computational complexity Type: general Titles: – TitleFull: The Impact of Active Domain Predicates on Guarded Existential Rules. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Gottlob, Georg – PersonEntity: Name: NameFull: Pieris, Andreas – PersonEntity: Name: NameFull: Šimkus, Mantas IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: 2018 Type: published Y: 2018 Identifiers: – Type: issn-print Value: 01692968 Numbering: – Type: volume Value: 159 – Type: issue Value: 1-2 Titles: – TitleFull: Fundamenta Informaticae Type: main |
| ResultId | 1 |