Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Base Encodings for Pseudo-Boolean Constraints
 

Summary: Optimal Base Encodings for
Pseudo-Boolean Constraints
Michael Codish1
, Yoav Fekete1
, Carsten Fuhs2
, and Peter Schneider-Kamp3
1
Department of Computer Science, Ben Gurion University of the Negev, Israel
2
LuFG Informatik 2, RWTH Aachen University, Germany
3
IMADA, University of Southern Denmark, Denmark
Abstract. This paper formalizes the optimal base problem, presents
an algorithm to solve it, and describes its application to the encod-
ing of Pseudo-Boolean constraints to SAT. We demonstrate the im-
pact of integrating our algorithm within the Pseudo-Boolean constraint
solver MiniSat+
. Experimentation indicates that our algorithm scales
to bases involving numbers up to 1,000,000, improving on the restriction
in MiniSat+

  

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

 

Collections: Computer Technologies and Information Sciences