Package | Description |
---|---|
org.sat4j |
Contains a command line launcher for the SAT solvers.
|
org.sat4j.minisat.core |
Implementation of the MiniSAT solver skeleton.
|
org.sat4j.opt |
Built-in optimization framework.
|
org.sat4j.reader |
Some utility classes to read problems from plain text files.
|
org.sat4j.specs |
Those classes are intended for users dealing with SAT solvers as black boxes.
|
org.sat4j.tools |
Tools to be used on top of an
ISolver . |
org.sat4j.tools.xplain |
Implementation of an explanation engine in case of unsatisfiability.
|
Modifier and Type | Field and Description |
---|---|
protected IProblem |
AbstractLauncher.problem |
Modifier and Type | Method and Description |
---|---|
protected IProblem |
AbstractLauncher.readProblem(String problemname)
Reads a problem file from the command line.
|
Modifier and Type | Method and Description |
---|---|
void |
ILauncherMode.displayResult(ISolver solver,
IProblem problem,
ILogAble logger,
PrintWriter out,
Reader reader,
long beginTime,
boolean displaySolutionLine)
Output of the launcher when the solver stops
|
protected void |
AbstractLauncher.solve(IProblem problem) |
protected void |
AbstractOptimizationLauncher.solve(IProblem problem)
Deprecated.
|
void |
ILauncherMode.solve(IProblem problem,
Reader reader,
ILogAble logger,
PrintWriter out,
long beginTime)
Main solver call: one call for a decision problem, a loop for an
optimization problem.
|
Modifier and Type | Interface and Description |
---|---|
interface |
ICDCL<D extends DataStructureFactory>
Abstraction for Conflict Driven Clause Learning Solver.
|
Modifier and Type | Class and Description |
---|---|
class |
Solver<D extends DataStructureFactory>
The backbone of the library providing the modular implementation of a MiniSAT
(Chaff) like solver.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractSelectorVariablesDecorator
Abstract class which adds a new "selector" variable for each clause entered
in the solver.
|
class |
MaxSatDecorator
Computes a solution that satisfies the maximum of clauses.
|
class |
MinOneDecorator
Computes a solution with the smallest number of satisfied literals.
|
Modifier and Type | Method and Description |
---|---|
IProblem |
InstanceReader.parseInstance(InputStream in) |
IProblem |
AAGReader.parseInstance(InputStream in) |
IProblem |
JSONReader.parseInstance(InputStream in) |
IProblem |
LecteurDimacs.parseInstance(InputStream input) |
abstract IProblem |
Reader.parseInstance(InputStream in)
Read a file from a stream.
|
IProblem |
AIGReader.parseInstance(InputStream in) |
IProblem |
DimacsReader.parseInstance(InputStream in) |
IProblem |
Reader.parseInstance(Reader in)
Deprecated.
|
IProblem |
InstanceReader.parseInstance(String filename) |
IProblem |
Reader.parseInstance(String filename)
This is the usual method to feed a solver with a benchmark.
|
Modifier and Type | Interface and Description |
---|---|
interface |
IGroupSolver
Represents a CNF in which clauses are grouped into levels.
|
interface |
IOptimizationProblem
Represents an optimization problem.
|
interface |
ISolver
This interface contains all services provided by a SAT solver.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractClauseSelectorSolver<T extends ISolver> |
class |
AbstractMinimalModel |
class |
AbstractOutputSolver |
class |
ClausalCardinalitiesDecorator<T extends ISolver>
A decorator for clausal cardinalities constraints.
|
class |
DimacsOutputSolver
Solver used to display in a writer the CNF instance in Dimacs format.
|
class |
DimacsStringSolver
Solver used to write down a CNF into a String.
|
class |
FullClauseSelectorSolver<T extends ISolver> |
class |
GateTranslator
Utility class to easily feed a SAT solver using logical gates.
|
class |
GroupClauseSelectorSolver<T extends ISolver> |
class |
LexicoDecorator<T extends ISolver> |
class |
ManyCore<S extends ISolver>
A class allowing to run several solvers in parallel.
|
class |
Minimal4CardinalityModel
Computes models with a minimal number (with respect to cardinality) of
negative literals.
|
class |
Minimal4InclusionModel
Computes models with a minimal subset (with respect to set inclusion) of
negative literals.
|
class |
ModelIterator
That class allows to iterate through all the models (implicants) of a
formula.
|
class |
ModelIteratorToSATAdapter
This class allow to use the ModelIterator class as a solver.
|
class |
NegationDecorator<T extends ISolver>
Negates the formula inside a solver.
|
class |
OptToSatAdapter |
class |
SingleSolutionDetector
This solver decorator allows to detect whether or not the set of constraints
available in the solver has only one solution or not.
|
class |
SolutionCounter
Another solver decorator that counts the number of solutions.
|
class |
SolverDecorator<T extends ISolver>
The aim of that class is to allow adding dynamic responsibilities to SAT
solvers using the Decorator design pattern.
|
class |
StatisticsSolver |
Modifier and Type | Class and Description |
---|---|
class |
HighLevelXplain<T extends ISolver>
Computation of MUS in a structured CNF, i.e. the clauses belong to
components, the explanation is to be extracted in terms of components.
|
class |
Xplain<T extends ISolver>
Explanation framework for SAT4J.
|
Copyright © 2013 Centre de Recherche en Informatique de Lens (CRIL). All Rights Reserved.