Mentioned in ?
References in periodicals archive ?
By f, t we denote empty set 0 and singleton set {<>}, respectively (with the empty tuple <> i.e., the unique tuple of 0-ary relation), which may be thought of as falsity f and truth t, as those used in the relational algebra.
This minimal distance is initially the sum over all distances in DistTable (an upper limit), and the corresponding route is an empty tuple. Then, the master deposits the initial routes into tuple space WORK, and spawns NumWorker worker processes in active tuples to compute the search tree in parallel.
These programs have zero arity output relations that either contain the empty tuple (true) or no tuples (false).