loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Lex Wedemeijer

Affiliation: Open University, Netherlands

Keyword(s): Declarative Business Rules, Relation Algebra, Modeling Language, Metamodeling, Rule Compliance.

Abstract: 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 stakeholder s 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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.142.210.173

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Wedemeijer, L. (2014). A Relation-Algebra Language to Specify Declarative Business Rules. In Proceedings of the Fourth International Symposium on Business Modeling and Software Design - BMSD; ISBN 978-989-758-032-1, SciTePress, pages 63-73. DOI: 10.5220/0005424400630073

@conference{bmsd14,
author={Lex Wedemeijer.},
title={A Relation-Algebra Language to Specify Declarative Business Rules},
booktitle={Proceedings of the Fourth International Symposium on Business Modeling and Software Design - BMSD},
year={2014},
pages={63-73},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005424400630073},
isbn={978-989-758-032-1},
}

TY - CONF

JO - Proceedings of the Fourth International Symposium on Business Modeling and Software Design - BMSD
TI - A Relation-Algebra Language to Specify Declarative Business Rules
SN - 978-989-758-032-1
AU - Wedemeijer, L.
PY - 2014
SP - 63
EP - 73
DO - 10.5220/0005424400630073
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic