Binary Decision Diagram (BDD) is a directed acyclic graph,
which represents many boolean functions efficiently.
After Bryant proposed an efficient algorithm to manipulate them,
BDD is used not only in logic design area,
but also in combinatorial problems.
In this paper, we present an algorithm to construct a BDD
representing positive conjunctive normal form (CNF) of a boolean function
and implement it on AP-1000+, distributed memory parallel computer.
We also experiment on BDD representing functions of independent sets and
dominating sets of a graph.
Computational results show that
speedup is proportional to the number of processors.