Yet Another Comparison of SAT Encodings for the At-Most-K Constraint

05/12/2020
by   Neng-Fa Zhou, et al.
0

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.

READ FULL TEXT

page 1

page 2

research
07/02/2018

A SAT Encoding for the n-Fractions Problem

This note describes a SAT encoding for the n-fractions puzzle which is p...
research
02/04/2014

Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems

We present an approach to propagation-based SAT encoding of combinatoria...
research
10/27/2018

A comparison of encodings for cardinality constraints in a SAT solver

Cardinality constraints are important in many Sat problems; previous stu...
research
09/26/2011

Binary Encodings of Non-binary Constraint Satisfaction Problems: Algorithms and Experimental Results

A non-binary Constraint Satisfaction Problem (CSP) can be solved directl...
research
11/01/2019

Sherali-Adams and the binary encoding of combinatorial principles

We consider the Sherali-Adams (SA) refutation system together with the u...
research
08/04/2020

Proof complexity and the binary encoding of combinatorial principles

We consider Proof Complexity in light of the unusual binary encoding of ...
research
06/18/2014

The Propagation Depth of Local Consistency

We establish optimal bounds on the number of nested propagation steps in...

Please sign up or login with your details

Forgot password? Click here to reset