You are viewing an old version of this page. View the current version.

Compare with Current View Page History

« Previous Version 7 Next »

Explanation

This rule checks whether boolean logic in an expression can be simplified. If so, the simplified expression is reported as issue.

It applies common laws of boolean algebra, like

  • the distributive law: (A OR B) AND (A OR C) = A AND (B OR C)
  • the absorption law: A OR (A AND B) = A
  • the absorption law: A AND (A OR B) = A
  • the double negation law: NOT ( NOT A ) = A
  • ...

We estimate that resolving this issue will on average take 5 minutes.

Possible improvement

See if the suggestion you get for simplification is equally understandable (or better) for a business engineer, and if so replace the expression with the suggested expression.

Example

This example expression is quite simple, and probably easy for any business engineer to simplify. It is just to illustrate the concept, and you can imagine that it also works for bigger boolean expressions that are harder for humans to comprehend.

The BMA detects that this expression can be simplified (by applying the absorption law), and gives this suggestion:

...and yes, a decision table would be even better in this case.

  • No labels