Improving the quality of rule-based applications using the declarative verification approach
by Sergey Lukichev
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 1, No. 3, 2011

Abstract: The quality of rule-based applications depends on the quality of rules. However, due to various reasons, for instance communication problems between business people and rule modellers, rules may become inconsistent, incomplete or redundant. A particular way to control and to improve the rule quality is by means of rule verification. In this paper, we present a rule-based (declarative) approach to rule verification. We consider several anomalies, which may appear in rule bases with production rules and semantic constraints. The presented approach defines special rules, called verifier rules, which derive facts when anomalous business rules are detected. The approach is flexible and easy to maintain in the sense that verifier rules can easily be added or modified if new anomalies are found and have to be detected.

Online publication date: Sat, 07-Mar-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com