Sat4j.md

Java library for boolean satisfaction and optimization problems. It can solve SAT, MAXSAT, Pseudo-Boolean and Minimally Unsatisfiable Subset (MUS) problems.

Name:

Sat4j

Application domain/field:

SAT-based solvers MaxSAT problems Optimization problems

Type of tool (e.g. model checker, test generator):

Java library that provides access to SAT-related technologies.

Expected input thing:

?

Expected input format:

DIMACS, or Aralia formula?

Expected output:

• UNSATISFIABLE if it is unsatisfiable
• SATISFIABLE if satisfiable
• it may cause an exception if e.g. a timeout occurs

Internals (tools used, frameworks, techniques, paradigms, ...):

?

Comments:

URIs (github, websites, etc.):

Project page: https://sat4j.org/ Repository: https://gitlab.ow2.org/sat4j/sat4j/

Last commit date:

9 April 2022 (Last release was on 14 December 2020)

Last publication date:

2 July 2021

List of related papers:

On Dedicated CDCL Strategies for PB Solvers (SAT '21) On Weakening Strategies for PB Solvers (SAT '20) https://content.iospress.com/articles/journal-on-satisfiability-boolean-modeling-and-computation/sat190098 (Journal on Satisfiability, Boolean Modeling and Computation '12)

Related tools (tools mentioned or compared to in the paper):

Meta

:: Mathematical optimization :: SAT :: PV4 :: produces a satisfiability result for a formula :: Java :: Source :: https://doi.org/10.1145/3550355.3552426