1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/// Represents the assignment of variables in a SAT solver.
/// The `cdcl` module implements the Conflict-Driven Clause Learning (CDCL) algorithm for SAT solving.
/// The `cnf` module provides functionality for working with Conjunctive Normal Form (CNF) representations.
/// The `clause_management` module handles the management of clauses in a SAT solver.
/// The `clause_storage` module provides storage and retrieval mechanisms for clauses in a SAT solver.
/// The `cnf` module provides functionality for parsing and manipulating CNF (Conjunctive Normal Form) formulas.
/// The `conflict_analysis` module implements conflict analysis techniques used in SAT solvers.
/// The `dimacs` module handles parsing DIMACS format files, which are commonly used for representing SAT problems.
/// The `dpll` module implements the DPLL (Davis-Putnam-Logemann-Loveland) algorithm for SAT solving.
/// The `expr` module provides functionality for working with Boolean expressions, including parsing and manipulation.
/// The `heuristic` module implements various heuristics for variable selection and decision-making in SAT solvers.
/// The `literal` module provides functionality for working with literals in SAT problems.
/// The `propagation` module implements unit propagation and other propagation techniques used in SAT solvers.
/// The `restarter` module implements restarts in SAT solvers, which can help escape from difficult regions of the search space.
/// The `solver` module provides the main interface for solving SAT problems using various algorithms and techniques.
/// The `trail` module implements a trail data structure used in SAT solvers to keep track of variable assignments and decisions.
/// The `variable_selection` module implements various strategies for selecting variables during the solving process.