A reconstruction of multipreference closure

Abstract

The paper describes a preferential approach for dealing with exceptions in KLM preferential logics, based on the rational closure. It is well known that rational closure does not allow an independent handling of inheritance of different defeasible properties of concepts. In this work, we consider an alternative closure construction, called Multi Preference closure (MP-closure), which has been first considered for reasoning with exceptions in DLs. We reconstruct the notion of MP-closure in the propositional case and show that it is a natural (weaker) variant of Lehmann's lexicographic closure, which appears to be too bold in some cases. The MP-closure defines a preferential consequence relation that, although weaker than lexicographic closure, is stronger than Relevant Closure.