Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
From MaRDI portal
Publication:3174890
Recommendations
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Rewriting logic and its applications (extended selected papers from WRLA 2014)
- Rewriting logic and its applications (extended selected papers from WRLA 2014)
- Tractable reasoning with DL-programs over Datalog-rewritable description logics
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- scientific article; zbMATH DE number 1615226
- Rewrite rule systems for modal propositional logic
Cited in
(9)- A dichotomy for first-order reducts of unary structures
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- The data complexity of ontology-mediated queries with closed predicates
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- The language of stratified sets is confluent and strongly normalising
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Rewriting guarded existential rules into small Datalog programs
- Emptiness problems for distributed automata
This page was built for publication: Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174890)