<p>This paper investigates lifting filters in residuated lattices, extending techniques from ring theory to this algebraic framework and linking them to decision-making under uncertainty. We introduce and study <i>pseudo-irreducible</i> and <i>lifting filters</i>, showing that a proper filter is pseudo-irreducible if and only if it is local. Lifting filters are characterized both algebraically and geometrically, through clopen sets in the prime spectrum and via Pierce stalks, and we prove that every Stone filter is a lifting filter. A key result settles an open problem by characterizing residuated lattices whose radical is a lifting filter. We further establish the <i>lifting comaximal factorization property</i>, providing equivalent formulations in terms of partitions of closed spectral subsets. Finally, we examine how lifting filters facilitate the transition from graded truth values to Boolean approximations, thereby enhancing logical consistency in decision-making frameworks. Applications illustrate how lifting filters improve logical consistency in multi-valued decision-making, with examples drawn from robotic navigation, smart home systems, and agriculture.</p>