A tree-based approach for verifying completeness and consistency in rule-based systems

摘要

Verification of a rule base is necessary both at its initial construction and at each change to its contents. Two main elements of verification are completeness and consistency. Current verification methods become unwiedly and impractical for all but small rule bases. This paper present a new method based on a disjoint tree approach. This approach has the potential to carry out verification for completeness and consistency in a more efficient manner than alternative approaches.