Universality and prediction in business rules
Résumé
Business Rules have the form if condition then action. A Business Rules program, which can be executed by means of an interpreter, is a sequence of Business Rules. Motivated by IBM use cases, we look at the problem of setting parameter values in a given Business Rules program so it will achieve a given average goal over all possible instances. We explore the following fundamental question: is there a general learning algorithm which addresses this issue? We prove the answer is negative. On the positive side, we derive operational semantics for Business Rules programs. As a proof of concept, we show empirically that these can be used to detect potential non-termination situations.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...