Thank you for your answers.
I tried this approach (which yields much more elegant rules), but i'm afraid
it does not perform very well.
If I insert 1 Offers and then 1 bid, it takes too much time to execute.
If understand correctly it's because of the "not Offer(creationTimestamp <
$ct)" c
ffers is so important it ought to be represented as
> fact data. If it cannot be added to the Offer itself, a proxy fact
> could be created, combining a counter with an Offer reference. A high
> salience rule for an Offer without OfferProxy would create this.
>
> -W
>
> On Mon
Thank you for your reply!
I understand your approach, and I think it could work if Offers were
inserted into the working memory after the Bid.
However, to implement your approach for already inserted Offers I think I
would need some way of forcing the matching Offer to be the oldest in
memory, is
