dynamic evolutions based on ontologies

With the continuous changes in application requirements of the enterprises, Web resources must be updated, so do the underlying ontologies that are associated with the Web resources. In the situation, it is very challenging for ontological engineers to specify the changes of ontologies, keep their consistencies and achieve semantic query of Web resources based on the evolving ontologies. We propose a construct called Prioritized Knowledge Base (PKB) based on SHOQ(D) description logic, and discuss some properties of PKB.PKB can be used for describing the evolutions and updates of ontologies with conflicting information. Furthermore, we develop some algorithms for checking conflict rules and performing semantic query based on PKB.

semantic oriented ontology cohesion metrics for ontology-based systems

Ontologies play a core role to provide shared knowledge models to semantic-driven applications targeted by Semantic Web. Ontology metrics become an important area because they can help ontology engineers to assess ontology and better control project management and development of ontology based systems, and therefore reduce the risk of project failures. In this paper, we propose a set of ontology cohesion metrics which focuses on measuring (possibly inconsistent) ontologies in the context of dynamic and changing Web. They are: Number of Ontology Partitions (NOP), Number of Minimally Inconsistent Subsets (NMIS) and Average Value of Axiom Inconsistencies (AVAI). These ontology metrics are used to measure ontological semantics rather than ontological structure. They are theoretically validated for ensuring their theoretical soundness, and further empirically validated by a standard test set of debugging ontologies. The related algorithms to compute these ontology metrics also are discussed. These metrics proposed in this paper can be used as a very useful complementarity of existing ontology cohesion metrics.

基于进化分布式本体的语义Web服务动态发现

在语义Web服务中, 确认分布式本体变动、维护其一致性并实现基于进化的分布式本体的Web服务语义查询成为了一个重要挑战.该文使用SHOQ(D)的分布式描述逻辑扩展 (DDL) 描述相互关联的异构分布式本体,提出了优先分布式知识库(PDK)的概念,探讨了PDK方法的一些重要属性.PDK用来描述分布式本体的进化和更新, 它适用于语义Web服务环境.基于PDK, 文中还给出了相应的语义查询方法,Web服务的语义查询可以归结为检测同这个查询对应的概念在最优先PDK中的p -可满足性.

语义Web中描述逻辑本体的可伸缩推理和非一致处理

随着Web信息的与日俱增，使用机器处理这种信息成为一种必然的趋势。语义Web应运而生，成为当前研究的热点之一。它以本体为核心，为不同领域提供共享的词汇，以便机器处理Web信息。表达本体的标准语言OWL以描述逻辑为基础。OWL本体的推理可伸缩性差，难以适应规模较大的本体应用，因此推理可伸缩性问题是一个重要的实际问题。此外，OWL本体是一个逻辑系统，在生成、维护和集成等过程中，都很容易出现非一致现象，导致标准的推理机制不能正常运作。因此本体非一致问题是另一个重要的实际问题。针对上述两个实际问题，本文分别在实现可伸缩推理、修复非一致本体、以及进行非一致容忍推理三个方面提出了解决办法。 [可伸缩推理方面] 本文提出了一种本体断言公理集的划分方法，使本体推理能够在独立的划分子集中进行，以此提高本体推理的可伸缩性。 [本体修复方面] 本文提出了一种计算具有最小删除代价的本体子集的方法；通过删除这种本体子集，可以恢复本体的一致性。该方法将计算上述本体子集的问题归约为在命题逻辑程序中计算某种最优模型的问题，以调用现有的可满足性问题求解器来解决。 [非一致容忍推理方面] 本文将命题逻辑中字典序推理方法应用到描述逻辑中，以提供针对非一致本体的查询机制。本文还提出了一种在描述逻辑本体中进行字典序推理的方法。该方法将字典序结论的判定问题归约为命题可满足性判定问题，以调用现有的可满足性问题求解器来解决。