Exploiting AND-parallelism is important in the research of parallel execution of logic programs. In this paper，a compiling approach for exploiting AND-parallelism in logic programming is presented. The approach consists of three phases: analysis of entry modes; derivation of exit modes; and determination of execution graph expressions. Compared with other approaches. this approach，with the compile一time program-level data dependence analysis of logic programs，can efficiently exploit AND-parallelism in logic programs. Two precompilers，based on our approach and DeGroot's respectively have been implemented in SES-PIM system. Through compiling and running some typical benchmarks in SES-PIM，we conclude that our approach can exploit the maximum AND--parallelism under “producer-consumer”scheme，exactly the same degree as the dynamic approach once employed in SES-PIM，and needs significantly less dynamic overhead than DeGroot's while exploiting more AND-parellelism than DeGroot's.