论文标题
又有另一个对距离约束的SAT编码的比较
Yet Another Comparison of SAT Encodings for the At-Most-K Constraint
论文作者
论文摘要
最容易受到的约束在组合问题中无处不在，并且有许多SAT编码可用于约束。先前的实验表明，k $> $ 1的顺序countrying的竞争力，并排除了平行符合所共同的共同的竞争力，这是由于其无法通过单位传播强制执行ARC一致性而考虑的二进制文件编码更紧凑的。本文提出了一项实验，该实验显示了针对二进制二进制的二进制代码编码的惊人性能。
The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have excluded the parallel-counter encoding, which is more compact that the binary-adder encoding, from consideration due to its incapability of enforcing arc consistency through unit propagation. This paper presents an experiment that shows astounding performance of the binary-adder encoding for the at-most-k constraint.
