Abstract. Based on the A maximal (m) relaxed monotonicity frame-works, the approximation solvability of a general class of variational in-clusion problems using the relaxed proximal point algorithm is explored,while generalizing most of the investigations, especially of Xu (2002) onstrong convergence of modi ed version of the relaxed proximal point al-gorithm, Eckstein and Bertsekas (1992) on weak convergence using therelaxed proximal point algorithm to the context of the Douglas-Rachfordsplitting method, and Rockafellar (1976) on weak as well as strong con-vergence results on proximal point algorithms in real Hilbert space set-tings. Furthermore, the main result has been applied to the context of theH maximal monotonicity frameworks for solving a general class of vari-ational inclusion problems. It seems the obtained results can be used togeneralize the Yosida approximation that, in turn, can be applied to rst-order evolution inclusions, and can also be applied to Douglas-Rachfordsplitting methods for nding the zero of the sum of two A maximal (m)-relaxed monotone mappings.