Fast query answering over existential rules

DOI10.1145/3308448zbMATH Open1433.68432OpenAlexW2926816154WikidataQ128203649 ScholiaQ128203649MaRDI QIDQ5222877FDOQ5222877

Authors: N. Leone, G. Terracina, Pierfrancesco Veltri, M. 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

Recommendations

• Finite model reasoning over existential rules
• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• Combining decidability paradigms for existential rules
• Towards more expressive ontology languages: the query answering problem
• Rewriting guarded existential rules into small Datalog programs

zbMATH Keywords

Datalogexistential rulesontology-based query answering

Mathematics Subject Classification ID

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

Cited In (9)

• Intelligent query answering in rule based systems
• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
• DaRLing: A Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
• On rules with existential variables: walking the decidability line
• Semi-oblivious chase termination: the sticky case
• Answer Counting under Guarded TGDs
• Polynomial combined first-order rewritings for linear and guarded existential rules
• Preference-based inconsistency-tolerant query answering under existential rules

This page was built for publication: Fast query answering over existential rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222877)