语义网的一阶逻辑推理技术支持-软件学报.pdfVIP

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software , Vol.19, No.12, December 2008, pp.3091−3099 DOI: 10.3724/SP.J.1001.2008.03091 Tel/Fax: +86-10 © 2008 by Journal of Software . All rights reserved. ∗ 语义网的一阶逻辑推理技术支持 1,2 1+ 徐贵红 , 张 健 1( 中国科学院 软件研究所 计算机科学国家重点实验室,北京 100190) 2( 中国科学院 研究生院,北京 100049) First-Order Logic Reasoning Support for the Semantic Web XU Gui-Hong 1,2, ZHANG Jian1+ 1(State Key Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, Beijing 100190, China) 2(Graduate University, The Chinese Academy of Sciences, Beijing 100049, China) + Corresponding author: E-mail: zj@ Xu GH, Zhang J. First-Order logic reasoning support for the semantic Web. Journal of Software, 2008, 19(12):3091−3099. /1000-9825/19/3091.htm Abstract : This paper investigates reasoning support for the semantic Web based on the first-order logic. The key reasoning tasks of the semantic Web can be reduced to deciding the satisfiability of formulas. The first-order logic theorem prover is efficient and complete for unsatisfiability, while finite model searcher finds models for satisfiable formula. This paper proposes to use a theorem prover and a finite model searcher concurrently in the semantic Web reasoning. The experiments show that the method can make up the deficiencies of the description logic reasoner and complement the theorem prover for satisfiable formulas. Key words: semantic Web reasoning; first-order logic; description logic; ontology; satisfiability 摘 要: 研究了一阶逻辑推理工具对语义网的推理支持.语义网的关键推理问题可以化为公式的可满足性判定问 题.一阶逻辑的自动定理证明器可以证明不可满足性,而有限模型查找器为可满足的公式在有限域内构造模型.提出 在语义网的推理中, 同时使用定理证明器和有限模型查找器.实验结果表明,这样可以解决描述逻辑工具的不足,并 可以弥补定理证明器对可满足的公式推理的不完备性.