In many decision-making processes, one may prefer multiple solutions to a single solution, which allows us to choose an appropriate solution from the set of promising solutions that are found by algorithms. Given this, finding a set of \emph{diverse} solutions plays an indispensable role in enhancing human decision-making. In this paper, we investigate the problem of finding diverse solutions of Satisfiability from the perspective of parameterized complexity with a particular focus on \emph{tractable} Boolean formulas. We present several parameterized tractable and intractable results for finding a diverse pair of satisfying assignments of a Boolean formula. In particular, we design an FPT algorithm for finding an ``almost disjoint'' pair of satisfying assignments of a $2$CNF formula.

翻译：在许多决策过程中，人们可能更倾向于获得多个解而非单一解，这使得我们能够从算法发现的有前景的解集中选择合适的解。鉴于此，寻找一组多样化解在增强人类决策能力方面发挥着不可或缺的作用。本文从参数化复杂度的角度研究可满足性问题中多样化解的寻找问题，特别关注可处理的布尔公式。针对寻找布尔公式的多样化满足赋值对，我们提出了若干参数化可处理与不可处理的结果。特别地，我们设计了一种FPT算法，用于寻找$2$CNF公式的"几乎不相交"满足赋值对。