problemreductions/models/formula/
mod.rs

1//! Logic and formula problems.
2//!
3//! Problems whose input is a boolean formula or circuit:
4//! - [`Satisfiability`]: Boolean satisfiability (SAT) with CNF clauses
5//! - [`KSatisfiability`]: K-SAT where each clause has exactly K literals
6//! - [`CircuitSAT`]: Boolean circuit satisfiability
7
8pub(crate) mod circuit;
9mod ksat;
10mod sat;
11
12pub use circuit::{Assignment, BooleanExpr, BooleanOp, Circuit, CircuitSAT};
13pub use ksat::KSatisfiability;
14pub use sat::{CNFClause, Satisfiability};