The idea of counting the number of satisfying truth assignments (models) of a formula by adding random parity constraints can be traced back to the seminal work of Valiant and Vazirani, showing that NP is as easy as detecting unique solutions. While theoretically sound, the random parity constraints in that construction have the following drawback: each constraint, on average, involves half of all variables. As a result, the branching factor associated with searching for models that also satisfy the parity constraints quickly gets out of hand. In this work we prove that one can work with much shorter parity constraints and still get rigorous mathematical guarantees, especially when the number of models is large so that many constraints need to be added. Our work is based on the realization that the essential feature for random systems of parity constraints to be useful in probabilistic model counting is that the geometry of their set of solutions resembles an error-correcting code.
Learning Branching Heuristics for Propositional Model Counting
University of Toronto(多伦多大学);UC Berkeley(加州大学伯克利分校);Vector Institute(向量研究所)
命题模型计数(Propositional Model Counting),或#SAT,是计算布尔公式的满意赋值的数量的问题。来自不同应用领域的许多问题,包括许多离散概率推理问题,可以转化为模型计数问题,由#SAT求解器来解决。然而,精确的#SAT求解器通常不能扩展到工业规模的实例。在本文中,我们提出了Neuro#,一种用于学习分支算法的方法,以提高给定问题族实例上的精确SAT求解器的性能。我们的实验表明,我们的方法减少了类似的分布式举行了实例的步骤数,并推广到更大的实例,从同一个问题的家庭。它是能够实现这些结果对一些不同的问题家庭具有非常不同的结构。除了步数改进之外,Neuro#还可以在某些问题族中的较大实例上实现比vanilla求解器高出几个数量级的挂钟加速,尽管查询模型的运行时开销很大。