An algorithm for extension of clausal beliefs

In order to reason for the conflicting beliefs, this paper employs the conclusion that does not contain opposite information as the hypothesis expansion. Furthermore, it provides the definition of hypothesis extension based on the method of belief non-revision. The hypothesis expansion has a series of good mathematical properties, e.g., consistency and closeness. This paper proposes the algorithm for extension of clausal beliefs based on the definition and its good nature. Although the number of clausal beliefs may decrease the working speed of the algorithm, the correctness of the corresponding conclusion is enhanced. The experimental results demonstrate that, for a certain amount of beliefs, the efficiency of proposed approach still can be guaranteed.