We present a new, more symmetric evaluation strategy for conjunctions in miniKanren. Unlike the original unfair directed conjunction, our approach controls the order of conjunct execution based on the properties of structurally recursive relations. In this paper we describe operational semantics for both
classical'' andfair'' conjunctions. We also compare the performance of classical and fair conjunctions on a number of examples and discuss the results of the evaluation.