Modular materialisation of Datalog programs

DOI10.1016/j.artint.2022.103726zbMath1495.68049arXiv1811.02304OpenAlexW2899960748MaRDI QIDQ2144176

Ian Horrocks, Boris Motik, Pan Hu

Publication date: 1 June 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.02304

zbMATH Keywords

Datalogincremental reasoningmaterialisation

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Uses Software

• WebPIE
• swrl
• LUBM
• Datalog
• Lixto
• Dyna
• Binder
• Vadalog
• RDFox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Monotonic aggregation in deductive databases
• Decidability of SHIQ with complex role inclusion axioms
• On-line computation of transitive closures of graphs
• Dyn-FO: A parallel, dynamic complexity class
• Query languages for bags and aggregate functions
• On the declarative and procedural semantics of logic programs
• Nonrecursive incremental evaluation of Datalog queries
• Maintenance of datalog materialisations revisited
• Datalog and Recursive Query Processing
• Pure grammars
• Parallel bottom-up processing of datalog queries
• The parallel complexity of simple logic programs
• The well-founded semantics for general logic programs
• The deductive database system [Lscr [Dscr ][Lscr ]++]
• Programming Languages and Systems
• An Extension of Complex Role Inclusion Axioms in the Description Logic $\mathcal{SROIQ}$

This page was built for publication: Modular materialisation of Datalog programs