To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward...To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.展开更多
基金国家教育部博士点基金(the Fund for the Doctoral Program of the Ministry of Education of China under Grant No.20050359004)国家教育部新世纪优秀人才计划项目(the New Century Excellent Talent Foundation from MOE of China under Grant No.NCET-04-050562)安徽省科技公关计划项目(the Key Technologies R&D Program of Anhui Province, China under Grant No.06012069B)
基金The National Natural Science Foundation of China(No.69975010,60374054),the National Research Foundation for the Doctoral Program of Higher Education of China (No.20050007023).
文摘To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph （AG）, which is directed labeled graph, is defined and a new AG-based retrieval method is put forward. This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval. The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%. This method can obviously promote the efficiency of knowledge base retrieval.
