Algorithms for Multiple Contraction and an Application to OWL Ontologies

Description Logics are the basis for the OWL language, which is the standard to represent ontology´s on the web. As knowledge is usually not static, it is important to be able to revise and repair knowledge bases described in Description Logics. Belief Revision deals with the problem of revising a knowledge base by incoming information. In this paper we propose algorithms for operations that accept as incoming information a set of sentences, instead of the usual single sentence and we present an implementation as a plug-in for Protégé, the most widely used ontology editor nowadays.