Study on knowledge base verification based on Petri nets

The comparison of rule pairs is usually involved in traditional approaches to verify knowledge base. The efficiency of these approaches is low when used in the verification of large-scale knowledge base because of the comparison. An alternative method of detecting logical errors in knowledge base is presented in this paper. This is achieved by analyzing the reachability and the transition sequence of Petri nets which is the established model of rule base.