3 ms·
The definition seems faulty to me, since the pair (E: subset(N × N), f: E → L) does not admit of multiple edges with different labels, connecting the same order
by zozbot234 6y ago
The definition seems faulty to me, since the pair (E: subset(N × N), f: E → L) does not admit of multiple edges with different labels, connecting the same ordered pair of nodes. Of course this is most often allowed in practical KG's.
- mmarx 6y agoIndeed multiple edges (with different labels) are quite useful, particularly when you want to represent RDF graphs. But since there is no restriction on the form of L, you can still represent those by, e.g., letting L be a set of sets of IRIs, and thus labelling your edges with sets of IRIs, which you then interpret as a set of RDF triples (i.e., as a set of edges).
- contravariant 6y agoYeah it's not ideal. Also with the current preference for category theory it would probably make more sense to not phrase E as a subset of NxN but rather to define two functions pre: E -> N and post: E -> N. You could then choose to add labels as either an additional function label: E -> L, or as several graphs layered on top of one another (especially helpful when you view each graph as an arrow N -> N, which in turn makes more sense when you have several different classes of nodes). If anyone's interested I'm loosely basing this description on the description of petri nets as outlined in Tai-Danae Bradley's interesting (and readable) Applied Category Theory: https://arxiv.org/pdf/1809.05923.pdf https://arxiv.org/pdf/1809.05923.pdf