Hypothesis language
Given a database D with relations R and "foreign key"
links F, the hypothesis language is the set of conjunctions of atoms
C = A1 & ... & An
where
-
A1 = r0(V11, ..., V1a)
for r0 of arity a
-
Ai = r(Vi1, ..., Via) where
r Î R with arity a
-
Ai = Vj [<|=|>] v for a value v
in the value hierarchy of Ai
such that
-
two literals share a variable only if there is corresponding
link (cf. modes)
-
no variable is more than i steps away from r0.
e.g. D={r0, r1, r2, r3,
...}, F = {r0[2]->r1[1], r0[3]->r2[1],
r1[2]->r3[1], r2[2]->r3[2],
i=2.
H = r0(X,Y,Z) & r1(Y,U) &
r2(Z,R) & r3(U,R) & X = x0 &
U=a.
