Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable
From International Center for Computational Logic
Ontology-Based Query Answering over Datalog-Expressible Rule Sets is Undecidable
Talk by David Carral
- Location: APB 3027
- Start: 19. November 2026 at 11:00 am
- End: 19. November 2026 at 12:00 pm
- Research group: Knowledge-Based Systems
- Event series: Research Seminar Logic and AI
- iCal
Ontology-based query answering takes as input an ontology R (typically given by existential rules), a set F of facts, and a Boolean conjunctive query q, and asks whether R, F ⊨ q. This problem is undecidable in general, and a widely studied way of dealing with it in specific cases is query rewriting: given a rule query (R, q), we compute a Boolean query qR such that, for every fact set F, we have that (R, F) ⊨ q if and only if F ⊨ qR.