Partial intersection in logic programming

The relation between logic programming and partial intersection is explored in this paper. In a logic program, the P-domain of a predicate is a set containing all the tuples that satisfy the predicate. The partial intersection of P-domains is a calculation in which intersection is conducted between part of the elements of each tuple of the P-domains. Partial intersection with truncation is commutative. A clause in a logic program is associated with set calculations and consequently, the deductions can be converted as a sequence of set calculations.