α -GROUP LOCK RESOLUTION PRINCIPLE BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC GIC LP(X)

α-resolution principle based on lattice-valued logic is focused on in this paper, which is a great extension of resolution principle based on classical logic. Concretely, based on α-Group resolution principle in lattice-valued logic, α-Group lock resolution principle is introduced, aiming to improve the efficiency of resolution and the ability of resolution. Then both the soundness and the completeness theorems of α-Group lock resolution principle are proved in lattice-valued propositional logic LP(X). The example given in lattice-valued propositional logic LP(X) illustrates that α-Group lock resolution method is, to some extent, more resolution efficiency than α-Group resolution method and more resolution ability than α-lock resolution method, which only permits binary resolution in lattice-valued logic. This work will provide theoretical foundations for the establishment of automated reasoning algorithm and the further applications of automated reasoning and decision making under uncertainty.