Boolean expressions and relations
[Direct modelling]
Collaboration diagram for Boolean expressions and relations:
|
Detailed Description
Boolean expressions can be freely composed of variables with the usual connectives and reified linear expressions.Boolean relations are obtained from Boolean expressions with functions tt (stating that the expression must be true) and ff (stating that the expression must be false).
Namespaces | |
| namespace | Gecode |
| Gecode toplevel namespace. | |
Functions | |
| Gecode::MiniModel::BoolExpr | operator! (const Gecode::MiniModel::BoolExpr &) |
| Negated Boolean expression. | |
| Gecode::MiniModel::BoolExpr | operator && (const Gecode::MiniModel::BoolExpr &, const Gecode::MiniModel::BoolExpr &) |
| Conjunction of Boolean expressions. | |
| Gecode::MiniModel::BoolExpr | operator|| (const Gecode::MiniModel::BoolExpr &, const Gecode::MiniModel::BoolExpr &) |
| Disjunction of Boolean expressions. | |
| Gecode::MiniModel::BoolExpr | operator^ (const Gecode::MiniModel::BoolExpr &, const Gecode::MiniModel::BoolExpr &) |
| Exclusive-or of Boolean expressions. | |
| Gecode::MiniModel::BoolExpr | operator~ (const Gecode::MiniModel::LinExpr &) |
| Reification of linear expression. | |
Function Documentation
|
|
Negated Boolean expression.
Definition at line 154 of file bool-expr.icc. |
|
||||||||||||
|
Conjunction of Boolean expressions.
Definition at line 125 of file bool-expr.icc. |
|
||||||||||||
|
Disjunction of Boolean expressions.
Definition at line 133 of file bool-expr.icc. |
|
||||||||||||
|
Exclusive-or of Boolean expressions.
Definition at line 141 of file bool-expr.icc. |
|
|
Reification of linear expression.
|