1. end if 10: end for 11: else if ? is an deletion then 12: for all (a 1;S K ? K ? ? 2: Ai;CC ? guide search(AI, G) 4: if ? is an addition then 5: QC ? map impact(CC, Q, ?) 6: for all {a 1 , ..., a n } ? QC n s.t. DVar(Q) = n do 7: if K | = Q c
2. Matching events in a content-based subscription system;M K Aguilera;Symposium on Principles of Distributed Computing,1999
3. On the logic of theory change: Partial meet contraction and revision functions;C E Alchourr�n;Journal of Symbolic Logic,1985
4. Efficient filtering of XML documents for selective dissemination of information;M Altinel;The VLDB Journal,2000