Capturing Homomorphism-Closed Decidable Queries with Existential Rules
Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserv...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Bourgaux, Camille Carral, David Krötzsch, Markus Rudolph, Sebastian Thomazo, Michaël |
| description | Existential rules are a very popular ontology-mediated query language for
which the chase represents a generic computational approach for query
answering. It is straightforward that existential rule queries exhibiting chase
termination are decidable and can only recognize properties that are preserved
under homomorphisms. In this paper, we show the converse: every decidable query
that is closed under homomorphism can be expressed by an existential rule set
for which the standard chase universally terminates. Membership in this
fragment is not decidable, but we show via a diagonalisation argument that this
is unavoidable. |
| doi_str_mv | 10.48550/arxiv.2107.07811 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2107_07811</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2107_07811</sourcerecordid><originalsourceid>FETCH-LOGICAL-a671-26d6563216a8a8e9e37377f214c41a3e07d5a57467c067a9b8372dadf51c15e83</originalsourceid><addsrcrecordid>eNotz71OwzAUhmEvDKjlApjwDST4J_Zxxyq0FKlSBeoencYn1JLTRnYC5e6Bgr7h3T7pYexeirJyxohHTJfwUSopoBTgpLxl6xqHcUrh9M435_5naTiG3Bd1PGfy_Ina4PEQib9OlAJl_hnGI19dQh7pNAaM_G2KlOfspsOY6e6_M7Zfr_b1ptjunl_q5bZAC7JQ1ltjtZIWHTpakAYN0ClZtZVETQK8QQOVhVZYwMXBaVAefWdkKw05PWMPf7dXSDOk0GP6an5BzRWkvwEKhkWg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Capturing Homomorphism-Closed Decidable Queries with Existential Rules</title><source>arXiv.org</source><creator>Bourgaux, Camille ; Carral, David ; Krötzsch, Markus ; Rudolph, Sebastian ; Thomazo, Michaël</creator><creatorcontrib>Bourgaux, Camille ; Carral, David ; Krötzsch, Markus ; Rudolph, Sebastian ; Thomazo, Michaël</creatorcontrib><description>Existential rules are a very popular ontology-mediated query language for
which the chase represents a generic computational approach for query
answering. It is straightforward that existential rule queries exhibiting chase
termination are decidable and can only recognize properties that are preserved
under homomorphisms. In this paper, we show the converse: every decidable query
that is closed under homomorphism can be expressed by an existential rule set
for which the standard chase universally terminates. Membership in this
fragment is not decidable, but we show via a diagonalisation argument that this
is unavoidable.</description><identifier>DOI: 10.48550/arxiv.2107.07811</identifier><language>eng</language><subject>Computer Science - Databases ; Computer Science - Logic in Computer Science</subject><creationdate>2021-07</creationdate><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2107.07811$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2107.07811$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Bourgaux, Camille</creatorcontrib><creatorcontrib>Carral, David</creatorcontrib><creatorcontrib>Krötzsch, Markus</creatorcontrib><creatorcontrib>Rudolph, Sebastian</creatorcontrib><creatorcontrib>Thomazo, Michaël</creatorcontrib><title>Capturing Homomorphism-Closed Decidable Queries with Existential Rules</title><description>Existential rules are a very popular ontology-mediated query language for
which the chase represents a generic computational approach for query
answering. It is straightforward that existential rule queries exhibiting chase
termination are decidable and can only recognize properties that are preserved
under homomorphisms. In this paper, we show the converse: every decidable query
that is closed under homomorphism can be expressed by an existential rule set
for which the standard chase universally terminates. Membership in this
fragment is not decidable, but we show via a diagonalisation argument that this
is unavoidable.</description><subject>Computer Science - Databases</subject><subject>Computer Science - Logic in Computer Science</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAUhmEvDKjlApjwDST4J_Zxxyq0FKlSBeoencYn1JLTRnYC5e6Bgr7h3T7pYexeirJyxohHTJfwUSopoBTgpLxl6xqHcUrh9M435_5naTiG3Bd1PGfy_Ina4PEQib9OlAJl_hnGI19dQh7pNAaM_G2KlOfspsOY6e6_M7Zfr_b1ptjunl_q5bZAC7JQ1ltjtZIWHTpakAYN0ClZtZVETQK8QQOVhVZYwMXBaVAefWdkKw05PWMPf7dXSDOk0GP6an5BzRWkvwEKhkWg</recordid><startdate>20210716</startdate><enddate>20210716</enddate><creator>Bourgaux, Camille</creator><creator>Carral, David</creator><creator>Krötzsch, Markus</creator><creator>Rudolph, Sebastian</creator><creator>Thomazo, Michaël</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210716</creationdate><title>Capturing Homomorphism-Closed Decidable Queries with Existential Rules</title><author>Bourgaux, Camille ; Carral, David ; Krötzsch, Markus ; Rudolph, Sebastian ; Thomazo, Michaël</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a671-26d6563216a8a8e9e37377f214c41a3e07d5a57467c067a9b8372dadf51c15e83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Databases</topic><topic>Computer Science - Logic in Computer Science</topic><toplevel>online_resources</toplevel><creatorcontrib>Bourgaux, Camille</creatorcontrib><creatorcontrib>Carral, David</creatorcontrib><creatorcontrib>Krötzsch, Markus</creatorcontrib><creatorcontrib>Rudolph, Sebastian</creatorcontrib><creatorcontrib>Thomazo, Michaël</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bourgaux, Camille</au><au>Carral, David</au><au>Krötzsch, Markus</au><au>Rudolph, Sebastian</au><au>Thomazo, Michaël</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Capturing Homomorphism-Closed Decidable Queries with Existential Rules</atitle><date>2021-07-16</date><risdate>2021</risdate><abstract>Existential rules are a very popular ontology-mediated query language for
which the chase represents a generic computational approach for query
answering. It is straightforward that existential rule queries exhibiting chase
termination are decidable and can only recognize properties that are preserved
under homomorphisms. In this paper, we show the converse: every decidable query
that is closed under homomorphism can be expressed by an existential rule set
for which the standard chase universally terminates. Membership in this
fragment is not decidable, but we show via a diagonalisation argument that this
is unavoidable.</abstract><doi>10.48550/arxiv.2107.07811</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2107.07811 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2107_07811 |
| source | arXiv.org |
| subjects | Computer Science - Databases Computer Science - Logic in Computer Science |
| title | Capturing Homomorphism-Closed Decidable Queries with Existential Rules |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T19%3A30%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Capturing%20Homomorphism-Closed%20Decidable%20Queries%20with%20Existential%20Rules&rft.au=Bourgaux,%20Camille&rft.date=2021-07-16&rft_id=info:doi/10.48550/arxiv.2107.07811&rft_dat=%3Carxiv_GOX%3E2107_07811%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |