Package solver implements a general-purpose solver for boolean constraint satisfiability problems.

IdentifierFromString returns an Identifier based on a provided string.

AppliedConstraint values compose a single Constraint with the Variable it applies to.

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.

Variable values are the basic unit of problems and solutions understood by this package.

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.