English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Business rules that apply within a business context must be formulated in a comprehensible way to allow validation by their stakeholders, but at the same time they must be specified with enough precision to assure their correct implementation in computer applications. These opposing demands of business rule modeling are not easily reconciled. Formal rule modeling languages may be exact but they are often lacking in understandability, whereas controlled natural languages are more easily understood but generally fall short in exactness. We use Relation Algebra as the foundation to set up a controlled language for declarative business rules that is compatible with practical demands, such as laid out in the Business Rules Manifesto. Our version of controlled language comprises just five language statements that are orthogonal by design, which makes for a language that is suited for use by novice business rule modelers. The language lets users set up a business vocabulary that stakeholders can understand, and it allows to specify business rules about the objects in the vocabulary in a comprehensible if-then syntax. Rules expressed in our language are precise enough to permit the automatic generation of a prototype information system which is guaranteed to comply with the rules. Stakeholders can explore this prototype to verify the vocabulary, and to check whether the specified rules are valid and match their original intent of the business context. We show how we can ascertain correctness of our language and metamodel, by adopting a reflective approach and subject our context to rule analysis and specification, just like any other business context. It provides us with a prototype system that lets us explore the rules about rules, and validate the rule compliance.

A Relation-Algebra Language to Specify Declarative Business Rules