The Sat4j library, release 2.2 | Zendy

Daniel Le Berre | Zendy; Anne Parrain | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Sat4j library, release 2.2

Author(s) -

Daniel Le Berre,

Anne Parrain

Publication year - 2010

Publication title -

journal on satisfiability boolean modeling and computation

Language(s) - English

Resource type - Journals

eISSN - 1875-5011

pISSN - 1574-0617

DOI - 10.3233/sat190075

Subject(s) - computer science , programming language , boolean satisfiability problem , solver , maximum satisfiability problem , plug in , java , architecture , modular design , computer architecture , parallel computing , theoretical computer science , algorithm , boolean function , art , visual arts

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research