Optimizing description logic subsumption
From MaRDI portal
Recommendations
Cited in
(26)- On the scalability of description logic instance retrieval
- Automated deduction techniques for classification in description logic systems
- EXPtime tableaux for ALC
- OWL reasoning: subsumption test hardness and modularity
- A prover dealing with nominals, binders, transitivity and relation hierarchies
- Reasoning on UML class diagrams
- Optimizing terminological reasoning for expressive description logics
- A tableau decision procedure for \(\mathcal{SHOIQ}\)
- Extended caching, backjumping and merging for expressive description logics
- One-Pass Tableaux for Computation Tree Logic
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
- scientific article; zbMATH DE number 1222434 (Why is no real title available?)
- Parallel symmetric class expression learning
- CoLoSS: the coalgebraic logic satisfiability solver
- An on-the-fly tableau-based decision procedure for PDL-satisfiability
- A Tableau Calculus for Regular Grammar Logics with Converse
- An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability
- A genetic algorithm for optimization of a relational knapsack problem with respect to a description logic knowledge base
- A goal-directed implementation of query answering for hybrid MKNF knowledge bases
- Global caching for coalgebraic description logics
- Optimized description logic reasoning via core blocking
- ExpTime tableau decision procedures for regular grammar logics with converse
- A tableau algorithm for description logics with concrete domains and general TBoxes
- Symmetric blocking
- Automata can show PSpace results for description logics
This page was built for publication: Optimizing description logic subsumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4260083)
