You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 2 Current »

In Quaestor, a CONSTRAINT is a mathematical expression consisting of:

f(u1,u2,...,un) {=,<,etc.} g(v1,v2,...,vn)

or of sets in this form separated by logical operators (AND, OR, etc.) and nested by parentheses, if any. The CONSTRAINT expresses the validity of the Relation to which it is referring and must be either TRUE or PENDING before its admission into the template. The term constraint in normal print refers to a concept local to that paragraph.

Functions Overview QuaestorSyntax



  • No labels