Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
The Expressive Language ALCNHR+K(D) for Knowledge Reasoning
| |
|
XML Data Reasoning and Querying Methods
The Expressive Language ALCNHR+K(D) for Knowledge Reasoning
Nizamuddin Channa1, 2 and Shanping Li1 
| (1) |
College of Computer Science, Zhejiang University,Hangzhou, 310027, P.R. China |
| (2) |
Institute of Business Administration, University of Sindh, Jamshoro, 71000, Pakistan |
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.
The research is funded by Natural Science foundation of China (No. 60174053, No. 60473052).
Fulltext Preview (Small, Large)
|
|
|
|
|
|