A Non-standard Instance Checking for the Description Logic ELH
Suwan Tongphu, Boontawee Suntisrivaraporn · 2014
In Description Logics (DLs), an instance checking is regarded as one of the most important reasoning services involving individuals. Though the usability of the reasoner has been seemingly proven in many real-life applications, the classified results are merely a binary response, i.e. whether or not a given individual is an instance of a concept. As being a standard reasoning service, unsatisfying one among all sufficient conditions would basically lead to a negative conclusion. This work introduces a new method to enhance the capability of the instance checking in which the degree of membership could be unveiled though sufficient conditions are not completely satisfied. The proposed algorithm is developed based on the adoption of a homomorphism mapping.