# Packages
No description provided by the author
No description provided by the author
Package solver implements a general-purpose solver for boolean constraint satisfiability problems.
# Functions
IdentifierFromString returns an Identifier based on a provided string.
# Structs
AppliedConstraint values compose a single Constraint with the Variable it applies to.
# Interfaces
Constraint implementations limit the circumstances under which a particular Variable can appear in a solution.
LitMapping performs translation between the input and output types of Solve (Constraints, Variables, etc.) and the variables that appear in the SAT formula.
No description provided by the author
No description provided by the author
Variable values are the basic unit of problems and solutions understood by this package.
# Type aliases
Identifier values uniquely identify particular Variables within the input to a single call to Solve.
NotSatisfiable is an error composed of a minimal set of applied constraints that is sufficient to make a solution impossible.