The expressive language ALCNHR+K(D) for knowledge reasoning

  • Authors:
  • Nizamuddin Channa;Shanping Li

  • Affiliations:
  • College of Computer Science, Zhejiang University, Hangzhou, P.R. China;College of Computer Science, Zhejiang University, Hangzhou, P.R. China

  • Venue:
  • KDXD'06 Proceedings of the First international conference on Knowledge Discovery from XML Documents
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Expressive Language ALCNHR+(D) provides conjunction, full negation, quantifiers, number restrictions, role hierarchies, transitively closed roles and concrete domains. In addition to the operators known from ALCNHR+, a restricted existential predicate restriction operator for concrete domains is supported. In order to capture the semantic of complicated knowledge reasoning model, the expressive language ALCNHR+K(D) is introduced. It cannot only be able to represent knowledge about concrete domain and constraints, but also rules in some sense of closed world semantic model hypothesis. The paper investigates an extension to description logic based knowledge reasoning by means o f decomposing and rewriting complicated hybrid concepts into partitions. We present an approach that automatically decomposes the whole knowledge base into description logic compatible and constraints solver. Our arguments are two-fold. First, complex description logics with powerful representation ability lack effectively reasoning ability and second, how to reason with the combination of inferences from distributed heterogeneous reasoner.