let a be the set of all
advertisements in a given advertisement repository.
for a given query or advertisement, Q, the matchmaking
algorithm of the repository host returns the set of all advertisements which are compatible, matches(Q):
a
set of descriptions are compatible if their intersection is satisfiable: