Before a combinatorial problem can be solved by current SAT methods, it must usually be
encoded in conjunctive normal form, which facilitates algorithm implementation and allows a …

The recent surge of interest in reasoning about probabilistic graphical models has led to the
development of various techniques for probabilistic reasoning. Of these, techniques based …

Generating test cases for combinatorial testing is to find a covering array in Combinatorial
Designs. In this paper, we consider the problem of finding optimal covering arrays by SAT …

SAT has become the backbone of many software systems. In order to make full use of the
power of SAT solvers, a SAT compiler must encode domain variables and constraints into an …

We present BEE, a compiler which enables to encode finite domain constraint problems to
CNF. Using BEE both eases the encoding process for the user and also performs …

The log encoding has been perceived to be unsuited to arithmetic constraints due to its
hindrance to propagation. The surprising performance of PicatSAT, which is a pure eager …

One approach for solving Constraint Satisfaction Problems (CSP)(and related Constraint
Optimization Problems (COP)) involving integer and Boolean variables is reduction to …

We present an approach to propagation-based SAT encoding of combinatorial problems,
Boolean equi-propagation, where constraints are modeled as Boolean functions which …

Constrained counting and sampling are two fundamental problems in Computer Science
with numerous applications, including network reliability, privacy, probabilistic reasoning …

This paper presents a SAT-based pseudo-Boolean (PB for short) solver named PBSugar.
PBSugar translates a PB instance to a SAT instance by using the order encoding …