The consistency of rule-bases in lattice-valued first-order logic LF(X)

The consistency of the rule-base is an essential basis for the rule-based intelligent information processing. In the framework of first-order lattice-valued logic system LF(X) which is in the attempt of handling fuzziness and incomparability, the present work focus on how to verify and increase the consistency degree of the rule-base in the intelligent information process system for handling fuzziness and incomparability. An α-automated simplification algorithm in LF(X) is proposed, the α-consistency and the α-simplification theory of the rule-base are formulated. As such, the verification of the α-consistency of the rule-base, often an infinity problem which is difficult to be achieved, can be transformed into a finite and achievable α-simplification stepwise search algorithm for verifying the consistency of the rule-base as well as a kind of filtering algorithm for increasing the consistency degree of the rule-base are proposed.