Abstract

The need for demonstrating a rule-based system to be free from error has been widely acknowledged. Interactions among rules and frequent updates to system knowledge make verification a difficult task. This paper presents an alternative approach to rule-based verification, wherein the system is modelled as a directed graph. Several propositions concerning detection of errors are formulated and proved. A conceptually simple algorithm is developed to detect errors. Time complexity analyses concerning detection effort are also presented. Given the greater coverage of errors afforded by this approach over prior strategies, graph-theoretic verification of rule-based knowledge would appear to be a viable verification strategy.

Full Text
Paper version not known

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 call

Disclaimer: 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.