Mathematical representation for the rule of the production rule system Drools

Abstract

Computational science is a source of many technological paradigms as declarative programming. Declarative programming is used in industries that want to reach optimal processing. Drools is a rule engine allowing this declarative programming. For classical programs (imperative programming), many verifying programs exist tocheckthebehavioroftheseprograms,dependingonlyonthecode. Foraprogram based on declarative programming, the technics of verification are not common. This thesis purposes a mathematical representation for the rule of the business rule management system: Drools. This representation is used to define two main errors for a set of rules: overlap and subsumption. Then, a presentation of the program developed is done.