29 June 2012 in Soft Computing
1 January 2014 in International Journal of Computational Intelligence Systems
Based on the general form of-resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure-lattice implication algebra, the further extended-resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly,-quasi-lock semantic resolution method in lattice-valued propositional logic LP(X) is established by combining the lock and semantic resolution simultaneously, and its theorems of soundness and conditional completeness are proved. Secondly, this-quasi-lock semantic resolution method is extended into the corresponding lattice-valued first-order logic LF(X), and its soundness and conditional completeness are also established. This extended resolution method will provide a theoretical basis for automated soft theorem proving and program verification based on lattice-valued logic.