Enhancing datalog reasoning with hypertree decompositions
Datalog reasoning based on the seminaïve evaluation strategy evaluates rules using traditional join plans, which often leads to redundancy and inefficiency in practice, especially when the rules are complex. Hypertree decompositions help identify efficient query plans and reduce similar redundancy i...
Egile Nagusiak: | Zhang, X, Hu, P, Nenov, Y, Horrocks, I |
---|---|
Formatua: | Conference item |
Hizkuntza: | English |
Argitaratua: |
International Joint Conferences on Artificial Intelligence
2023
|
Antzeko izenburuak
-
Optimised storage for datalog reasoning
nork: Zhang, X, et al.
Argitaratua: (2024) -
Pay−as−you−go ontology query answering using a datalog reasoner
nork: Zhou, Y, et al.
Argitaratua: (2014) -
Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning
nork: Kaminski, M, et al.
Argitaratua: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
nork: Kaminski, M, et al.
Argitaratua: (2014) -
Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning
nork: Kaminski, M, et al.
Argitaratua: (2014)