计算机工程 ›› 2012, Vol. 38 ›› Issue (7): 152-154.doi: 10.3969/j.issn.1000-3428.2012.07.050

• 人工智能及识别技术 • 上一篇    下一篇

¬RDF推理中不一致问题研究

王 洁,韩雪平,赵丽丽,艾莹莹   

  1. (北京工业大学计算机学院,北京 100124)
  • 收稿日期:2011-07-04 出版日期:2012-04-05 发布日期:2012-04-05
  • 作者简介:王 洁(1972-),女,副教授、博士,主研方向:逻辑程序设计,不确定推理;韩雪平、赵丽丽、艾莹莹,硕士研究生
  • 基金项目:
    北京市教委科研计划基金资助项目(JC007011200904)

Research on Inconsistency Problem in ¬RDF Reasoning

WANG Jie, HAN Xue-ping, ZHAO Li-li, AI Ying-ying   

  1. (Department of Computer, Beijing University of Technology, Beijing 100124, China)
  • Received:2011-07-04 Online:2012-04-05 Published:2012-04-05

摘要: ¬RDF在RDF中引入经典否定和推理,以增强RDF的表达和推理能力,但经典否定会使程序出现不一致情况,导致程序无解。为此,提出一种基于加权回答集程序的加权¬RDF(¬WRDF)推理方法。借鉴加权回答集思想,通过加权回答集程序对¬WRDF进行推理,给出其应用实例。实例应用结果表明,该方法使得程序在不一致的情况下,仍然可以得到最接近用户需求的解。

关键词: 语义网, 经典否定, 加权¬RDF, 加权回答集, 权值

Abstract: ¬RDF introduces the classical negation of answer set programming into RDF, which improves the capacities of the expression and reasoning of semantic Web. However, due to the introduce of classical negation, sometimes there is inconsistence when reasoning ¬RDF with answer set programming, which causes the program to no solution. This paper learns from the ideas of weighted answer sets, and forms Weighted ¬RDF(¬WRDF). It discovers implicit facts through weighted answer sets. Example proves that the reasoning method provides the best solution to the users’ needs when the program is inconsistent.

Key words: semantic Web, classical negation, Weighted ¬RDF(¬WRDF), weighted answer set, weight

中图分类号: