Priority-Based Merging Operator Without Distance Measures

摘要

This paper proposes a refinement of the PS-Merge merging operator, which is an alternative merging approach that employs the notion of partial satisfiability rather than the usual distance measures. Our approach will add to PS-Merge a mechanism to deal with a kind of priority based on the quantity of information of the agents. We will refer to the new operator as Pr-Merge. We will also analyze its logical properties as well its complexity by conceiving an algorithm with a distinct strategy from that presented for PS-Merge.