Discursion method based on semantic searching

Abstract

The invention discloses a reasoning method based on semantic search, comprising: (1) setting a threshold, evaluating the complexity of ABox reasoning and TBox reasoning algorithms, if the algorithms are larger than the threshold, continuing executing, or else, executing step (3); (2) reasoning by the reasoning method, and executing step (4); (3) reasoning by a reasoning method in a Fact++ reasoning machine to get a final reasoning result; (4) modifying a reasoning result got in step (2) to get a final reasoning result. The method can self-adaptively returns a precise reasoning result or an approximate reasoning result, improve reasoning efficiency and lower the time complexity of reasoning.

Description

technical field [0001] The invention relates to a method based on semantic search, in particular to a reasoning method based on semantic search. Background technique [0002] The emergence of the Internet has greatly changed people's lives, enriched people's communication methods, increased the channels for people to obtain information, accelerated the circulation of information, and affected people's leisure methods, etc. The technology that has had the greatest impact on people since the late 2000s. However, the current webpage, whose expression language is hypertext markup language, that is, HTML, is human-oriented at the beginning of its invention, that is, the content of the webpage is displayed to people through a browser, which leads to the fact that its content cannot be well understood by machines. Understanding, affects the automation of web content processing. With the rapid increase of network information, it becomes difficult for people to acquire knowledge ef...

AI Technical Summary

Problems solved by technology

[0005] The current research shows that for the general expressive description logic language ALC, its complexity is pspace-complete. Therefore, if it is not optimized, it is difficult to apply in the network environment.

At present, some optimization strategies have been applied to the reasoning process of description logic, such as buffering (cache), delayed expansion (Lazy Unfolding), etc., but for description logic with weak expressive ability such as ALC, its complexity is already pspace -complete

These existing optimization strategies have low reasoning efficiency and high time complexity, which greatly restricts the application of description logic and is difficult to apply in network search.

Images