Reasoning with rough description logics: An approximate concepts approach

  • Authors:

  • Yuncheng Jiang;Ju Wang;Suqin Tang;Bao Xiao

  • Affiliations:

  • School of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, PR China;School of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, PR China;School of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, PR China;School of Computer Science and Information Technology, Guangxi Normal University, Guilin 541004, PR China

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

The current research progress and the existing problems of uncertain or imprecise knowledge representation and reasoning in description logics are analyzed in this paper. Approximate concepts are introduced to description logics based on rough set theory, and a kind of new rough description logic RDL"A"C (rough description logic based on approximate concepts) is proposed based on approximate concepts. The syntax, semantics and properties of the RDL"A"C are given. It is proved that the approximate concept satisfiability (definitely satisfiability and possibly satisfiability) reasoning problem and approximate concepts rough subsumption reasoning problem w.r.t. rough TBox in RDL"A"C may be reduced to the concept satisfiability reasoning problem in (almost) standard ALC (the description logic that provides the Boolean concept constructors plus the existential and universal restriction constructors). The works of this paper provide logic foundations for approximate ontologies and theoretical foundations for reasoning algorithms of more expressive rough description logics including approximate concepts, number restrictions, nominals, inverse roles and role hierarchies.