cottax.relational.classification module¶

What makes an answer right, read off the relations. Each predicate answers False for a node that is not a RelationalCondition.

is_optimise(node: object)[source]¶

Exactly one objective. is_unconstrained_optimise / is_constrained_optimise.

is_equalities(node: object)[source]¶

No objective, every relation an equality. is_fixed_point / is_root_find.

is_unconstrained_optimise(node: object)[source]¶

An optimise with no relation beside the objective.

is_constrained_optimise(node: object)[source]¶

An optimise with relations to respect as well.

is_feasibility(node: object)[source]¶

No objective and an inequality among the relations: any point satisfying them will do.

is_fixed_point(node: object)[source]¶

Equalities of which every one is u = g (fixed_point_shaped).

fixed_point_shaped(relations: tuple, unknowns: tuple)[source]¶

Whether every relation is u = g: one of unknowns on the left, and a place on the right.

is_root_find(node: object)[source]¶

Every other system of equalities: a(x) = b(x), which is c(x) = 0 WLOG.