Efficient Dependency Analysis for Existential Rules

From International Center for Computational Logic

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: CfaedCPECInnoSaleKIMEDSSECAIScaDS.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}
}