Optimizing description logic subsumption

DOI10.1093/logcom/9.3.267zbMath0940.03038OpenAlexW2126755595MaRDI QIDQ4260083

Peter F. Patel-Schneider, Ian Horrocks

Publication date: 7 September 1999

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/9.3.267

zbMATH Keywords

optimizationknowledge representationdescription logicpropositional modal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic in computer science (03B70)

Related Items (20)

OWL reasoning: subsumption test hardness and modularity ⋮ ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching ⋮ A tableau algorithm for description logics with concrete domains and general TBoxes ⋮ One-Pass Tableaux for Computation Tree Logic ⋮ Symmetric blocking ⋮ An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description) ⋮ Reasoning on UML class diagrams ⋮ Optimizing terminological reasoning for expressive description logics ⋮ A tableau decision procedure for \(\mathcal{SHOIQ}\) ⋮ Automata can show PSpace results for description logics ⋮ A goal-directed implementation of query answering for hybrid MKNF knowledge bases ⋮ Global Caching for Coalgebraic Description Logics ⋮ A Tableau Calculus for Regular Grammar Logics with Converse ⋮ An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability ⋮ A prover dealing with nominals, binders, transitivity and relation hierarchies ⋮ CoLoSS: The Coalgebraic Logic Satisfiability Solver ⋮ An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability ⋮ ExpTime tableau decision procedures for regular grammar logics with converse ⋮ EXPtime tableaux for ALC ⋮ Unnamed Item

This page was built for publication: Optimizing description logic subsumption