No abstract

No abstract

BoolVar/pb v1.0 is an open source java library dedicated to the translation of pseudo-Boolean constraints into cnf formulae. Input constraints can be categorized with tags. Several encoding schemes are implemented in a way that each input constraint can be translated using one or several encoders, according to the related tags. The library can be easily extended by adding new encoders and / or new output formats. It is available at http://boolvar.sourceforge.net/.i n t [ ] coeffs = { 5 , 3 , 1 } ; setTags ( 1 ) ;To complete the building of the input model, it only remains to create the input constraint, which is simplified by using the static factory method makeLeq, and add it to the model. Constraint q = makeLeq ( coeffs , lits , 8 ) ; m . addConstraint ( q ) ;At this time, the input model is created. It can be print to the screen for verification purpose.System . out . println ( m . toString ( ) ) ;Now, the input model must be translated to an output problem, namely a cnf formula. This suppose to create an instance of the class CNFProlem in the following way:OutputProblem out = new CNFProblem ( ) ;

The International SAT Solver Competition is today an established series of competitive events aiming at objectively evaluating the progress in state-of-the-art procedures for solving Boolean satisfiability (SAT) instances. Over the years, the competitions have significantly contributed to the fast progress in SAT solver technology that has made SAT a practical success story of computer science. This short article provides an overview of the SAT solver competitions.