Constraint Calculus
[ Back ] [ Home ] [ Next ]

 

Constraints as Data
Potential Apps
Query by Example
Query by Example
Query by Example
More Examples
Model and Language
Main Features
Hosting Iterative Lang.
Constraint Calculus
Constraint Calculus
Polynomial Complexity
Query Evaluation
Functionality
Optimization
Optimization
Optimization
Optimization
Implemented Apps
Implemented Apps

Constraint Calculus and Multi-typed Algebra

The multi-typed constraint algebra, depicted in the figure below, is based on eight inter-related CST classes (families) and designed to provide the balance between expressiveness, complexity and representation usefulness. The main idea of the CST algebra is to provide (FO + LINEAR) expressiveness, while guaranteeing polynomial complexity for each operation, in the size of symbolic representation of the input. This is done by compromising, as little as possible, the representation usefulness, i.e., the canonical form of the result, which indicates how much the resulting constraint should be "simplified".

cst2.bmp (1304962 bytes)


presentation created by Victor E. Segal