Issue No. 03 - June (1993 vol. 5)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.224193
<p>It is suggested that as rule-based system (RBS) technology gains wider acceptance, the need to create and maintain large knowledge bases will assume greater importance. Demonstrating a rule base to be free from error remains one of the obstacles to the adoption of this technology. An approach to RBS verification in which the system is modeled as a Petri net on which error detection is performed is presented. A set of propositions is formulated to locate errors of redundancy, conflict, circularity, and gaps in domain knowledge. Rigorous proofs of these propositions are provided. Difficulties in implementing a Petri net-based verifier and the potential restrictions of the applicability of this approach are discussed.</p>
Petri nets; rule-based system verification; knowledge bases; error detection; errors of redundancy; conflict; circularity; domain knowledge; knowledge based systems; Petri nets
D. Nazareth, "Investigating the Applicability of Petri Nets for Rule-Based System Verification," in IEEE Transactions on Knowledge & Data Engineering, vol. 5, no. , pp. 402-415, 1993.