Abstract
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 recent work, we have addressed the poor scalability to larger systems of the ATMS-inspired computation methods commonly applied to rule-chain anomaly checking. To tackle this problem, we introduced a novel anomaly checking method based on binary decision diagrams (BDDs), a technique emanating originally from the hardware design community. In this paper, we present further empirical evidence of its computational efficiency on real-life rule bases. In addition, we will investigate the issue of BDD variable ordering, and its impact on the efficiency of the computations. Thereby, we will also assess the utility of dynamic reordering.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
de Kleer, J.: An assumption-based TMS. Artificial Intelligence 28(2), 127–162 (1986)
Ginsberg, A.: Knowledge-base reduction: a new approach to checking knowledge bases for inconsistency & redundancy. In: Proc. of the 7th National Conf. on Artificial Intelligence (AAAI 1988), pp. 585–589 (1988)
Horiyama, T., Ibaraki, T.: Ordered binary decision diagrams as knowledge-bases. Artificial Intelligence 136(2), 189–213 (2002)
Levy, A., Rousset, M.-C.: Verification of knowledge bases based on containment checking. Artificial Intelligence 101(1-2), 227–250 (1998)
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)
Preece, A., Shinghal, R.: Foundation and application of knowledge base verification. Intl. Journal of Intelligent Systems 9(8), 683–701 (1994)
Preece, A., Shinghal, R., Batarekh, A.: Principles and practice in verifying rule-based systems. The Knowledge Engineering Review 7(2), 115–141 (1992)
Rousset, M.-C.: On the consistency of knowledge bases: the Covadis system. Computational Intelligence 4, 166–170 (1988)
Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proc. of the 1993 IEEE/ACM Intl. Conf. on Computer-Aided Design (ICCAD 1993), pp. 42–47. IEEE Computer Society Press, Los Alamitos (1993)
Torasso, P., Torta, G.: Computing minimum-cardinality diagnoses using OBDDs. In: Günter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol. 2821, pp. 224–238. Springer, Heidelberg (2003)
Tsai, W.-T., Vishnuvajjala, R., Zhang, D.: Verification and validation of knowledge-based systems. IEEE Transactions on Knowledge and Data Engineering 11(1), 202–211 (1999)
Vanthienen, J., Mues, C., Aerts, A.: An illustration of verification and validation in the modelling phase of KBS development. Data and Knowledge Engineering 27(3), 337–352 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mues, C., Vanthienen, J. (2004). Improving the Scalability of Rule Base Verification Using Binary Decision Diagrams: An Empirical Study. In: Biundo, S., Frühwirth, T., Palm, G. (eds) KI 2004: Advances in Artificial Intelligence. KI 2004. Lecture Notes in Computer Science(), vol 3238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30221-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-30221-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23166-0
Online ISBN: 978-3-540-30221-6
eBook Packages: Springer Book Archive