Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

January 03, 2017 · The Ethereal · 🏛 International Conference on Database Theory

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Cristina Feier, Antti Kuusisto, Carsten Lutz arXiv ID 1701.02231 Category cs.LO: Logic in CS Cross-listed cs.CC, cs.DB Citations 39 Venue International Conference on Database Theory Last Checked 2 months ago

Abstract

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of the ALC family and on conjunctive queries. We show that rewritability into FO and into monadic Datalog (MDLog) are decidable, and that rewritability into Datalog is decidable when the original query satisfies a certain condition related to equality. We establish 2NExpTime-completeness for all studied problems except rewritability into MDLog for which there remains a gap between 2NExpTime and 3ExpTime. We also analyze the shape of rewritings, which in the MMSNP case correspond to obstructions, and give a new construction of canonical Datalog programs that is more elementary than existing ones and also applies to formulas with free variables.