Research on Inconsistency Problem in ￢RDF Reasoning
AI Ying-ying · Jisuanji gongcheng · 2012
￢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.