Semantic caching for semantic web applications

JIST'11 Proceedings of the 2011 joint international conference on The Semantic Web(2012)

引用 0|浏览0
暂无评分
摘要
Ontology debugging helps users to understand the unsatisfiability of a concept in an ontology by finding minimal unsatisfiability-preserving sub-ontologies (MUPS) of the ontology for the concept. Although existing approaches have shown good performance for some real life ontologies, they are still inefficient to handle ontologies that have many MUPS for an unsatisfiable concept. In this paper, we propose an efficient approach to debugging ontologies based on a set of patterns. Patterns provide general information to explain unsatisfiability but are not dependent on a specific ontology. In this approach, we make use of a set of heuristic strategies and construct a directed graph w.r.t. the hierarchies where the depth-first search strategy can be used to search paths. The experiments show that our approach has gained a significant improvement over the state of the art and can find considerable number of MUPS.
更多
查看译文
关键词
depth-first search strategy,efficient approach,ontology debugging,real life ontology,debugging ontology,good performance,specific ontology,general information,semantic caching,considerable number,unsatisfiable concept,semantic web application,rdf
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要