Assertional-based Prioritized Removed Sets Revision of DL-LiteR Knowledge Bases

The paper proposes an extension of "Prioritized Removed Sets Revision" (PRSR) to DL-LiteR stratified knowledge bases. The revision strategy is based on inconsistency minimization and consists in determining smallest subsets of assertions to be dropped from the current DL-LiteR knowledge base, taking the stratification into account, in order to restore consistency and accept the input. We consider different forms of input: membership assertion, positive inclusion axiom or negative inclusion axiom. We show that according to the form of input and under some conditions PRSR can be achieved in polynomial time.