Modular materialisation of Datalog programs
From MaRDI portal
Publication:2144176
DOI10.1016/J.ARTINT.2022.103726zbMATH Open1495.68049arXiv1811.02304OpenAlexW2899960748MaRDI QIDQ2144176FDOQ2144176
Authors: Pan Hu, Boris Motik, Ian Horrocks 
Publication date: 1 June 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Abstract: The semina"ive algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the input facts change. Certain (combinations of) rules, however, can be handled much more efficiently using custom algorithms. To integrate such algorithms into a general reasoning approach that can handle arbitrary rules, we propose a modular framework for materialisation computation and its maintenance. We split a datalog program into modules that can be handled using specialised algorithms, and handle the remaining rules using the semina"ive algorithm. We also present two algorithms for computing the transitive and the symmetric-transitive closure of a relation that can be used within our framework. Finally, we show empirically that our framework can handle arbitrary datalog programs while outperforming existing approaches, often by orders of magnitude.
Full work available at URL: https://arxiv.org/abs/1811.02304
Recommendations
Cites Work
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Title not available (Why is that?)
- Semantics and complexity of recursive aggregates in answer set programming
- Decidability of SHIQ with complex role inclusion axioms
- Nonrecursive incremental evaluation of Datalog queries
- Title not available (Why is that?)
- On the declarative and procedural semantics of logic programs
- Monotonic aggregation in deductive databases
- Pure grammars
- Title not available (Why is that?)
- The parallel complexity of simple logic programs
- Parallel bottom-up processing of datalog queries
- On-line computation of transitive closures of graphs
- Programming Languages and Systems
- Query languages for bags and aggregate functions
- Dyn-FO: A parallel, dynamic complexity class
- Maintenance of datalog materialisations revisited
- Datalog and recursive query processing
- The deductive database system [Lscr ][Dscr ][Lscr ]++
- An extension of complex role inclusion axioms in the description logic \(\mathcal{SROIQ}\)
Cited In (7)
- Modern Datalog Engines
- Efficient model construction for Horn logic with VLog (system description)
- Maintenance of datalog materialisations revisited
- Finite Materialisability of Datalog Programs with Metric Temporal Operators
- Journal on Data Semantics II
- Title not available (Why is that?)
- Modular stratification and magic sets for Datalog programs with negation
Uses Software
This page was built for publication: Modular materialisation of Datalog programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144176)
