Despite the large variety of existing graph transformation tools, the implementation of their pattern matching engine typically follows the same principle. First a matching occurrence of the left-hand side of the graph transformation rule is searched by some graph pattern matching algorithm. Then potential negative application conditions are checked that might eliminate the previous occurrence....

Partial Label Learning (PLL) aims to learn from the data where each training example is associated with a set of candidate labels, among which only one correct. The key deal such problem disambiguate label sets and obtain correct assignments between instances their labels. In this paper, we interpret as instance-to-label matchings, reformulate task PLL matching selection problem. To model probl...

It has recently been shown that two-loop kite-type diagrams can be computed analytically in terms of iterated integrals with algebraic kernels. This result was obtained using a new integral representation for sunset subgraphs. In this paper, we have developed similar three-loop banana $d = 2-2\varepsilon$ dimensions. answer generalized up to any given order the $\varepsilon$-expansion and calcu...