We present a novel technique for converting a Boolean conjunctive normal form (CNF) into an orthogonal disjunctive normal form (DNF), aka exclusive sum of products. Our method (which will be pitted against a hardwired command from Mathematica) zooms in on the models of the CNF by imposing its clauses one by one. Clausal imposition invites parallelization, and wildcards beyond the common don’t-care symbol compress the output. The method is most efficient for few but large clauses. Generalizing clauses, one can in fact impose superclauses. By definition, superclauses are obtained from clauses by substituting each positive literal by an arbitrary conjunction of positive literals.

中文翻译：

---

使用通配符压缩：通过逐个施加子句，从CNF到正交DNF

我们提出了一种新颖的技术，用于将布尔合取范式（CNF）转换为正交合取范式（DNF），也就是乘积的总和。我们的方法（将抵制来自Mathematica的硬连线命令），通过逐一地强加CNF的子句来放大CNF的模型。子句拼写会导致并行化，而通用的无关符号之外的通配符会压缩输出。该方法对于少数但较大的子句是最有效的。概括条款，实际上可以施加超级条款。根据定义，从句中通过将任意正文字替换为正文字的任意组合，可以从子句中获得超级子句。