
## 3 Representing Csp Instances 19

<integerExpression> ::=
"<cn>" <integer> "</cn>"
| "<ci>" <identifier> "</ci>" | "<apply> <minus/>" <integerExpression> "</apply>"
| "<apply> <abs/>" <integerExpression> "</apply>"
| "<apply> <plus/>" <integerExpression> <integerExpression> "</apply>" | "<apply> <minus/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <times/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <quotient/>" <integerExpression> <integerExpression> "</apply>" | "<apply> <rem/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <power/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <min/>" <integerExpression> <integerExpression> "</apply>" | "<apply> <max/>" <integerExpression> <integerExpression> "</apply>"
<booleanExpression> ::=
"<false/>"
| "<true/>"
| "<apply> <not/>" <booleanExpression> "</apply>" | "<apply> <and/>" <booleanExpression> <booleanExpression> "</apply>" | "<apply> <or/> <booleanExpression> <booleanExpression> "</apply>" | "<apply> <xor/> <booleanExpression> <booleanExpression> "</apply>"
| "<apply> <eq/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <neq/>" <integerExpression> <integerExpression> "</apply>" | "<apply> <gt/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <geq/>" <integerExpression> <integerExpression> "</apply>"
| "<apply> <lt/>" <integerExpression> <integerExpression> "</apply>" | "<apply> <leq/>" <integerExpression> <integerExpression> "</apply>"
For more information, see http://www.w3.org/Math or http://www.dessci.com/en/
support/tutorials/mathml/content.htm. For example, to represent X 6= Y ∧ |X −
Y | 6= Z, we can write:
<predicate name="P0">
<parameters> int X int Y int Z </parameters>
<expression>
<math>
<apply>
<neq/> <ci> X </ci> <ci> Y </ci>
</apply>
<apply>
<neq/> <apply>
<abs/> <apply> <minus/ > <ci> X </ci> <ci> Y </ci> </apply>
</apply>
<ci> Z </ci>
</apply>
</math>
</expression>
</predicate>

## 3.5.3 Postfix Representation

It is possible to insert a postfix representation (not fully described in this document) of the predicate expression by inserting in <expression> an element
<postfix>. For example, to represent X 6= Y ∧ |X − Y | 6= Z, we can write: