Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
