Abstract: Automated reasoning is an important realm in artificial intelligence. Resolution-based automated reasoning is one of the research branches. I_atticcvalued logic system based on lattice implication algebra can deal with information or knowledge with comparability and incomparability, provide a stick logical foundation for automated reasoning. The present paper gave some properties of linguistic truth-valued lattice implication algebra外(}x z>.Under lattice-valued propositional logic system }v}9xz> PCX) based on linguistic truth-valued lattice implication algebra姊(。二z} with eighteen elements, the structures of generalized literals about 1-IESF and 2-IESF were given. In addition, the resolution determi- nation of generalized literals was obtained. These works can offer an important foundation for automated reasoning based on linguistic truth-valued lattice-valued logic system.

Key words: Automated reasoning, I_atticcvalucd logic system, Linguistic truth-valued lattice implication algebra, Gener}r lined literal, Resolution