Abstract
In the present paper, resolution-based automated reasoning theory in an L-type fuzzy logic is focused. Concretely, the α-resolution principle, which is based on lattice-valued propositional logic LP( X) with truth-value in a logical algebra – lattice implication algebra, is investigated. Finally, an α-resolution principle that can be used to judge if a lattice-valued logical formula in LP( X) is always false at a truth-valued level α (i.e., α-false), is established, and the theorems of both soundness and completeness of this α-resolution principle are also proved. This will become the theoretical foundation for automated reasoning based on lattice-valued logical LP( X).
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
