  We study conjunctive partial deduction, an advanced specialization technique
aimed at improving the performance of logic programs, in the context of
relational programming language miniKanren. We identify a number of issues,
caused by miniKanren peculiarities, and describe a novel approach to
specialization based on partial deduction and supercompilation. The results of
the evaluation demonstrate successful specialization of relational
interpreters. Although the project is at an early stage, we consider it as the
first step towards an efficient optimization framework for miniKanren.
