Account
Edit tools
Intern
SucheSearch
English

Proceedings3022: Unterschied zwischen den Versionen

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche
Larry Gonzalez (Diskussion | Beiträge)
(Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Larry |ErsterAutorNachname=Gonzalez |FurtherAuthors=Alex Ivliev; Stephan Mennicke; Markus Krötzsch }} {{Proceed…“)
 
Larry Gonzalez (Diskussion | Beiträge)
Keine Bearbeitungszusammenfassung
 
(11 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt)
Zeile 1: Zeile 1:
{{Publikation Erster Autor
{{Publikation Erster Autor
|ErsterAutorVorname=Larry
|ErsterAutorVorname=Larry
|ErsterAutorNachname=Gonzalez
|ErsterAutorNachname=González
|FurtherAuthors=Alex Ivliev; Stephan Mennicke; Markus Krötzsch
|FurtherAuthors=Alex Ivliev; Stephan Mennicke; Markus Krötzsch
}}
}}
{{Proceedings
{{Inproceedings
|Title=15th Alberto Meldenzon International Workshop on Foundations of Data Management
|Referiert=1
|Title=Efficient Dependency Analysis for Existential Rules
|To appear=0
|To appear=0
|Year=2023
|Year=2023
|Month=Mai
|Booktitle=Proceedings of the 15th Alberto Meldenzon International Workshop on Foundations of Data Management (AMW'23). Santiago, Chile
|Publisher=CEUR-WS.org
|Editor=Benny Kimelfeld, Maria Vanina Martinez, Renzo Angles
|Series=CEUR Workshop Proceedings
|Volume=3409
|Note=This is an extended abstract of the full [[Inproceedings3338|ISWC 2022 publication]].
}}
}}
{{Publikation Details
{{Publikation Details
|Abstract=This short paper reviews the main contributions of our recent work on static analysis of existential rules (a.k.a. tuple-generating dependencies). Between such rules, several kinds of logical relationships -- also called dependencies in an unfortunate clash of terminology -- are of interest, but their computation highly intractable. We develop new, optimised procedures for this task, and present a prototype implementation that scales to real-world inputs of more than 100,000 rules. This allows us to perform much faster acyclicity checks and to identify rule sets that admit efficient core computation via the standard chase.
|Abstract=This short paper reviews the main contributions of our recent work on static analysis of existential rules (a.k.a. tuple-generating dependencies). Between such rules, several kinds of logical relationships -- also called dependencies in an unfortunate clash of terminology -- are of interest, but their computation highly intractable. We develop new, optimised procedures for this task, and present a prototype implementation that scales to real-world inputs of more than 100,000 rules. This allows us to perform much faster acyclicity checks and to identify rule sets that admit efficient core computation via the standard chase.
|Download=Amw23-efficient-dependency-analysis.pdf
|Download=Amw2023-efficient-dependency-analysis-for-existential-rules.pdf
|Projekt=CPEC, InnoSale, KIMEDS, SECAI, ScaDS.AI, Cfaed
|Link=https://iccl.inf.tu-dresden.de/web/Inproceedings3338
|Projekt=Cfaed, CPEC, InnoSale, KIMEDS, SECAI, ScaDS.AI
|Forschungsgruppe=Wissensbasierte Systeme
|Forschungsgruppe=Wissensbasierte Systeme
}}
}}

Aktuelle Version vom 16. August 2024, 10:18 Uhr

Toggle side column
Larry González, Alex Ivliev, Stephan Mennicke, Markus Krötzsch
Efficient Dependency Analysis for Existential Rules
In Benny Kimelfeld, Maria Vanina Martinez, Renzo Angles, eds., Proceedings of the 15th Alberto Meldenzon International Workshop on Foundations of Data Management (AMW'23). Santiago, Chile, volume 3409 of CEUR Workshop Proceedings, 2023. CEUR-WS.org
  • KurzfassungAbstract
    This short paper reviews the main contributions of our recent work on static analysis of existential rules (a.k.a. tuple-generating dependencies). Between such rules, several kinds of logical relationships -- also called dependencies in an unfortunate clash of terminology -- are of interest, but their computation highly intractable. We develop new, optimised procedures for this task, and present a prototype implementation that scales to real-world inputs of more than 100,000 rules. This allows us to perform much faster acyclicity checks and to identify rule sets that admit efficient core computation via the standard chase.
  • Bemerkung: Note: This is an extended abstract of the full ISWC 2022 publication.
  • Weitere Informationen unter:Further Information: Link
  • Projekt:Project: Cfaed, CPEC, InnoSale, KIMEDS, SECAI, ScaDS.AI
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@inproceedings{GIMK2023,
  author    = {Larry Gonz{\'{a}}lez and Alex Ivliev and Stephan Mennicke and
               Markus Kr{\"{o}}tzsch},
  title     = {Efficient Dependency Analysis for Existential Rules},
  editor    = {Benny Kimelfeld and Maria Vanina Martinez and Renzo Angles},
  booktitle = {Proceedings of the 15th Alberto Meldenzon International Workshop
               on Foundations of Data Management (AMW'23). Santiago, Chile},
  series    = {CEUR Workshop Proceedings},
  volume    = {3409},
  publisher = {CEUR-WS.org},
  year      = {2023}
}
Abgerufen von „https://iccl.inf.tu-dresden.de/w/index.php?title=Proceedings3022&oldid=40034“