|Table of Contents|

[1] Lin Peiguang, Liu Hong, Fan Xiaozhong, et al. New method for query answering in semantic web [J]. Journal of Southeast University (English Edition), 2006, 22 (3): 319-323. [doi:10.3969/j.issn.1003-7985.2006.03.006]
Copy

New method for query answering in semantic web()
一种新的语义网信息检索方法
Share:

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:
22
Issue:
2006 3
Page:
319-323
Research Field:
Computer Science and Engineering
Publishing date:
2006-09-30

Info

Title:
New method for query answering in semantic web
一种新的语义网信息检索方法
Author(s):
Lin Peiguang1 2 Liu Hong3 Fan Xiaozhong1 Wang Tao1
1School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
2School of Computer and Information Engineering, Shandong University of Finance, Jinan 250014, China
3College of Information Science and Engineering, Shandong Normal University, Jinan 250014, China
林培光1 2 刘弘3 樊孝忠1 王涛1
1北京理工大学计算机科学与技术学院, 北京 100081; 2山东财政学院计算机信息工程学院, 济南 250014; 3山东师范大学信息科学与工程学院, 济南 250014
Keywords:
description logic assertional graph semantic web information retrieval
描述逻辑 断言图 语义网 信息检索
PACS:
TP391.3
DOI:
10.3969/j.issn.1003-7985.2006.03.006
Abstract:
To promote the efficiency of knowledge base retrieval based on description logic, the concept of assertional graph(AG), which is directed labeled graph, is defined and a new AG-based retrieval method is put forward.This method converts the knowledge base and query clause into knowledge AG and query AG by making use of the given rules and then makes use of graph traversal to carry out knowledge base retrieval.The experiment indicates that the efficiency of this method exceeds, respectively, the popular RACER and KAON2 system by 0.4% and 3.3%.This method can obviously promote the efficiency of knowledge base retrieval.
为了提高基于描述逻辑的知识库检索的效率, 提出了断言图的概念和基于断言图匹配的检索方法.断言图是带有标签的有向图, 基于断言图匹配的检索方法首先利用给定规则对基于描述逻辑的知识库和查询请求中的量化符号进行处理, 然后转换成有向的知识断言图和查询断言图, 最后利用图的遍历算法实现基于描述逻辑知识库检索.实验表明, 该方法能够明显提高知识库检索的效率, 其执行效率比当前流行的RACER和KAON2分别提高了0.4%和3.3%.

References:

[1] Glimm Birte, Horrocks Ian.Query answering systems in the semantic web[A].In: Bechhofer Sean, Haarslev Volker, Lutz Carsten, eds.Proc of the KI-04 Workshop on Applications of Description Logics[C].Edinburgh:CEUR-WS, 2004.21-30.
[2] Nagy Zsolt, Lukacsy Gergely, Szeredi Peter.Translating description logic queries to prolog[A].In:van Hentenryck P, ed.Proc of the 8th International Symposium on Practical Aspects of Declarative Languages (PADL 2006)[C].Berlin:Springer, 2006.168-182.
[3] Haarslev Volker, Moller Ralf.Optimization techniques for retrieving resources described in OWL/RDF document:first results[A].In:Whistler, ed.Proc of the Ninth International Conference (KR2004)[C].British Columbia:AAAI Press, 2004.163-173.
[4] Horrocks Ian, Tessaris Sergio.Querying the semantic web:a formal approach[A].In:Ian Horrocks, Hendler James, eds.Proc of the 13th International Semantic Web Conference [C].Berlin:Springer, 2002.177-191.
[5] Haarslev Volker, Moller Ralf.Querying the semantic web with Racer+nRQL[A].In:Bechhofer Sean, Haarslev Volker, Lutz Carsten, eds.Proc of the KI-04 Workshop on Applications of Description Logics [C].Edinburgh:CEUR-WS, 2004.31-40.
[6] Calvanese Diego, de Giacomo Giuseppe, Lembo Domenico, et al.Data complexity of query answering in description logics[A].In:Horrocks Ian, Sattler Ulrike, Wolter Frank, eds.Proc of the 2005 Description Logic Workshop[C].Edinburgh:CEUR-WS, 2005.49-60.

Memo

Memo:
Biographies: Lin Peiguang(1978—), male, graduate; Fan Xiaozhong(corresponding author), male, professor, fxz@bit.edu.cn.
Last Update: 2006-09-20