An on-going theme in Information Systems research is the methods by which business rules are gathered and implemented. Additionally, many efforts have been made to develop reusable algorithms for processing business rules to reduce system development, testing, and maintenance time. The objective of this paper is to present a reusable algorithm for condition-action rules that are applied to finite static lists. More importantly, the algorithm is generalized for complex rules that are complicated by differences in user authorizations and other dependencies.
Giddens, Terri D. and Gaasch, Kevin E.
"The development of a business rules engine: A condition-action rule algorithm for finite static lists,"
Journal of International Information Management: Vol. 12
, Article 4.
Available at: http://scholarworks.lib.csusb.edu/jiim/vol12/iss1/4