Datalog rewriting for Guarded TGDs
We deal with the problem of fact entailment with respect to a database and a set of integrity constraints, focusing on the case of Guarded tuple-generating dependencies (GTGDs). The original approach to the problem in the literature is via forward reasoning or "chasing", where one complete...
Главные авторы: | Benedikt, M, Buron, M, Germano, S, Kappelmann, K, Motik, B |
---|---|
Формат: | Conference item |
Язык: | English |
Опубликовано: |
CEUR Workshop Proceedings
2022
|
Схожие документы
-
Rewriting the infinite chase for guarded TGDs
по: Benedikt, M, и др.
Опубликовано: (2024) -
Rewriting the infinite chase
по: Benedikt, M, и др.
Опубликовано: (2022) -
Answer Counting under Guarded TGDs
по: Cristina Feier, и др.
Опубликовано: (2023-09-01) -
Small Datalog Query Rewritings for EL
по: Stefanoni, G, и др.
Опубликовано: (2012) -
Computing Datalog Rewritings Beyond Horn Ontologies
по: Grau, B, и др.
Опубликовано: (2013)