We pursue an account of merging through the use of geodesic semantics, the semantics based on the length of the shortest path on a graph. This approach has been fruitful in other areas of belief change such as revision and update. To this end, we introduce three binary merging operators of propositions defined on the graph of their valuations and we characterize them with a finite set of postulates.

Merging beliefs depends on the relative reliability of their sources. When this is information is absent, assuming equal reliability is unwarranted. The solution proposed in this article is that every reliability profile is possible, and only what holds according to all of them is accepted. Alternatively, one source is completely reliable, but which one is not specified. These two cases motivate two existing forms of merging: maxcons-based merging and disjunctive merging.