Abstract
In the process of ontology management, it is important to be able to add or remove onsequences, while preserving as much of the original ontology as possible. When these updates are made iteratively, this minimum change criterion is harder to satisfy. We propose a context-based method that stores the information about all the possible outcomes of an update compactly. Using it, we are guaranteed to find all the optimal solutions for an iterative update problem, and reason directly over them. We present a prototype implementation that can be used as a Protégé plug-in.