Precomputing Datalog Evaluation Plans in Large-Scale Scenarios
From MaRDI portal
Publication:5108523
DOI10.1017/S147106841900036XzbMath1434.68143arXiv1907.12495WikidataQ127174339 ScholiaQ127174339MaRDI QIDQ5108523
Alessio Fiorentino, Simona Perri, Nicola Leone, Jessica Zangari, Marco Manna
Publication date: 4 May 2020
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.12495
Uses Software
Cites Work
- Unnamed Item
- Magic sets for disjunctive Datalog programs
- Memory-saving evaluation plans for Datalog
- The ASP system DLV2
- Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice
- Optimizing Answer Set Computation via Heuristic-Based Decomposition
- Efficiently Coupling the I-DLV Grounder with ASP Solvers
- ASP-Core-2 Input Language Format