Non-revision Reasoning without Redundancy in Predicate Logic

Belief revision is a basic approach to deal with the contradiction in non-monotonic reasoning. It achieves the consistency of the belief base by removing members from it, which causes information loss unavoidably. Compared with belief revision, non-revision reasoning develops new reasoning methods to deal with the contradiction instead of modifying the initial base. This paper is an extending work of non-revision reasoning with beliefs in predicate logic. It´s assumed that belief is represented by clause and assigned degrees of preference to it. An unique, consistent, deductively closed and most preferred extension of the belief base is constituted in this paper. Compared with the recent work, this approach is more efficient because it removes the redundancy of the system. More properties of the approach are proved in this paper. Especially, the epistemic process of this reasoning method is convergent.