Verification of confliction and unreachability in rule-based expert systems with model checking

TL;DR

This paper presents a method to verify conflicts and unreachable rules in rule-based expert systems by modeling them as finite state systems and applying model checking with UPPAAL, addressing state explosion issues.

Contribution

It introduces a novel approach of modeling rule-based systems as finite state transition systems and uses CTL logic with UPPAAL for efficient error detection.

Findings

Effective detection of conflicts and unreachability in rule-based systems

Reduced state space explosion compared to previous methods

Validated approach with practical examples

Abstract

It is important to find optimal solutions for structural errors in rule-based expert systems .Solutions to discovering such errors by using model checking techniques have already been proposed, but these solutions have problems such as state space explosion. In this paper, to overcome these problems, we model the rule-based systems as finite state transition systems and express confliction and unreachability as Computation Tree Logic (CTL) logic formula and then use the technique of model checking to detect confliction and unreachability in rule-based systems with the model checker UPPAAL.