Inproceedings3307: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Maximilian Marx (Diskussion | Beiträge)
(Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Maximilian |ErsterAutorNachname=Marx |FurtherAuthors=Markus Krötzsch }} {{Inproceedings |Referiert=1 |Title=Tup…“)
 
Maximilian Marx (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
 
(2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 7: Zeile 7:
|Referiert=1
|Referiert=1
|Title=Tuple-Generating Dependencies Capture Complex Values
|Title=Tuple-Generating Dependencies Capture Complex Values
|To appear=1
|To appear=0
|Year=2022
|Year=2022
|Month=März
|Month=März
|Booktitle=Proceedings of the 22nd International Conference on Database Theory (ICDT 2022)
|Booktitle=Proceedings of the 25th International Conference on Database Theory (ICDT 2022)
|Pages=19:1--19:20
|Pages=13:1--13:20
|Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|Publisher=Schloss Dagstuhl - Leibniz-Zentrum für Informatik
|Editor=Dan Olteanu, Nils Vortmeier
|Editor=Dan Olteanu, Nils Vortmeier
Zeile 19: Zeile 19:
{{Publikation Details
{{Publikation Details
|Abstract=We formalise a variant of Datalog that allows complex values constructed by nesting elements of the input database in sets and tuples. We study its complexity and give a translation into sets of tuple-generating dependencies (TGDs) for which the standard chase terminates on any input database. We identify a fragment for which reasoning is tractable. As membership is undecidable for this fragment, we develop decidable sufficient conditions.
|Abstract=We formalise a variant of Datalog that allows complex values constructed by nesting elements of the input database in sets and tuples. We study its complexity and give a translation into sets of tuple-generating dependencies (TGDs) for which the standard chase terminates on any input database. We identify a fragment for which reasoning is tractable. As membership is undecidable for this fragment, we develop decidable sufficient conditions.
|ISBN=978-3-95977-223-5
|ISSN=1868-8969
|Download=mk2022-complex-values.pdf
|Download=mk2022-complex-values.pdf
|Slides=mk2022-complex-values-slides.pdf
|DOI Name=10.4230/LIPIcs.ICDT.2022.13
|Projekt=CPEC, ScaDS.AI, Cfaed
|Projekt=CPEC, ScaDS.AI, Cfaed
|Forschungsgruppe=Wissensbasierte Systeme
|Forschungsgruppe=Wissensbasierte Systeme
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Datenbanktheorie
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Existenzielle Regeln
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Wissensrepräsentation und logisches Schließen
}}
{{Forschungsgebiet Auswahl
|Forschungsgebiet=Regelbasiertes Schließen
}}
}}

Aktuelle Version vom 1. April 2022, 15:04 Uhr

Toggle side column

Tuple-Generating Dependencies Capture Complex Values

Maximilian MarxMaximilian Marx,  Markus KrötzschMarkus Krötzsch
Tuple-Generating Dependencies Capture Complex Values


Slides: Tuple-Generating Dependencies Capture Complex Values

Maximilian Marx, Markus Krötzsch
Tuple-Generating Dependencies Capture Complex Values
In Dan Olteanu, Nils Vortmeier, eds., Proceedings of the 25th International Conference on Database Theory (ICDT 2022), volume 220 of LIPIcs, 13:1--13:20, March 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik
  • KurzfassungAbstract
    We formalise a variant of Datalog that allows complex values constructed by nesting elements of the input database in sets and tuples. We study its complexity and give a translation into sets of tuple-generating dependencies (TGDs) for which the standard chase terminates on any input database. We identify a fragment for which reasoning is tractable. As membership is undecidable for this fragment, we develop decidable sufficient conditions.
  • Projekt:Project: CPECScaDS.AICfaed
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{MK2022,
  author    = {Maximilian Marx and Markus Kr{\"{o}}tzsch},
  title     = {Tuple-Generating Dependencies Capture Complex Values},
  editor    = {Dan Olteanu and Nils Vortmeier},
  booktitle = {Proceedings of the 25th International Conference on Database
               Theory (ICDT 2022)},
  series    = {LIPIcs},
  volume    = {220},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2022},
  month     = {March},
  pages     = {13:1--13:20},
  doi       = {10.4230/LIPIcs.ICDT.2022.13}
}