OWL reasoning: subsumption test hardness and modularity

DOI10.1007/s10817-017-9414-8zbMath1398.68518OpenAlexW2620948727WikidataQ59614267 ScholiaQ59614267MaRDI QIDQ1655485

Nicolas Matentzoglu, Bijan Parsia, Uli Sattler

Publication date: 9 August 2018

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc6044258

zbMATH Keywords

modulesreasoningontologiesOWLsubsumption testing

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

ReAD: AD-based modular ontology classification

Uses Software

• Pellet
• FaCT++
• Konclude
• Chainsaw
• BioPortal
• Snorocket

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Konclude
• The OWL reasoner evaluation (ORE) 2015 competition report
• HermiT: an OWL 2 reasoner
• Extended Caching, Backjumping and Merging for Expressive Description Logics
• Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures
• Optimizing description logic subsumption
• The Description Logic Handbook