# Package edu.uky.ai.csp.kr

Contains the knowledge representation for constraint satisfaction problems that use simple binary equals and not equals constraints.

- Class Summary
  Class | Description
  --- | ---
  Constraint | A constraint specifies requirements that any solution to the problem must meet.
  Domain | A domain is the set of values that a variable might possibly be assigned.
  EqualsConstraint | Constrains two variables to have the same value.
  NotEqualsConstraint | Constrains two variables to have different values.
  Problem | A constraint satisfaction problem is composed of variables (each with a set of potential values called a domain) and constraints on the values those variable can be assigned.
  Solution | A solution to a constraint satisfaction problem is an assignment of values to the problem's variables.
  Variable | A variable can be assigned one of several possible values.