But KGs are relational multi-graphs, entities are connected by typed relations.
we design a particular method for computing A of a KG; we let a ij ∈ A indicate to what extent the information of alignments propagates from the i-th entity to the j-th entity.