Specifying Constraints for Detecting Inconsistencies in A Conceptual Graph Knowledge Base

This paper proposes a strategy for representing constraints in a conceptual graph knowledge base. We describe a set of techniques for using these constraints to detect inconsistencies in a knowledge base by finding sets of nodes that are inconsistent with these constraints. The detection method is designed to be efficient. An algorithm was developed and analyzed and its computational complexity was found to be polynomial with respect to knowledge base size and number of child nodes for each constraint node.