Our Jan-2018 Challenge deals with a popular business decision problem:  help merchants to define various promotions for their sales orders and to automatically decide which orders are eligible to which promotions. A simple example of promotion: reduce the total cost of the order by $3.50 if it contains at least 5 items 1108 and at least 4 items 2639. This challenge was generalized by M.Parish:

We’ve already received two different solutions using OpenRules and Corticon. This, simply formulated problem gives all BR/DMN vendors an opportunity to show how their products can compare different lists of objects. It would be especially interesting to compare already provided solutions with those which utilize DMN FEEL boxed expressions.