A Proposal for a Glass-Box Approach for Subsumption Checking
Quentin Elhaik, Marie-Christine Rousset, Marie-Claude Gaudel · 1996
Description logics have good representational prop-erties and their computational properties are well understood. However, one of their main drawback is that their current reasoning algorithms have an inherent black-box nature, i.e they don’t make ex-plicit how subsumption inferences are obtained. This is an important drawback for providing ex-planation or debugging services. Description logics with a reasonable expressive power contain different constructors the combination of which can lead to numerous, complex and varied forms of subsump-tion relation. Consequently, some subsumption re-lations are complex and need to be explained to a user or to a terminology designer. The point is not to explain to users or designers how subsumption