Non-revision reasoning with beliefs in predicate logic

Non-revision reasoning is a process to derive consistent belief set from an inconsistent belief base. Compared with belief revision, it doesn´t modify the initial belief base, but developing new reasoning methods to deal with the contradiction. In this paper, an approach of non-revision reasoning in predicate logic is provided. We assume that belief is represented by clause and assign degrees of preference to it. It is possible to define a unique, consistent and deductively closed extension which is most preferred and derivable from the belief base. We argue that this approach can get a larger extension set losing less information than the present non-revision method. Finally, a threshold is used to reduce the complexity of belief base when there is not enough time to compute completely.