In this paper, we present a detection technique of and-parallelism in logic programs. The detection consistsof three phases: analysis of entry modes, derivation of exit modes and determination of execution graphexpressions. Compared with other techniques, our approach, with the compile-time program-leveldata-dependence analysis of logic programs, can efficiently exploit and-parallelism in logic programs. Twoprecompilers, based on our technique and DeGroot’ s approach respectively, have been implemented inSES-PIM system. Through compiling and running some typical benchmarks in SES-PIM, we concludethat our technique can, in most cases, exploit as much and-parallelism as the dynamic approach doesunder “producer-consumer” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does. In this paper, we present a detection technique of and-parallelism in logic programs. The detection consists of three phases: analysis of entry modes, derivation of exit modes and determination of execution graphexpressions. Compared with other techniques, our approach, with the compile- time program-leveldata-dependence analysis of logic programs, can be exploited and-parallelism in logic programs. Twoprecompilers, based on our technique and DeGroot ’s approach respectively, have been implemented in SES-PIM system. Through compiling and running some typical benchmarks in SES-PIM, we concludethat our technique can, in most cases, exploit as much and-parallelism as the dynamic approach doesunder “producer-consumer ” scheme, and needs less dynamic overhead while exploiting more and-parallelism than DeGroot’s approach does.