Package javax.constraints

This package describes a generic Java programming interface for Constraint Programming (CP API) - see www.jcp.org .

See: Description

Interface Summary

Interface	Description
ConstrainedVariable	This is a base interface for all constrained variable.
Constraint	The interface Constraint defines a generic interface for all constraints that could be created and posted within the Problem.
Problem	A constraint satisfaction problem Problem can be defined in terms of constrained variables and constraints.
SearchStrategy
Solution	This interface defines a solution of a Problem.
SolutionIterator	This is an interface that allows a user to search and to iterate through multiple solutions.
Solver	The interface Solver is used for Problem Resolution and utilizes concepts of Search Strategies and Solutions.
ValueSelector	This is a common interface for selection of a value from the domain of a constrained variable.
Var	This interface represents constrained integer variables, the most frequently used type of constrained objects.
VarBool	This interface represents constrained boolean variables that can be seen as integer constrained variables with the domain { 0, 1 } but with a potentially more efficient implementation.
VarMatrix	A VarMatrix is a two-dimensional array of Var objects
VarReal	This interface represents constrained real variables.
VarRealSelector	This is a common interface for selection of a constrained real variable from an array of real variables.
VarSelector	This is a common interface for selection of a constrained variable from an array of variables.
VarSet	This interface represents a constrained set variable which, when bound, is equal to a set of elements.
VarString	VarString are a special type of constrained variables that are defined using an array of string values.

Class Summary

Class	Description
ProblemDelegator
ProblemFactory

Enum Summary

Enum	Description
ConsistencyLevel
DomainType
Objective
Oper
OptimizationStrategy	These strategies are used by an optimization process implemented within the Solver's method findOptimalSolution(Objective objective, Var objectiveVar, OptimizationStrategy optStrategy) BASIC strategy iterates through solution assuming that each next solution has optimization objectives better than in a previous solution.
Probability
ProblemState
SearchStrategy.SearchStrategyType
ValueSelectorType
VarSelectorType

Exception Summary

Exception	Description
ConstraintException

Package javax.constraints Description

This package describes a generic Java programming interface for Constraint Programming (CP API) - see www.jcp.org .

CP API supports two clearly separated concepts:

• Problem Definition (class Problem): contains all Constrained Variables and Constraints that define and control relationships between constrained objects
• Problem Resolution (class Solver): contains search algorithms for finding problem solutions.

The Constrained Variables are represented in form of Java objects which may use the predefined constrained variables types such as Var, VarBool, VarReal, and VarSet.

The Constraints themselves are objects inherited from a generic class Constraint. The API covers major binary and global constraints required for the practical CP programming.

To find the problem solutions, the API uses predefined search algorithms expressed by class SearchStrategy. There are predefined methods that allow a user to find a feasible solution, all solutions, or an optimal solution.