The Learnability of Business Rules
Among programming languages, a popular one in corporate environments is Business Rules. These are conditional statements which can be seen as a sort of “programming for non-programmers”, since they remove loops and function calls, which are typically the most difficult programming constructs to master by laypeople. A Business Rules program consists of a sequence of “IF condition THEN actions” statements. Conditions are verified over a set of variables, and actions assign new values to the variables. Medium-sized to large corporations often enforce, document and define their business processes by means of Business Rules programs. Such programs are executed in a special purpose virtual machine which verifies conditions and executes actions in an implicit loop. A problem of extreme interest in business environments is enforcing high-level strategic decisions by configuring the parameters of Business Rules programs so that they behave in a certain prescribed way on average. In this paper we show that Business Rules are Turing-complete. As a consequence, we argue that there can exist no algorithm for configuring the average behavior of all possible Business Rules programs.
KeywordsBusiness Process Turing Machine Concept Class Inductive Logic Programming Business Rule
The first author (OW) is supported by an IBM France/ANRT CIFRE Ph.D. thesis award.
- 4.de Sainte Marie, C., Hallmark, G., Paschke, A.: RIF Production Rule Dialect, 2nd edn. W3C Recommendation (2013)Google Scholar
- 7.IBM. Operational Decision Manager 8.8 (2015)Google Scholar
- 8.Kepser, S.: A simple proof of the turing-completeness of XSLT and XQuery. In: Usdin, T. (ed.) Extreme Markup Languages 2004 (2004)Google Scholar
- 12.Shannon, C.: A Universal Turing machine with two internal states. In: Shannon, C., McCarthy, J. (eds.) Automata Studies. Annals of Mathematics Studies, vol. 34, pp. 157–165. Princeton University Press, Princeton (1956)Google Scholar
- 15.Wang, O., Kai, C., Liberti, L., De Sainte Marie, C.: Business rule sets as programs: turing-completeness and structural operational semantics. In: Treizièmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA 2015) (2015)Google Scholar
- 16.Wang, O., Liberti, L., D’Ambrosio, C., Sainte Marie, C., Ke, C.: Controlling the average behavior of business rules programs. In: Alferes, J.J.J., Bertossi, L., Governatori, G., Fodor, P., Roman, D. (eds.) RuleML 2016. LNCS, vol. 9718, pp. 83–96. Springer, Heidelberg (2016). doi: 10.1007/978-3-319-42019-6_6 CrossRefGoogle Scholar