Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
From MaRDI portal
(Redirected from Publication:286087)
Recommendations
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Tractable reasoning with DL-programs over Datalog-rewritable description logics
- Rewriting guarded existential rules into small Datalog programs
- The price of query rewriting in ontology-based data access
Cites work
- scientific article; zbMATH DE number 140388 (Why is no real title available?)
- scientific article; zbMATH DE number 978240 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 3254919 (Why is no real title available?)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- An observation on time-storage trade off
- Complexities of Horn description logics
- Engineering an Incremental ASP Solver
- Foundations of Rule-Based Query Answering
- Linearisability on Datalog programs
- Magic sets for disjunctive Datalog programs
- Manifold answer-set programs and their applications
- More on tractable disjunctive Datalog
- On the complexity of ontological reasoning under disjunctive existential rules
- On the complexity of single-rule datalog queries.
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Practical reasoning for very expressive description logics
- Propositional semantics for disjunctive logic programs
- Reasoning in description logics by a reduction to disjunctive datalog
- Reasoning with minimal models: efficient algorithms and applications
- Resolution theorem proving
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The DL-Lite Family and Relations
- The DLV system for knowledge representation and reasoning
- The loop absorption and the generalization strategies for the development of logic programs and partial deduction
- Tractable query answering and rewriting under description logic constraints
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Tractable reasoning with DL-programs over Datalog-rewritable description logics
- Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
- Unfold/fold transformations for disjunctive logic programs
Cited in
(10)- Tractable reasoning with DL-programs over Datalog-rewritable description logics
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Defining Datalog in Rewriting Logic
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).
- Maintenance of datalog materialisations revisited
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- Rewriting guarded existential rules into small Datalog programs
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
This page was built for publication: Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286087)
