Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).

DOI10.4230/LIPIcs.ICDT.2017.1zbMath1402.68046OpenAlexW2604510960MaRDI QIDQ3174890

Antti Kuusisto, Carsten Lutz, Cristina Feier

Publication date: 18 July 2018

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICDT.2017.1

zbMATH Keywords

description logicMMSNPFO-rewritabilityMDDLogontology mediated queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (6)

Unnamed Item ⋮ Emptiness problems for distributed automata ⋮ A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP ⋮ Unnamed Item ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ Unnamed Item

This page was built for publication: Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).