Module satisfiability 

Satisfiability problems.

This module contains Boolean satisfiability problems:

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

Structs

CNFClause

A clause in conjunctive normal form (CNF).

KSatisfiability

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

Satisfiability

Boolean Satisfiability (SAT) problem in CNF form.

Functions

is_satisfying_assignment

Check if an assignment satisfies a SAT formula.