By Topic

Knowledge reasoning and Tableau Algorithm improving based on rough description logics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hongcan Yan ; Science College, Hebei United University, Tangshan, China, 063000 ; Chen Liu ; Baoxiang Liu

The knowledge base of description logics are composed of two parts TBox and ABox. Tableau Algorithm is for the uniformity testing in the knowledge reasoning of DLs, which is based on two-value logics, it can not realize the uniformity testing for multiple-valued concepts. This paper take the fundamental ideal to the system of DLs, improving Tableau Algorithm through the definition of rough concept implication degree, and by using rough concept express related concepts and relationships in the TBbox, The rough description logics can be completed on the reasoning of rough concept, laying the foundation for knowledge base inference engine design.

Published in:

Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference:

29-31 May 2012