Reasoning in description logics by a reduction to disjunctive datalog
From MaRDI portal
Publication:2462648
Recommendations
- Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
- scientific article; zbMATH DE number 1614719
- Efficient description logic reasoning in Prolog: The DLog system
- Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
Cites work
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
- A Resolution-Based Decision Procedure for $\mathcal{SHOIQ}$
- A structure-preserving clause form translation
- Automated Reasoning
- Basic paramodulation
- Computing small clause normal forms
- Data complexity of query answering in description logics
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1182733 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 1765662 (Why is no real title available?)
- scientific article; zbMATH DE number 1765711 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Logic Programming
- Logic Programming and Nonmonotonic Reasoning
- Normal form transformations
- On the power of magic
- Practical reasoning for very expressive description logics
- PSpace reasoning for graded modal logics
- Term Rewriting and All That
- Theorem proving with ordering and equality constrained clauses
Cited in
(27)- Magic sets for disjunctive Datalog programs
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Answering regular path queries in expressive description logics via alternating tree-automata
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog
- Maintenance of datalog materialisations revisited
- Query inseparability for \(\mathcal{ALC}\) ontologies
- Absorption for ABoxes
- Data-complexity of the two-variable fragment with counting quantifiers
- scientific article; zbMATH DE number 1614719 (Why is no real title available?)
- scientific article; zbMATH DE number 1696851 (Why is no real title available?)
- Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
- Type-elimination-based reasoning for the description logic \(\mathcal {SHIQ}b_s\) using decision diagrams and disjunctive Datalog
- Inseparability and conservative extensions of description logic ontologies: a survey
- Rewriting guarded existential rules into small Datalog programs
- scientific article; zbMATH DE number 4166936 (Why is no real title available?)
- Disjunction in modal description logics
- Extending Carin to the Description Logics of the $\mathcal{SH}$ Family
- The role of semantics in mining frequent patterns from knowledge bases in description logics with rules
- Peer-to-peer reasoning for interlinked ontologies
- View-based query answering in description logics: semantics and complexity
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots
- Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions
- Reasoning with uncertain and inconsistent OWL ontologies
- Prolog Based Description Logic Reasoning
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates
- Semantic web
This page was built for publication: Reasoning in description logics by a reduction to disjunctive datalog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2462648)
