Universality and prediction in business rules

Business rules (BR) have the form ⟨if condition then action⟩. A BR program, which can be executed by means of an interpreter, is a sequence of business rules. Motivated by International Business Machines use cases, we look at the problem of setting parameter values in a given BR program so it will a...

Full description

Saved in:
Bibliographic Details
Published inComputational intelligence Vol. 34; no. 2; pp. 763 - 785
Main Authors Wang, Olivier, Sainte Marie, Christian, Ke, Changhai, Liberti, Leo
Format Journal Article
LanguageEnglish
Published Hoboken Blackwell Publishing Ltd 01.05.2018
Wiley
Subjects
Business
business rules
Computer Science
Machine learning
operational semantics
Operations Research
Semantics
statistical learning
Turing‐completeness
Turing-completeness
Business rules
Operational semantics
Statistical learning
Online AccessGet full text
ISSN0824-7935
1467-8640
1467-8640
DOI10.1111/coin.12174

Cover

More Information
Summary:Business rules (BR) have the form ⟨if condition then action⟩. A BR program, which can be executed by means of an interpreter, is a sequence of business rules. Motivated by International Business Machines use cases, we look at the problem of setting parameter values in a given BR 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 BR programs. As a proof of concept, we show empirically that these can be used to detect potential nontermination situations.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0824-7935
1467-8640
1467-8640
DOI:10.1111/coin.12174