Non-revision Approaches Of Reasoning With Weighted Clausale Beliefs

There is a lot of information from the commonsense reasoning. Some of them are inconsistently, incomplete, probabilistic. So this kind of information can only be called belief.Belief revision is an important method to study the commonsense reasoning. The main thought of belief revision is about sorting the belief based on some assumption and using more reliable belief to revise the less reliable belief. Finally the following method can obtain the consistent belief set. We can conclude from the method that the system can lost some useful information and produce the undesired conclusion because we have to revise the belief set constantly.The main thought of the non-revision method is that we would rather reserve all the belief rather than revise the belief set when the new belief make conflict with the former beliefs set. The non-revision use some method about implication semantic to regard the consistent belief set as the final belief conclusion set of the system. The non-revision method can avoid the appearance of undesired conclusion and the difficulty of choose the final set.As for the question of weighted belief, there is lots of work to measure the degree of reliability about the belief just like the finite chain. However, the element of the finite chain are discrete, totally ordered. Its applied range is circumscribed. So we can use the element of the smooth lattice to describe the reliability of the belief. The method of the smooth lattice can solve the problem of incomparability.This paper studied the disadvantages about the finite chain and the belief revision. We use the element of the smooth lattice to weight the clause in the first order logic. We regard the set of weighted clause as the hypothesis and use the method of resolution to redefine the expanded hypothesis. At the same time, we prove the properties of the expanded hypothesis. Beyond that, we discussed the consistency of the following hypothesis.We discuss the corresponding epistemic process and its limit. In the first place, we defined the epistemic process of the following hypothesis. At the same time, we gave the condition of convergence. In the second place, we proved the corresponding epistemic process has its convergence. This paper put forward a possible method about the non-revision in the first order logic. Through the study of this article, we expanded the research scope of non-revision.