用于基数约束编码的较小选择网络
Smaller Selection Networks for Cardinality Constraints Encoding
摘要:
选择比较器网络已经研究了很多年。最近,他们已成功地应用于编码基数约束SAT求解器。为了减少生成公式的大小,需要构建选择网络,该选择网络可以有效地生成并产生针对其两个参数的实际范围的小尺寸网络:n -输入的数量(布尔变量)和k -所选项目的数量(基数界限)。在本文中,我们给出并分析了一个新的构造较小的选择网络,它是基于Codish和Zanon-Ivry介绍的成对选择网络。我们还证明了基数约束与选择网络的标准编码保持弧的一致性。
英文摘要:
Selection comparator networks have been studied for many years. Recently, they have been successfully applied to encode cardinality constraints for SAT-solvers. To decrease the size of generated formula there is a need for constructions of selection networks that can be efficiently generated and produce networks of small sizes for the practical range of their two parameters: n - the number of inputs (boolean variables) and k - the number of selected items (a cardinality bound). In this paper we give and analyze a new construction of smaller selection networks that are based on the pairwise selection networks introduced by Codish and Zanon-Ivry. We prove also that standard encodings of cardinality constraints with selection networks preserve arc-consistency.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。