Type-elimination-based reasoning for the description logic SHIQb_s using decision diagrams and disjunctive Datalog
From MaRDI portal
Publication:2881079
Abstract: We propose a novel, type-elimination-based method for reasoning in the description logic SHIQbs including DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) which represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst case optimal w.r.t. combined and data complexity and easily admits extensions with ground conjunctive queries.
Recommendations
- Reasoning in description logics by a reduction to disjunctive datalog
- scientific article; zbMATH DE number 1614719
- OBDD-based reasoning for terminological cycles of the description logic \(\mathcal{EL}\)
- Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
- Deciding expressive description logics in the framework of resolution
Cited in
(4)- Reasoning in description logics by a reduction to disjunctive datalog
- scientific article; zbMATH DE number 1614719 (Why is no real title available?)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- OBDD-based reasoning for terminological cycles of the description logic \(\mathcal{EL}\)
This page was built for publication: Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2881079)
