Tampere University of Technology

TUTCRIS Research Portal

Rewritability in monadic disjunctive Datalog, Mmsnp, and expressive description logics

Research output: Contribution to journalArticleScientificpeer-review


Original languageEnglish
Pages (from-to)15:1-15:46
JournalLogical Methods in Computer Science
Issue number2
Publication statusPublished - 2019
Publication typeA1 Journal article-refereed


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 case of MMSNP correspond to obstructions, and give a new construction of canonical Datalog programs that is more elementary than existing ones and also applies to non-Boolean queries.


  • FO-Rewritability, MDDLog, MMSNP, Monadic Datalog-Rewritability, OMQ

Publication forum classification

Field of science, Statistics Finland