A language to specify declarative business rules

Abstract

Business rules should be formulated in a comprehensible way to allow validation by business stakeholders. At the same time, rules must be precise enough precision to assure their correct implementation in computer applications. These opposing demands of business rule modeling are not easily reconciled. We outline a language to specify declarative business rules that is both compatible with practical demands, such as laid out in the Business Rules Manifesto. Our language is founded on the theory of Relation Algebra, and comprises just five language statements. They are orthogonal by design, making for a language that is suited for use by novice business rule modelers. The rules, employing a vocabulary as understood and explained by business stakeholders, are expressed in a comprehensible if-then syntax.