Exploiting pseudo models for TBox and ABox reasoning in expressive description logics
From MaRDI portal
Recommendations
- Abox satisfiability reduced to terminological reasoning in expressive description logics
- Extending the description logic \(\tau\mathcal{EL}(\deg)\) with acyclic TBoxes
- Reasoning About Actions Using Description Logics with General TBoxes
- ABox abduction in the description logic \(\mathcal{ALC}\)
- Reasoning with expressive description logics: Theory and practice
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Practical reasoning for expressive description logics
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes
- Practical reasoning for very expressive description logics
Cited in
(10)- On the scalability of description logic instance retrieval
- OWL reasoning: subsumption test hardness and modularity
- Optimizing terminological reasoning for expressive description logics
- Reasoning in description logics by a reduction to disjunctive datalog
- Extended caching, backjumping and merging for expressive description logics
- Optimizing description logic subsumption
- Matching in the Description Logic FL0 with respect to General TBoxes
- Incremental reasoning on monadic second-order logics with logic programming
- Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
- Classical algorithms for reasoning and explanation in description logics
This page was built for publication: Exploiting pseudo models for TBox and ABox reasoning in expressive description logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539598)
