Loop restricted existential rules and first-order rewritability for query answering

DOI10.1093/LOGCOM/EXAB078MaRDI QIDQ6636650zbMATH OpenFDO

Authors Vernon Asuncion, Yan Zhang, Heng Zhang, Yun Bai

Publication date 12 November 2024

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAB078

zbMATH Keywords

complexityknowledge representationlogic programmingontological reasoningquery answering

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Knowledge representation (68T30)

Recommendations

• Mixing materialization and query rewriting for existential rules
• Polynomial combined first-order rewritings for linear and guarded existential rules
• The price of query rewriting in ontology-based data access
• Towards more expressive ontology languages: the query answering problem
• Rewriting guarded existential rules into small Datalog programs

This page was built for publication: Loop restricted existential rules and first-order rewritability for query answering

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