<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>April</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Ownership Graphs and Reasoning in Corporate Economics</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Davide Magnanimi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Michela Iezzi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Banca d'</institution>
          <country country="IT">Italia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Politecnico di Milano</institution>
          ,
          <addr-line>Milan</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>1</volume>
      <issue>2022</issue>
      <fpage>0000</fpage>
      <lpage>0002</lpage>
      <abstract>
        <p>In corporate economics, the use of company ownership graphs has become instrumental in solving many critical problems for central banks, financial regulators, and national statistics agencies. In particular, National Central Banks (NCBs) treat and, sometimes, own company data for their key institutional goals in a variety of fields, e.g., anti-money laundering, or economic and statistical research. This paper aims at leveraging our experience with Automated Reasoning in Banca d'Italia, focusing on four real use cases typical in the financial domain: (i) Integrated Ownership, (ii) Company Control, (iii) Ultimate Controller, and (iv) Close Links. For each problem, we ofer a formalization, providing practical and real-world examples based on Bank of Italy's company ownership graph. Finally, we express each problem in the form of compact and eficient deductive rules in the Vadalog language, allowing us to obtain a trade-of between computational time and expressive power compared to standard query languages.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Contribution and Overview1. In this paper, we
illustrate four problems, i.e. Integrated Ownership, Company
Company ownership graphs are critical items in corpo- Control, Ultimate Controller and Close Links. These are
rate economics, with central banks, financial regulators, recurrent problems in the financial domain of company
and national statistics agencies relying on them heav- ownership. For each such problem, we report the
comily. The essential notion in these graphs is ownership: monly accepted definition, and we present and describe
edges are ownership links labelled with the proportion a possible formalization, in the form of deductive rules in
of shares a business or person  owns of a company , the Vadalog language, that allows both to have a
comwhile nodes are companies and people. Company graphs pact encoding of the problem and to address an eficient
are employed in various contexts, including calculating a solution to real and concrete problems and interests for
company’s total ownership of another, (chains of) control our Institution. The remainder of the paper is organized
relationships, collusion phenomena, collateral eligibility, as follows. In Section 2 we introduce the background
etc. National Central Banks (NCBs) deal with company of company ownership graph representations, as well
data in order to achieve key institutional goals in a variety as the Vadalog approach. In Section 3 we present the
of fields, including banking supervision, credit-worthiness Integrated Ownership concept. In Section 4 we define and
evaluation, anti-money laundering, insurance fraud de- give rules for the Company Control problem. Section 5
tection, economic and statistical research, and more. The describes the formalization for the Ultimate Controller
Bank of Italy, as a supervisory authority, is intensely in- problem, while in Section 6 we investigate the Close Links
terested in studying and extracting valuable insights from use case. Section 7 concludes the paper.
the corporate ownership network. The Italian Central
Bank owns the database of Italian companies, provided
by the Italian Chambers of Commerce. It contains high- 2. Preliminaries
quality, fine-grained data of Italian non-listed companies,
including information such as legal name, legal address, To present the use cases of interest, let us introduce some
incorporation date, shareholders, the composition of the general notions that will be used throughout the paper.
company board, historical data, and many others. Despite Definition 2.1 (Company Ownership Graph). A
Comthe database’s vastness and depth, it has been shown [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] pany Ownership Graph (, , ) is a directed weighted
that many of the issues of interest are dificult to tackle graph, such that:
with standard query languages. However, they can be
succinctly expressed as reasoning rules.
•  = {0, . . . , } is a set of nodes;
•  a set of edges of the form (, ), from node  to
      </p>
      <p>node ;
•  :  → R,  ∈ (0, 1] is a total weight function</p>
      <p>for edges.</p>
      <p>1The views and opinions expressed in this paper are those of the
authors and do not necessarily reflect the oficial policy or position
of Banca d’Italia.
(a) A simple indirect ownership.</p>
      <p>(b) Indirect ownership with a
selfloop.</p>
      <p>(c) Indirect ownership with a
strongly connected component.</p>
      <p>
        The weight (,  ) is the weight of edge (, ); an in the work of [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], and various approaches can be found.
edge (, ) exists if and only if (,  ) ̸= 0; further- As mentioned in a recent work [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], one could interpret
more self-loops are allowed, i.e.  = . In our context, Integrated Ownership as a notion of cumulative flow from
nodes represent companies or people, edges (, ) repre- one target company to another. Another way to see this
sent ownership with share (,  ). For ease of repre- problem is to think at the cash flow when dividends of
sentation, we denote (,  ) = (, ). a company  are distributed backwards and recursively
      </p>
      <p>In this paper, we formalize the Integrated Ownership, to all its shareholders. The actual percentage of the
divthe Company Control, Ultimate Controller and Close Links idends received by a shareholder , part of the same
problems by encoding them as sets of reasoning rules in ownership structure of , is equal to the accumulated
the Vadalog language. Vadalog is based on the Warded ownership from a company  to a company .
Datalog± family that generalizes Datalog by allowing Figure 1 shows three cases of ownership graphs.
Figthe existential quantification in the rule head while guar- ure 1a shows that company  receives dividends from
anteeing decidability and tractability in the presence of company 1 proportionally to the owned shares. In turn,
existential quantification and recursion. A rule is a first- company 1 also receives dividends from the profit of
comorder sentence of the form ∀¯∀¯(  (¯, ¯) → ∃¯  (¯, ¯)) , pany 2. Then, such last dividends are distributed again
where  (the body) and  (the head) are conjunctions among all the shareholders of company 1, which in the
of atoms. For brevity, we omit universal quantifiers and example is only . Therefore,  will eventually receive
denote conjunction by comma. The semantics of a set of a percentage of company 2’s dividends as well, and it is
rules is defined by the well-known chase procedure. indicated as the dashed pink edge from  to 2. A more</p>
      <p>In the reasoning rules, atoms can be either extensional interesting case is shown 1b. The number of shares that
(EDB) when they are immediately available in data stores ifrm 1 holds of itself (i.e., the self-loop in the ownership
(e.g. relational databases, graph databases, NoSQL stores, graph) are, de facto, removed from those available on
RDF stores, etc.) or intentional (IDB) when they are the market. Therefore, the real percentage of shares of
generated when needed as a consequence of a reasoning company 1 held by  is greater because the number of
process. In the formalizations that will follow in this shares efectively available on the market is less than
work, we adopt the convention of colouring extensional 100%. The example in Figure 1c is an even more complex
atoms in blue and intensional ones in red. scenario. In fact, the ownership relationships realize a
strongly connected component, i.e., a cyclical structure,
that behaves like self-loops do: it increases the actual
3. Integrated Ownership amount of shares held by the companies involved in the
cycle and, therefore, of all the accumulated ownership
relationships (e.g.,  → 2,  → 3,  → 4) that flow
through the cycle.</p>
      <p>In the realm of complex global economic systems, it
appears evident that companies could not be considered as
stand-alone entities. The concept of Integrated Ownership
helps quantify the ownership involvement of companies
in complex economic structures such as networks and
conglomerates. While the simple notion of ownership
identifies the direct connection from a company x to a
company y, the Integrated Ownership encompasses the
accumulated ownership from a company  to a company
, considering all the current ownership along with all
direct and indirect links. The Integrated Ownership
problem has been extensively investigated in the literature, as</p>
      <sec id="sec-1-1">
        <title>3.1. Definitions of Paths and Convergence</title>
        <p>Integrated Ownership is at the basis of all the subsequent
use cases that we will present in the remainder of the
paper, such as company control. A possible approach
for the Integrated Ownership computation is the one that
aims at formalizing the definition of directed paths in
the company ownership graph. This allows defining
Baldone ownership, which we will also refer to as Integrated
(a)
(b)
(c)
such that (,  + 1) ∈  for every  = 1, . . . , . For
a node  ∈  , we call  +() the set of edges of 
incoming into  and  − () the set of edges of  outgoing
from . We define the</p>
        <p>weight ( ) of a path  as
( ) = Π (, )∈ (,  ).</p>
        <sec id="sec-1-1-1">
          <title>A second step is the definition of the set of directed</title>
          <p>paths whose weight is higher than a fixed  threshold.</p>
        </sec>
        <sec id="sec-1-1-2">
          <title>This allows restricting the set of interests of all exist</title>
          <p>ing directed paths. To this purpose, we introduce the

− Baldone path.</p>
          <p>Definition 3.2.
 ( ).
and ( ) &gt;  , with  ∈ R
+ and 0 &lt;  ≤
path [, 1, . . . , , ] such that  ̸=  for  = 1, . . . , 
more, we denote the weight of an  − Baldone path as</p>
          <p>An  − Baldone path  from  to  is a</p>
        </sec>
        <sec id="sec-1-1-3">
          <title>We are now ready to define the  -Baldone ownership, i.e., the summation of all the possibly infinite  -Baldone paths from  to .</title>
          <p>Definition 3.3.</p>
          <p>The  -Baldone ownership of a company
 on a company  in a graph  is a function 
(, ) :
(, ) → R defined as ∑︀
∈
set of all possible  -Baldone paths from  to .
 (), where  is the</p>
        </sec>
        <sec id="sec-1-1-4">
          <title>Its generalization, the Baldone ownership is obtained</title>
          <p>This latter is our Integrated ownership.
by letting 
→ 0 in the definition of  -Baldone ownership.
for all (, ) ∈ , and (ii) if certain topological conditions
are present that are peculiar to the company ownership
graphs we dealt with.</p>
          <p>Definition 3.5.</p>
          <p>The Baldone ownership 
(, ) of a
company  on a company  converges if (, ) ≤ 1.
Theorem 3.1. For a given company ownership graph
(, , ), the Baldone ownership 
for all (, ) ∈  if and only if for each strongly
connected component  of , there exists at least one node
(, ) converges
 ∈  such that ∑︀</p>
          <p>()∈ +() (, ) ≤ 1.</p>
        </sec>
        <sec id="sec-1-1-5">
          <title>The proof of the theorem and further insights are beyond the scope of this paper.</title>
        </sec>
      </sec>
      <sec id="sec-1-2">
        <title>3.2. The Matrix Approach</title>
        <p>The computation of the Baldone ownership of a company
over powers of adjacency matrix  . It is known that the
-power of  gives all the path of length  of the graph
; for example, in cell ,  of matrix 2 we have the sum
of the weight of path of length 2 and so on. If we sum
all the matrices, we have the sum of the accumulated
ownership of all the paths in each cell leading from node
 to node :
 +  2 +  3 + . . . = ∑︁  
− 1
=1</p>
        <sec id="sec-1-2-1">
          <title>We have to exclude initial cycles; our Baldone ownership</title>
          <p>of company  over company  can be written as:
(, ) = (, ) + ∑︁ ˆ(, )(, )</p>
        </sec>
        <sec id="sec-1-2-2">
          <title>As in [2], Equation 2 can be manipulated into the follow</title>
          <p≯=
(, ) → R defined as lim →0 (, ).</p>
          <p>Definition 3.4.</p>
          <p>The Baldone ownership of a company
 on a company  in a graph  is a function (, ) : ing form:
lowing, Integrated Ownership is essential its computation.</p>
          <p>The convergence of Baldone ownership or, in the fol- that can be solved with respect to 
 as:</p>
        </sec>
        <sec id="sec-1-2-3">
          <title>We give two theorems that assure their convergence is</title>
          <p>guaranteed: (i) if it converges for  if (, ) converges</p>
          <p>= ( − ()) +</p>
          <p>= ((( −  )− 1)− 1( −  )− 1</p>
          <p>
            More details can be found in [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ].
1. Further-  over  can be obtained in closed-form by approximation
(1)
(2)
(3)
(4)
(a) Ultimate Control in a control
chain.
          </p>
          <p>(b) Ultimate Control with two
intermediary controlled
company.</p>
          <p>
            (c) Close Links scenario.
3.3. The Reasoning Approach Central Banks, are all concerned with the company
control problem. It entails determining who takes decisions
Although the matrix approach provides a compact and in a vast corporate network, i.e., who has the majority of
elegant formulation for calculating the Integrated Own- votes for each individual firm as, it is a generally accepted
ership, it relies on matrix multiplication and inversion assumption [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ] that, there exists a one-to-one
corresponoperations. These operations are known [
            <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
            ] to become dence between voting rights and company shares.
more and more computationally expensive as the matrix Control can be direct or indirect. A direct control occurs
size increases. Ownership graphs collect information of when  directly owns the majority of the shares of  (i.e.,
many companies, typically at a national and even at an it is a shareholder of ). An indirect control occurs when
international level, so the matrix approach may be unsuit-  controls, directly or indirectly, a group of companies
able in many cases. For this reason, we provide a more that collectively own the majority of the shares of y. This
computationally eficient approach based on reasoning latter is a recursive definition of the company control
rules while keeping the problem formulation compact. and makes its computation by no means trivial.
          </p>
          <p>
            Definitions 3.1-3.4 can be formalized as reasoning rules A formulation of the company control problem that
in the Vadalog language, as follows: follows is a widely accepted model, and it has been
alOwn(, , ),  &gt; ,  = sum(), ready introduced in the logic and database literature [
            <xref ref-type="bibr" rid="ref6">6</xref>
            ]
and also adopted in technical contexts [
            <xref ref-type="bibr" rid="ref7">7</xref>
            ].
          </p>
          <p>= [x,y] → IOwn(, , , ). (1)</p>
          <p>IOwn(, , 1, 1), IOwn(, , 2, 2),
 = 1|2, BPath(, ,  ),  = sum(1 × 2),</p>
        </sec>
        <sec id="sec-1-2-4">
          <title>Definition 4.1 (Company Control). A person (or a com</title>
          <p>pany)  controls a company , if: (i)  directly owns more
than 50% of ; or, (ii)  controls a set of companies that
→ IOwn(, , , ). (2) jointly (i.e., summing their shares), and possibly together
with  itself, own more than 50% of .</p>
          <p>In Rule 1, whenever the amount of shares of company 
held (through direct ownership) by  exceeds the
threshold  , then path p is a valid  -Baldone path and v is the
weight of the direct path  from  to . Instead, in Rule
2, we can compose the integrated ownership from  to 
and the one from  to  if for the entire path p (the
symbol "|" denotes the path concatenation operator), from
x to y, the Definition 3.3 holds. The integrated
ownership is increased by the product of the two paths weights
(i.e. 1 × 2). The extensional atom BPath represents
whether Definition 3.2 holds.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>4. Company Control</title>
      <sec id="sec-2-1">
        <title>Banks, financial intelligence units, financial intermedi</title>
        <p>aries, regulatory and supervisory authorities, such as</p>
        <p>In Figure 2a, a straightforward case of direct control is
shown: node  directly owns more than the majority of
the shares of company 3. In Figure 2b, through the direct
possession of 30% of the share of company 3,  cannot
exert control. However,  directly controls company
1, which owns 31% of company 3. Together with the
direct share  → 3,  therefore also controls 31% owned
by company 1, totalling 61% of the share of company 3
controlled by . The case shown in Figure 2c is even
more complex.  controls company 1 by directly owning
more than 50% of its total equity. With the contribution
of the share that 1 owns of 2,  acquires indirect control
over company 2. Also,  indirectly controls company 3
by contributing shares owned by 2. Finally,  controls 4
even though it does not own any direct share. In fact, the
sum of the shares of 4 owned b 1,2 and 3 is greater than other company or person does not control it. In Figure 3b,
50%. Since  controls the three intermediate companies,  realizes control over company 2 through the shares
it has the majority of the decision-making power over 4. held by companies 1 and 3 over which  exerts direct</p>
        <p>Definition 4.1 can be formulated a set of compact Vada- control.  is the head of the three simple control chains
log reasoning rules. (i.e., →1, →3, →2), so he also assumes the role of
ultimate controller. In general, whenever an individual
Company() → Control(, ) (1) has control over a firm, it is also its ultimate controller.</p>
        <p>In fact, by definition, no natural person can be owned,
Control(, ), Own(, , ), in any percentage, by another entity in the graph and
 = sum(, ⟨⟩),  &gt; 0.5 neither controlled.</p>
        <p>→ Control(, ) (2) The formalization of the ultimate controller problem</p>
        <p>can be given starting from the Control intensional
rela</p>
        <p>The given formulation is recursive. In the base case, tionships derived with the program shown in Section 4.
we assume that every company has control on itself (Rule
1) 2. Then, inductively, we define the control of  on  Control(, ) → Controlled() (1)
by summing the shares of  owned by companies , over
all companies  controlled by  (Rule 2). Control(, ),  Controlled() → UltC(, ) (2)</p>
        <p>
          The formalization of the company control problem as a
Vadalog reasoning task has been tested for performance
both on real data (i.e. the Italian company graph) and
synthetic graphs [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>We collected all companies y that appears as controlled</title>
        <p>company in any control relationships (Rule 1). Then, we
define the ultimate controller x for the firm y as the one
that has the control over y but, in turn, it is not controlled
by any other company (Rule 2).</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>5. Ultimate Controller</title>
      <p>Since control over a firm can also be obtained indirectly,
it is not always the case that a firm’s parent is necessarily
independent in exerting control over the firm. In the
ifnancial world, in fact, there exist situations (e.g.,
typically for business groups) of chains of control in which a
single individual or firm resides on top of it. This subject
is defined as the Ultimate Controller for all the companies
of the chain. In fact, it is the only one who is able to
push his or her own decisions independently across the
underlying firms in the chain of control.</p>
      <p>
        In the economic literature [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the Ultimate Controller
problem is formally defined as follows:
      </p>
    </sec>
    <sec id="sec-4">
      <title>6. Close Links</title>
      <sec id="sec-4-1">
        <title>In the context of creditworthiness evaluation, the prob</title>
        <p>
          lem of collateral eligibility takes on particular relevance.
It involves calculating the risk of granting a specific loan
to a firm  that is backed by collateral issued by another
company . The Eurosystem provides credit only against
adequate collateral, i.e., only if eligible [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. European
Central Bank regulations [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] for monetary policy define
a set of criteria that National Central Banks must adopt
to assess the eligibility of specific assets. For instance,
for accessing the credit, National Central Banks of the
Eurosystem do not allow a counter-party  to submit
a collateral issued by a guarantor entity to which it is
linked via a close links relationship. A close links situation
is defined as follows:
        </p>
      </sec>
      <sec id="sec-4-2">
        <title>2This formalization of the base case is slightly diferent from</title>
        <p>the natural definition but commonly assumed in the literature as it
is more compact and formally equivalent.</p>
      </sec>
      <sec id="sec-4-3">
        <title>Definition 5.1 (Ultimate Controller). Given a company</title>
        <p>, an investor  (either a company or individual) is said
to be the ultimate controller of  if: (i)  is the head of
a chain of companies among which there is ; and, (ii)
 directly or indirectly controls all the companies in the
chain without being controlled by any other investor.</p>
      </sec>
      <sec id="sec-4-4">
        <title>Definition 6.1 (Close Links). A counter-party  is in</title>
        <p>a close link relationship with its guarantor  if: (i) the
total, either direct or indirect, ownership of  held by</p>
        <p>Two examples of the ultimate controller relationships is above 20% of the equity of ; or, the vice-versa, (ii) the
are shown in Figures 3a and 3b. In both scenarios, in- total accumulated ownership of  held by  is above 20%
dividual  has direct or indirect control over all other of the equity of ; or finally, (iii) a common third party
ifrms. In Figure 3a, company 1 directly controls company  owns, either directly or indirectly, 20% or more of the
2 but is not its ultimate controller. In fact, company 1 equity of both the counter-party  and the guarantor .
is part of the chain of control (i.e.,  → 1 → 2) but
is not at the top of that chain. Therefore, the ultimate
controller in this scenario is the shareholder  since any</p>
      </sec>
      <sec id="sec-4-5">
        <title>The definition is based on the concept of total owner</title>
        <p>ship that a company  owns both directly and indirectly
of another one. That is the definition of integrated
ownership that we introduced in Section 3.</p>
        <p>A sample ownership graph for illustrating the close
links scenario is shown in Figure 3c. We consider the
pair of firms 1 and 2. It exists an arc of direct owner- the guarantor, allows the evaluation of collateral
eligiship that shows the possession of shares of company 2 bility. In this paper, we first described the background,
from part of company 1. Not being there other paths of the main definitions, and examples to provide an
adeownership between these two companies, the amount quate overview of each of the above problems. Then, we
of share directly owned by company 1 is equivalent to formally characterized each problem, and we explained
the total amount of share that it owns of company 2 (i.e. the eficient and compact encoding in the form of
deducintegrated ownership). Since the total quota exceeds the tive rules in the Vadalog language. The approach based
threshold of 20%, in agreement with the given definition, on reasoning rules showed great potential and ease of
we can assert that companies 1 and 2 are in relation of adoption in the financial domain.
close links. The same considerations apply for the pairs
of companies 1-3 and 3-4. Companies 2 and 3 are also in
a close link relationship because of the third point of the References
definition. In fact, a common third-party (i.e. company
1) owns, considering all the possible direct or indirect
paths, more than 20% of the total shares of both the two
companies. The Figure 3c also shows that close links
relationships are undirected.</p>
        <p>We formalize the close links problem as a set of
deductive rules whose input (i.e. IOwn) is directly taken from
the reasoning rules in Section 3.</p>
        <p>IOwn(, , ),  ̸= ,  ≥ 0.2 → CLinks(, ) (1)
IOwn(, , ),  ̸= ,  ≥ 0.2 → CLinks(, ) (2)</p>
        <p>IOwn(, , ), IOwn(, , ),</p>
        <p≯= ,  ≥ 0.2,  ≥ 0.2
→ CLinks(, ), CLinks(, ) (3)</p>
        <p>There is a two-way correspondence between the
reasoning rules shown above and the points in the
Definition 6.1, hence the interpretation of the rules is quite
straightforward. However, with Rule 1 we derive the
existence of a close links relationship between  and  if the
total (i.e. integrated) ownership of  held by  is equal or
greater than 20%. The second rule is symmetrical to the
ifrst one and generates a close link relationship between
 and  if the accumulated ownership of  held by 
is more than 20%. Finally, Rule 3 considers the last
described scenario in which a common third party  owns
(either directly or indirectly) more than 20% of both 
and .</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>7. Conclusion</title>
      <p>Company ownership graphs are helpful in many
recurrent problems in the financial domain. One interesting
problem is the Integrated Ownership problem, where the
goal is to determine the accumulated ownership in
complex economic entities. In the Company Control problem,
the focus is on finding which entity controls a company
of interest. An even more challenging problem is the
Ultimate Controller problem, where it is requested to
individuate the head of a chain of companies. The Close Links
computation between two entities, the counter-party, and</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>P.</given-names>
            <surname>Atzeni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Iezzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Sallinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Vlad</surname>
          </string-name>
          ,
          <article-title>Weaving enterprise knowledge graphs: The case of company ownership graphs</article-title>
          .,
          <source>in: EDBT</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>555</fpage>
          -
          <lpage>566</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>J. B.</given-names>
            <surname>Glattfelder</surname>
          </string-name>
          ,
          <article-title>Ownership networks and corporate control: mapping economic power in a globalized world</article-title>
          ,
          <source>Ph.D. thesis, ETH Zurich</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Benedetti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gentili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Laurendi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Magnanimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Muci</surname>
          </string-name>
          , E. Sallinger, Covid-19 and
          <article-title>company knowledge graphs: assessing golden powers and economic impact of selective lockdown via ai reasoning</article-title>
          , arXiv preprint arXiv:
          <year>2004</year>
          .
          <volume>10119</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Stothers</surname>
          </string-name>
          ,
          <article-title>On the complexity of matrix multiplication (</article-title>
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Davie</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. J.</given-names>
            <surname>Stothers</surname>
          </string-name>
          ,
          <article-title>Improved bound for complexity of matrix multiplication</article-title>
          ,
          <source>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</source>
          <volume>143</volume>
          (
          <year>2013</year>
          )
          <fpage>351</fpage>
          -
          <lpage>369</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ceri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gottlob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Tanca</surname>
          </string-name>
          ,
          <article-title>Logic programming</article-title>
          and databases, Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gulino</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ceri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gottlob</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Sallinger</surname>
          </string-name>
          , L. Bellomarini,
          <article-title>Distributed company control in company shareholding graphs (to appear)</article-title>
          ,
          <source>in: ICDE</source>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Magnanimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nissl</surname>
          </string-name>
          , E. Sallinger,
          <article-title>Neither in the programs nor in the data: Mining the hidden financial knowledge with knowledge graphs and reasoning</article-title>
          ,
          <source>in: Workshop on Mining Data for Financial Applications</source>
          , Springer,
          <year>2020</year>
          , pp.
          <fpage>119</fpage>
          -
          <lpage>134</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>O.</given-names>
            <surname>Staf</surname>
          </string-name>
          ,
          <article-title>OECD handbook on economic globalisation indicators</article-title>
          ,
          <source>OECD</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Bank</surname>
          </string-name>
          ,
          <article-title>The use of credit claims as collateral for eurosystem credit operations</article-title>
          ,
          <year>2013</year>
          . URL: https://www.ecb.europa.eu/pub/pdf/scpops/ ecbocp148.pdf .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>E. C.</given-names>
            <surname>Bank</surname>
          </string-name>
          , Guideline (eu)
          <year>2015</year>
          /
          <article-title>510 of the european central bank of 19 december 2014 on the implementation of the eurosystem monetary policy framework (ecb/</article-title>
          <year>2014</year>
          /60),
          <year>2014</year>
          . URL: http://data.europa. eu/eli/guideline/2015/510/oj.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>