4 search results - page 1 / 1 » The First Evaluation of Pseudo-Boolean Solvers (PB'05) |
JSAT
2006
13 years 4 months ago
2006
The first evaluation of pseudo-Boolean solvers was organized as a subtrack of the SAT 2005 competition. The first goal of this event is to take a snapshot of the current state of ...
JSAT
2006
13 years 4 months ago
2006
This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the p...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
TACAS
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...