Semantics of the Underlying Mechanism

Given a collection of form fields $F_1$,$F_2$,....$F_n$ and associated relationships $\mathbb{R}_1$, $\mathbb{R}_2$,.... $\mathbb{R}_m$ in the form of predicates. An iteration can be defined that does the following for each form field $F_i$:

• evaluate the current relationship based on all form field values; and
• update the field value based on new current relationship.

The update of the field varies; for an unknown field the update takes the form of filling the field with the deduced value whereas, for a known field the update takes the form of overwriting the current field value. It is possible to give an upper bound to the number of iterations that are performed before a fixed-point is reached. For simple forms it is either 1 or 2 iterations.