Module formula 

Logic and formula problems.

Problems whose input is a boolean formula or circuit:

• Satisfiability: Boolean satisfiability (SAT) with CNF clauses
• KSatisfiability: K-SAT where each clause has exactly K literals
• CircuitSAT: Boolean circuit satisfiability

Structs

Assignment

An assignment in a circuit: outputs = expr.

BooleanExpr

A boolean expression tree.

CNFClause

A clause in conjunctive normal form (CNF).

Circuit

A boolean circuit as a sequence of assignments.

CircuitSAT

The Circuit SAT problem.

KSatisfiability

K-Satisfiability problem where each clause has exactly K literals.

Satisfiability

Boolean Satisfiability (SAT) problem in CNF form.

Enums

BooleanOp

Boolean expression node types.