A Tree-like Knowledge Base Revision Algorithm
MA Shaoha · 1999
Knowledge base revision Is to add newknowledge Into the knowledge base， and to delete oldknowledge If It Is necessaryfor preservingconslstency． The recently proposedknowledge base revision methodsare all Intractable In general case． By restricting the structure of the knowledge base， a polynomial revisionalgorithm Is given In this paper when the corresponding constraint graph of the knowledge base Is a tree． In theconstraint tree， the authors use a bottomup process to get the revision knowledge base．