Research on the Least Common Subsumer in Description Logic εLN
Wang Ju · Computer Engineering and Science · 2012
Nonstandard inference is a new inference service in description logic,which was proposed at the turn of the century.It mainly includes the most specific concept,the least common subsumer,matching problem,concept rewriting and so on.Nonstandard inference aims to deal with the construction and management of the knowledge base and some other problems which researchers have to face in applications.Nonstandard inference can support the bottom-up construction method,as the description logic is widely applied in other areas,the knowledge base construction and management is more and more critical and inevitable,but the standard inference almost cannot provide any help.So the nonstandard inference becomes a main issue which researchers are focusing on in recent years.In this paper the fundamentality of nonstandard inference in description logic,especially the current research progress and existing problem of the LCS(least common subsumer) inference in description logic are analyzed.Aiming to the insufficiency of the LCS inference which cannot handle existential restriction and number restriction at the same time,the LCS inference in description logic eLN is studied.Firstly the eLN-description tree and its homomorphism are defined,a subsumption algorithm is presented by computing the homomorphism between two description trees.Then the product of description trees is defined and the LCS inference algorithm is presented by computing the product of description trees.The complexity of the LCS inference algorithm in eLN is polynomial.