You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

The Sat4j library, release 2.2

Subtitle: System description

Article type: Research Article

Authors: Le Berre, Daniel; * | Parrain, Anne

Affiliations: Université Lille - Nord de France, CRIL-CNRS UMR 8188, Université d’Artois, Lens, France. E-mails: leberre@cril.univ-artois.fr, parrain@cril.univ-artois.fr

Note: [*] Part of this work was supported by Ministry of Higher Education and Research, Nord-Pas de Calais Regional Council and FEDER through the ‘Contrat de Projets Etat Region (CPER) 2007–2013’.

Keywords: resolution, cutting-planes, SAT-solver, MAXSAT

DOI: 10.3233/SAT190075

Journal: Journal on Satisfiability, Boolean Modeling and Computation, vol. 7, no. 2-3, pp. 59-64, 2010

Received 1 March 2010
|
Revision received 1 May 2010
|
Published: 1 July 2010
Get PDF open access

Abstract

Sat4j is a mature, open source library of SAT-based solvers in Java. It provides a modular SAT solver architecture designed to work with generic constraints. Such architecture is used to provide SAT, MaxSat and pseudo-boolean and solvers for lightweight constraint programming. Those solvers have been evaluated regularly in the corresponding international competitive events. The library has been adopted by several academic softwares and the widely used Eclipse platform, which relies on a pseudo-boolean solver from Sat4j for its plugins dependencies management since June 2008.

Show more