• Smart Agents Technology
• Neural Networks
• Case-based Reasoning
• Fuzzy Logic
• Genetic Algorithms
• Business Rules
• Optimization Suite >>
• Data Mining
• Text Mining
• Velocity Analyzer

Optimization Suite

Constraint programming is a programming paradigm wherein relations between variables are stated in the form of constraints. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found. This makes constraint programming a form of declarative programming.

The CP paradigm consists of a set of variables, each of which have a set of possible values (their domain) and a set of constraints between the variables that specify which combinations of values are allowed and which are not.

Brighterion's constraint programming technology is a complete language that integrates the following concepts:

Variables: Real numbers, integers, enumerated, sets, matrices, vectors, intervals, fuzzy subsets and more.

Arithmetic Constraints: : =, +, -, *, /, /=, >, <, ≥, ≤, interval addition, interval subtraction, interval multiplication, interval division, max, min, intersection, union, exponential, modulo, logarithm and more.

Temporal Constraints: Temporal constraints including equal, nequal, before, after, meets, overlaps, starts, finishes and personal temporal operators such as disjoint, started-by, overlapped-by, met-by, finished-by and more.

Boolean Constraints: Or, and, not, xor, implication, equivalence

Symbolic Constraints: Inclusion, union, intersection, cardinality, belonging and more.

Fuzzy Constraints: To achieve the best possible solution in cases where no exact solution exists.

Brighterion's constraint programming technology relieves programmers of the burden of learning a new language. Most programmers can generate their first optimization program in less than one hour.