Rules Verification and Validation

Rules Verification and Validation

Antoni Ligeza (AGH University of Science and Technology, Poland) and Grzegorz Nalepa (AGH University of Science and Technology, Poland)
DOI: 10.4018/978-1-60566-402-6.ch012
OnDemand PDF Download:
No Current Special Offers


In this chapter an introduction to verification of rules is presented. Logical models of rules, knowledge representation languages and inference rules are introduced in brief. Required characteristics of rulebased systems are analyzed and issues of formal verification techniques for rules are presented in details. The aim is to show how the quality of rules can be improved or kept at a relatively high level, even in environments with numerous active rules. This involves verification methods for rules discussing the expressive power issues of different rule representation logical languages. Moreover, verification checks for rules incorporating consistency, redundancy, completeness and minimal form are presented.
Chapter Preview

Introduction And Motivation

A Knowledge-Based System (KBS) for Business Intelligence (BI) applications can be composed of several heterogeneous components, such as database, fact base, text base, domain ontology specification, multimedia components, etc. However, the core component with respect to efficient knowledge processing is the Inference Engine (IE) operating on Business Rule-Base (BRB). Both the rule-base and the inference mechanism are responsible for efficient production of complete and correct output, fitting the current needs and generated in the right time.

A rule is a basic component of each operational Knowledge Base (KB); in principle, a rule is a statement of the generic form:

IF <conditions> THEN <conclusion>.

The IF part defines the preconditions, i.e. conditions under which the rule can be fired. The THEN part defined conclusions, decision, actions or jus a new fact deduced from the knowledge base. A set of particular inference rules is referred to as a Rule-Base (RB) or – when equipped with inference control mechanism (the so called inference engine) – a Rule-Based System (RBS).

A Business Rule (BR) is a compact statement about an aspect of business (Morgan, 2002). In fact, a business rule is an instance of a rule oriented towards business domain application. Typically, such a rule covers a chunk of knowledge of certain organization. Initially, such statements are expressed in (restricted) natural language. Contemporary BI applications can contain hundreds and thousands of rules (Morgan, 2002) which constitute mainly man-designed and hand-encoded input to the system. As such, they are prone to different types of errors. Before applying and during evolution of the system such rule bases should undergo several stages of analysis and improvement; this includes:

  • Refinement – a transformation from abstract, general, usually expressed in natural language form into a formal statement of rules in some knowledge-representation language of appropriate expressive power, syntax and semantics,

  • Verification – proving correctness of the set of rules in terms of some verifiable characteristics; in fact features such as consistency, completeness, and various features of correctness are checked with formal methods. Most of the knowledge engineering papers summarize this as answering the question: „Are we building the product right?”

  • Validation – checking if the set of rules provides correct answers to specific inputs. In other words, validation consists in assuring that the system is sound and fits the user requirements. Most of the knowledge engineering papers summarize this as answering the question: „Are we building the right product?”

  • Testing – means to undergo the system a number of runs on specially prepared data and comparing the obtained results with the correct (expected) ones. It is empirical investigation oriented towards evaluation of the rule set quality and discovering bugs.

  • Correction – is a process of localizing and removing bugs from the set of rules; rules can be modified or replaced by other rules. Certain unnecessary rules can be eliminated, and new rules can be added. Rules can be split to more detailed, specific rules and joined (glued) to form more general rules if necessary.

  • Improvement – even a correct rule base can be improved. This can be performed by various means: adding new rules, reduction of the rule set, tuning of rules, etc. The goal is to obtain better – in terms of specific quality measures – performance indicators.

Key Terms in this Chapter

Consistency: In terms of pure logic (the so-called logical consistency) a system is consistent if any legal inference does not lead to unsatisfiable statement.

Redundancy: A rule base is redundant if it contains more rules than necessary; this means that some of the rules can be removed without changing the inferencing possibilities of the original rule base. This includes the cases of identical rules, subsumed rules, equivalent rules, unusable rules (ones never fired).

Verification: Process formally checking the well-defined properties of a rule-based system against its formal specification,

Completeness: For every potential input there exists at least one user-defined rule that can be fired to react in a designed way to the input.

Determinism: A system is deterministic if for every potential input it produces a well-defined unique output; in case the same input and memory state enforces the same unique output to be generated.

Complete Chapter List

Search this Book: