Efficient Rule Base Verification Using Binary Decision Diagrams
As their field of application has evolved and matured, the importance of verifying knowledge-based systems is now widely recognized. Nevertheless, some problems have remained. In this paper, we address the poor scalability to larger systems of the computation methods commonly applied to rule-chain anomaly checking. To tackle this problem, we introduce a novel anomaly checking method based on binary decision diagrams (BDDs), a technique emanating mainly from the hardware design community. In addition, we present empirical evidence of its computational efficiency, especially on rule bases with a deeper inference space.
KeywordsBoolean Function Rule Base Binary Decision Diagram Label Size Rule Instance
Unable to display preview. Download preview PDF.
- 2.Ginsberg, A.: Knowledge-base reduction: a new approach to checking knowledge bases for inconsistency and redundancy. In: Proc. of the 7th National Conf. on Artificial Intelligence (AAAI 1988), pp. 585–589 (1988)Google Scholar
- 5.Mues, C.: On the Use of Decision Tables and Diagrams in Knowledge Modeling and Verification. PhD thesis, K.U.Leuven, Dept. of Applied Econ. Sciences (2002)Google Scholar