 If the belief set \(K\) has a finite base, then it can be represented by a single sentence, namely the conjunction \(k\) of all the elements of its base. This means that the revision \(K* p\) of a belief set \(K\) by a sentence \(p\) can be replaced by a revision \(k* p\) of a sentence by another sentence. If this revision is non-prioritized, we may treat \(k\) and \(p\) equally, so that \(k* p = p* k\). Such an operation can be described as the merging of two belief representations. It can represent a process of conflict resolution through selective combination of information from two agents or sources. This operation can also be generalized to the merge of several elements, representing efforts to combine information from several agents or sources (Konieczny and Pino Pérez 2011).