Fast Query Answering over Existential Rules

DOI10.1145/3308448zbMath1433.68432OpenAlexW2926816154WikidataQ128203649 ScholiaQ128203649MaRDI QIDQ5222877

Nicola Leone, Giorgio Terracina, Pierfrancesco Veltri, Marco Manna

Publication date: 4 July 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3308448

zbMATH Keywords

Datalogexistential rulesontology-based query answering

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (4)

Answer Counting under Guarded TGDs ⋮ Polynomial combined first-order rewritings for linear and guarded existential rules ⋮ DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries ⋮ Semi-oblivious chase termination: the sticky case

This page was built for publication: Fast Query Answering over Existential Rules