| Interface | Description |
|---|---|
| Constraint |
A constraint specifies the allowable combinations of values for a set of
variables.
|
| CSPStateListener |
Interface which allows interested clients to register at a solution strategy
and follow their progress step by step.
|
| Class | Description |
|---|---|
| AC3Strategy |
Artificial Intelligence A Modern Approach (3rd Ed.): Figure 6.3, Page 209.
|
| Assignment |
An assignment assigns values to some or all variables of a CSP.
|
| BacktrackingStrategy |
Artificial Intelligence A Modern Approach (3rd Ed.): Figure 6.5, Page 215.
|
| CSP |
Artificial Intelligence A Modern Approach (3rd Ed.): Section 6.1, Page 202.
A constraint satisfaction problem or CSP consists of three components, X, D, and C: X is a set of variables, {X1, ... |
| Domain |
A domain Di consists of a set of allowable values {v1, ...
|
| DomainRestoreInfo |
Provides informations which might be useful for a caller of a constraint
propagation algorithm.
|
| ImprovedBacktrackingStrategy | |
| MinConflictsStrategy |
Artificial Intelligence A Modern Approach (3rd Ed.): Figure 6.8, Page 221.
|
| SolutionStrategy |
Base class for CSP solver implementations.
|
| TreeCSPSolver |
Artificial Intelligence A Modern Approach (3rd Ed.): Figure 6.11, Page
224.
|
| Variable |
A variable is a distinguishable object with a name.
|
| Enum | Description |
|---|---|
| ImprovedBacktrackingStrategy.Inference | |
| ImprovedBacktrackingStrategy.Selection |