|
|
| Zeile 1: |
Zeile 1: |
| {{Publikation Erster Autor
| | #REDIRECT[[Article3100]] |
| |ErsterAutorVorname=Philipp
| |
| |ErsterAutorNachname=Hanisch
| |
| |FurtherAuthors=Markus Krötzsch
| |
| }}
| |
| {{Article
| |
| |Referiert=1
| |
| |Title=Chase Termination Beyond Polynomial Time
| |
| |To appear=0
| |
| |Year=2024
| |
| |Month=Mai
| |
| |Journal=Proc. ACM Manag. Data
| |
| |Volume=2
| |
| |Number=2
| |
| |Pages=93
| |
| |Publisher=Association for Computing Machinery
| |
| }}
| |
| {{Publikation Details
| |
| |Abstract=The chase is a widely implemented approach to reason with tuple-generating dependencies (tgds), used in data exchange, data integration, and ontology-based query answering. However, it is merely a semi-decision procedure, which may fail to terminate. Many decidable conditions have been proposed for tgds to ensure chase termination, typically by forbidding some kind of “cycle” in the chase process. We propose a new criterion that explicitly allows some such cycles, and yet ensures termination of the standard chase under reasonable conditions. This leads to new decidable fragments of tgds that are not only syntactically more general but also strictly more expressive than the fragments defined by prior acyclicity conditions. Indeed, while known terminating fragments are restricted to PTime data complexity, our conditions yield decidable
| |
| languages for any 𝑘-ExpTime. We further refine our syntactic conditions to obtain fragments of tgds for which an optimised chase procedure decides query entailment in PSpace or 𝑘-ExpSpace, respectively.
| |
| |Download=Chase Termination Beyond Polynomial Time.pdf
| |
| |Slides=Chase Termination Beyond Polynomial Time PODS Slides.pdf
| |
| |DOI Name=https://doi.org/10.1145/3651594
| |
| |Projekt=Cfaed, CPEC, SECAI, ScaDS.AI
| |
| |Forschungsgruppe=Wissensbasierte Systeme
| |
| }}
| |
