<!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 />
    <article-meta>
      <title-group>
        <article-title>Offshore Holdings Analytics Using Datalog+ RuleML Rules</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Mohammad Sadnan Al Manir</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Christopher J.O. Baker</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science and Applied Statistics University of New Brunswick</institution>
          ,
          <addr-line>Saint John</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In April 2013, the International Consortium of Investigative Journalists (ICIJ) exposed the details of 130,000 offshore accounts. Although there are legitimate businesses which use such accounts, there exist a number of accounts which are possibly linked to international tax fraud and money laundering. The ICIJ investigation was based on 2.5 million records of offshore holdings linked to 170 countries. All these records have been made available for further examination and analysis. Based on these records, a set of facts, rules and queries have been formulated in Datalog+ RuleML 1.01/XML and these rules have been tested and validated against the Relax NG schema for Datalog+ in RuleML 1.01/XML. The usefulness of such rules for offshore holdings analytics is demonstrated here via incremental step-by-step approach, through the discovery of relationships between persons hiding large sums of assets and the offshore companies where the assets are purported to be hidden.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        The International Consortium of Investigative Journalists (ICIJ) [
        <xref ref-type="bibr" rid="ref1 ref8">1</xref>
        ] has exposed
the details of ownership of more than 100,000 offshore entities located in ‘tax
havens’ in 2013. The publicly released Offshore Leaks Database [
        <xref ref-type="bibr" rid="ref2 ref9">2</xref>
        ] shows
relationships and networks among people or companies and offshore entities, often
hiding their true owners. The database contains data on the companies and
people identified as a director, a shareholder, a beneficiary, or a trustee.
Precisely, ten offshore jurisdictions have been investigated: British Virgin Islands,
Cayman Islands, Cook Islands, Singapore, Hong Kong, Samoa, Seychelles,
Mauritius, Labuan, and Malaysia.
      </p>
      <p>
        In this article, we demonstrate the effectiveness of expressive Datalog+ RuleML
1.01 [
        <xref ref-type="bibr" rid="ref10 ref3">3</xref>
        ] by showcasing a rulebase containing a set of rules and queries over a
subset of the Offshore Leaks Database. This rulebase will be used for analytics to
infer new knowledge by deriving relations among different entities which are not
easy to find manually. Our main motivation comes from the article published in
[
        <xref ref-type="bibr" rid="ref11 ref4">4</xref>
        ] on big data visualization based on the database. In our rulebase, the
formulation of rules have been simplified to the extent possible to ensure maximum
comprehensibility to a broader user base and unambiguous interpretation of
derived relations. Our method is introduced with an illustrative example, where
the goal is to find out if any connection can be established between the top-level
officials such as the president or the prime minister of a country and their
possible offshore investments, which would usually be managed via immediate family
members or distant relatives and the intermediary companies they deal with.
Here, it is assumed that top-level officials are very careful about exposing their
holdings abroad and are not willing to be directly involved in a list of offshore
holdings owners. Hence, any enquiry regarding their direct involvements in
owning offshore holdings will almost certainly be in vein, and a search for indirect
involvement might be more fruitful.
      </p>
      <p>The article is organized as follows: In section 2, the formalization of our
rulebase is illustrated in detail by authoring facts, rules, and executing queries
on them, often by checking the consistency of the rulebase. In section 3, the
expressivity and the effectiveness of rules used here have been briefly discussed.
Finally, we conclude by summarizing the tools and procedures used for rule
authoring, schema design, and their validation in Appendix A.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Rulebase</title>
      <p>
        Our Datalog+ RuleML 1.01/XML Document incrementally asserts into, retracts
from, and queries, a rulebase (within the &lt;RuleML&gt; element) for a total of 37
transactions: 14 Asserts, 3 retracts, and 20 distinct Queries. The rules formalized
in this document not only cover the smallest Datalog sublanguage, but also cover
the highlights of RuleML 1.01, the superlanguage of the decidable Datalog+/- [
        <xref ref-type="bibr" rid="ref12 ref5">5</xref>
        ]
called Datalog+ [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] as well as Disjunctive Datalog features. The rules include all
three Datalog extensions which allow existentially quantified variables, “Equal”
predicate, and falsity in rule heads.
      </p>
      <p>The fact “The president of Azerbaijan is Ilham” is formalized with a binary
president relation in RuleML. A query immediately follows, formalizing “Who
is the president of Azerbaijan?”, and resulting in an x binding to Ilham.
&lt;?xml-model</p>
      <p>href=="http://deliberation.ruleml.org/1.01/relaxng/naffologeq_relaxed.rnc"
?&gt;
&lt;RuleML xmlns="http://ruleml.org/spec"&gt;
&lt;Assert&gt;
&lt;Atom&gt;
&lt;Rel&gt;president&lt;/Rel&gt;
&lt;Ind&gt;Ilham&lt;/Ind&gt;
&lt;Ind&gt;Azerbaijan&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Assert&gt;
&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;president&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Ind&gt;Azerbaijan&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Query&gt;</p>
      <p>A variation of the above query can be formalized as “Which country does
Ilham preside over?”, resulting in a y binding to Azerbaijan.</p>
      <p>A generic formalization of the above query can be expressed as “List al l the
individuals and countries where the individual is the president of a country ”.
Given the only ground fact, x and y represent the individual and the country
binding to Ilham and Azerbaijan, respectively.</p>
      <p>The rule “No one is both the president and the prime minister of a country”
is formalized as an integrity rule with falsity in rule head.</p>
      <p>&lt;Assert&gt;
&lt;Forall&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Implies&gt;
&lt;if&gt;
&lt;And&gt;
&lt;Atom&gt;
&lt;Rel&gt;president&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Atom&gt;
&lt;Rel&gt;primeMinister&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/And&gt;
&lt;/if&gt;
&lt;then&gt;</p>
      <p>&lt;Or/&gt;
&lt;/then&gt;
&lt;/Implies&gt;
&lt;/Forall&gt;
&lt;/Assert&gt;</p>
      <p>The formalization of the fact “Ilham is the prime minister of Azerbaijan”,
when asserted with the previous rule, creates an inconsistency because of the
already existing assertion “Ilham is the president of Azerbaijan”.</p>
      <p>&lt;Assert&gt;
&lt;Atom&gt;
&lt;Rel&gt;primeMinister&lt;/Rel&gt;
&lt;Ind&gt;Ilham&lt;/Ind&gt;
&lt;Ind&gt;Azerbaijan&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Assert&gt;</p>
      <p>The inconsistency can be detected by the query “Is there any inconsistency?”.
It succeeds because, according to the rule with falsity, Ilham cannot hold both
the post of a president and a prime minister of Azerbaijan.</p>
      <p>To remove inconsistency from the rulebase, the fact “Ilham is the prime
minister of Azerbaijan” is retracted.</p>
      <p>The consistency of the rulebase is checked again by the same query. This
time, the query fails and the rulebase regains consistency due to the retraction.</p>
      <p>Universally quantified equations are useful for expressing more complex
formulas. The following rule “Two persons have family ties if they are either
married to each other, or there is a parent-child relationship between them, or they
are distant relatives” is formalized using the binary relations hasFamilyTies,
marriedTo, hasChild, and hasDistantRelative. The facts “Ilham is married
to Mehriban”, “Ilham has a daughter Arzu”, and “Ilham has a daughter Leyla”
are formalized using the relations.</p>
      <p>&lt;Assert&gt;
&lt;Forall&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;Implies&gt;
&lt;if&gt;
&lt;Or&gt;
&lt;Atom&gt;
&lt;Rel&gt;marriedTo&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasChild&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasDistantRelative&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Or&gt;
&lt;/if&gt;
&lt;then&gt;
&lt;Atom&gt;</p>
      <p>The query, formalizing “List the individuals having family ties to Ilham? ”,
results in a y binding to three individuals named Mehriban, Leyla, and Arzu.
&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasFamilyTies&lt;/Rel&gt;
&lt;Ind&gt;Ilham&lt;/Ind&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Query&gt;</p>
      <p>On the other hand, the query “Which individuals are tied to Mehriban as
family members?” can be formalized to retrieve Ilham using the marriedTo
relation. Similarly, the binding of x to Ilham establishes family ties for both
Leyla and Arzu because of the hasChild relation.</p>
      <p>&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasFamilyTies&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Ind&gt;Mehriban&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Query&gt;
&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasFamilyTies&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Ind&gt;Leyla&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Query&gt;
&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;hasFamilyTies&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Ind&gt;Arzu&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Query&gt;</p>
      <p>The query “Find al l individuals having family ties to each other ”, results
in multiple combinations of x and y where Ilham binds to an x and each of
Mehriban, Leyla, and Arzu binds to a y, respectively.</p>
      <p>The rule “Everything which operates either as an intermediary company or
as an offshore company is designated as a company” is formalized as a
universally quantified rule with disjunctions in the rule body and it asserts a subclass
relationship. Three ground facts “ArborInvestmentsLtd operates as an
intermediary company”, “NaziqAndPartners operates as an intermediary company ”, and
“HarvardManagementLtd operates as an offshore company” are also formalized
and added below.</p>
      <p>The above rule implies that ArborInvestmentsLtd, NaziqAndPartners, and
HarvardManagementLtd are all designated as companies. The formalization of
the query “Which entities are designated as companies? ” results in
ArborInvestmentsLtd, NaziqAndPartners, and HarvardManagementLtd as companies
binding to the variable x.</p>
      <p>From the above assertions, we can also find out if a particular company
operates as an intermediary company or as an offshore company. For instance,
the query “Does ArborInvestmentsLtd operate as an intermediary company?”
succeeds as the company asserts as an intermediary company.</p>
      <p>On the other hand, the query “Does ArborInvestmentsLtd operate as an
offshore company?” fails as its operation does not assert as an offshore company
but as an intermediary company.</p>
      <p>Another integrity rule with falsity in rule head is formalized as “Nothing is
both an onshore company and an offshore company”.</p>
      <p>&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;offshoreCompany&lt;/Rel&gt;
&lt;Ind&gt;ArborInvestmentsLtd&lt;/Ind&gt;
&lt;/Atom&gt;
&lt;/Query&gt;
&lt;Assert&gt;
&lt;Forall&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Implies&gt;
&lt;if&gt;
&lt;And&gt;
&lt;Atom&gt;
&lt;Rel&gt;onshoreCompany&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Atom&gt;
&lt;Rel&gt;offshoreCompany&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/And&gt;
&lt;/if&gt;
&lt;then&gt;</p>
      <p>&lt;Or/&gt;
&lt;/then&gt;
&lt;/Implies&gt;
&lt;/Forall&gt;
&lt;/Assert&gt;</p>
      <p>The fact “HarvardManagementLtd is an onshore company” creates an
inconsistency.</p>
      <p>Inconsistencies can be detected by the query “Is there any inconsistency?”.</p>
      <p>It succeeds because, according to the rule above, HarvardManagementLtd
cannot be both an onshore company and an offshore company.</p>
      <p>To remove inconsistency from the rulebase, the fact “HarvardManagementLtd
is an onshore company” is retracted.</p>
      <p>When consistency of the rulebase is checked by the same query, it fails as the
rulebase became consistent with the retraction.</p>
      <p>The rule “It is unlikely that an offshore company reveals their clients’
investment information” is formalized as an example of a negative integrity constraint.
&lt;Assert&gt;
&lt;Forall&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Implies&gt;
&lt;if&gt;
&lt;And&gt;
&lt;Atom&gt;
&lt;Rel&gt;offshoreCompany&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Atom&gt;
&lt;Rel&gt;revealInvestmentInfo&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/And&gt;
&lt;/if&gt;
&lt;then&gt;</p>
      <p>&lt;Or/&gt;
&lt;/then&gt;
&lt;/Implies&gt;
&lt;/Forall&gt;
&lt;/Assert&gt;</p>
      <p>The fact “HarvardManagementLtd reveals investment information” creates
inconsistency when added to the rulebase.</p>
      <p>The query “Is there any inconsistency?” succeeds because HarvardManagementLtd
does not reveal investment information while operating as an offshore company.</p>
      <p>The fact “HarvardManagementLtd reveals investment information” is
retracted to remove inconsistency from the rulebase.</p>
      <p>Now that the consistency is checked again by the same query, it fails.</p>
      <p>The following assertion contains a rule and a ground fact. The rule
“Anyone is a shareholder of a company if and only if there exists a certain level of
stocks of that company such as Smal l-cap level or Medium-cap level or Large-cap
level, which he owns” is formalized as an equivalence formula. The ground fact
“Arzu owns Medium-cap level of stocks in ArborInvestmentsLtd” is formalized
and added below.</p>
      <p>&lt;Assert&gt;
&lt;Forall&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;Equivalent&gt;
&lt;Atom&gt;
&lt;Rel&gt;shareHolderOf&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;/Atom&gt;
&lt;Exists&gt;
&lt;Var&gt;z&lt;/Var&gt;
&lt;Atom&gt;
&lt;Rel&gt;ownsStockin-atLevel&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;y&lt;/Var&gt;
&lt;Var&gt;z&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Exists&gt;
&lt;/Equivalent&gt;
&lt;/Forall&gt;
&lt;Atom&gt;
&lt;Rel&gt;ownsStockin-atLevel&lt;/Rel&gt;
&lt;Ind&gt;Arzu&lt;/Ind&gt;</p>
      <p>The benefit of this equivalence formula is that the ownsStockin-atLevel
relation can be used when the level of stock ownership is important, otherwise
shareHolder relation is sufficient as it does not care about the level of stocks
to become a shareholder.</p>
      <p>The ownsStockin-atLevel relation is defined as a functional relation, hence
together with its existential formalization in the equivalence formula above, it
must have uniqueness. This is achieved by formalizing the rule “Every stock
owner owns at most one level of stocks of a company” with equality in the head.</p>
      <p>The query “Is there any individual who owns Smal l-cap level of stocks in
ArborInvestmentsLtd?” fails because there are no individuals binding to an x
who own Small-cap level of stocks. A similar query with a different quantity
Large-cap in place of Small-cap also fails.</p>
      <p>On the other hand, the query “Is there any individual who owns Medium-cap
level of stocks in ArborInvestmentsLtd?” succeeds by providing the answer Arzu
as the owner binding to an x.</p>
      <p>&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;ownsStockin-atLevel&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;ArborInvestmentsLtd&lt;/Var&gt;
&lt;Var&gt;Medium-cap&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Query&gt;
&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;shareHolderOf&lt;/Rel&gt;
&lt;Var&gt;x&lt;/Var&gt;
&lt;Var&gt;ArborInvestmentsLtd&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Query&gt;</p>
      <p>The query “List al l shareholders of ArborInvestmentsLtd” provides the
individual Arzu as the only shareholder binding to an x.</p>
      <p>The rule “There is a link between a person and a company if the person is
a director or a shareholder of the company or he owns a level of stock in the
company” is formalized as a universally quantified rule with disjunctions in rule
body.</p>
      <p>The query “Which individuals and companies are linked to each other?”
results in the name Arzu binding to the variable x and the company ArborInvestmentsLtd
to a y.</p>
      <p>The rule “If a company C1 manages assets of another company C2 and the
latter i.e. C2 manages assets of yet another company C3, then company C1
manages the assets of the company C3” is formalized as a universally quantified
rule implying a transitive relation. With this rule, relations between two distant
companies can be established even if there is a chain of companies sitting in
the middle managing assets. The facts “ArborInvestmentsLtd manages assets of
NaziqAndPartners” and “NaziqAndPartners manages assets of
HarvardManagementLtd” are formalized using the relation manageAssets and are added at the
end of the assertion.</p>
      <p>From the transitive rule and two facts mentioned above, it can be deduced
that the company ArborInvestmentsLtd is, in fact, managing assets of the
distant company HarvardManagementLtd. The query “Find al l the companies
whose assets are being managed and the companies managing them” can be used
to infer such relations among companies.</p>
      <p>Finally, by formalizing the rule “The president of a country (possibly) has
offshore investments in a company if his family members have links to companies
managing assets in that offshore company”, it can be discovered if a president has
invested in an offshore company to hide his assets using someone in his family.</p>
      <p>Based on the facts and rules provided, the query “Find the presidents and
companies in which the presidents possibly have offshore investments” is
formalized to find the presidents who have invested in offshore companies to hide their
assets from the concerned national and international authority.</p>
      <p>&lt;Query&gt;
&lt;Atom&gt;
&lt;Rel&gt;possiblyHasOffshoreInvestments&lt;/Rel&gt;
&lt;Var&gt;p&lt;/Var&gt;
&lt;Var&gt;oc&lt;/Var&gt;
&lt;/Atom&gt;
&lt;/Query&gt;
&lt;/RuleML&gt;</p>
      <p>The answer to the above query is president Ilham of Azerbaijan whose
daughter Arzu has links with the company ArborInvestmentsLtd, which
indirectly manages the assets in the offshore company called HarvardManagementLtd.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Conclusion</title>
      <p>A rulebase formulated using Datalog+ RuleML 1.01/XML rules is presented in
this article. The incremental formalization of rules demonstrates how interesting
relationships can be discovered among different entities from financial records,
which are difficult to deduce in plain sight. The discovery of relationships is used
for offshore holdings analytics.</p>
      <p>Our rulebase is comprised of expressive RuleML 1.01 rules which, in
addition to the existing RuleML sublanguages, cover two newly introduced anchor
sublanguages called datalogplus min and disdatalogplus min. Thus our rules not
only include positive facts and universally quantified implications, but also
allows existential variables, “Equal” predicates, and falsity in the heads of
implications. Moreover, conjunctions within existetials and non-empty disjunctions,
arbitrarily nested with existentials and conjunctions are permitted in the heads
of implications. Some of the rules in our rulebase have disjunctions both in the
body and head of implications.</p>
      <p>
        With the addition of new features from the two sublanguages, expressive
rules are now easier to formulate in RuleML 1.01. The ability to use existential
variables in the heads of implications lets us make some progress in solving old
problems in semantic technologies. For instance, an earlier attempt mentioned in
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] for combining negation-free rules and ontologies needed a workaround called
DL-safety because those rules did not allow existentials in heads. As RuleML
1.01 permits existentials in heads of implications, our intuition is that DL-safety
won’t be required if RuleML 1.01 rules are used instead of negation-free rules.
Further research in this direction would be interesting and is left for future work.
Moreover, because of the modularity in RuleML sublanguages, fine-grained rules
can be authored, which might fall into a customized sublanguage. The availability
of these choices gives the user the advantage of identifying appropriate resources
for the sublanguage such as the inference engine saving significant time.
For authoring our rulebase1, we used XML Copy Editor2 which is a free software
released under the GNU General Public License. The RuleML community has
provided Modular sYNtax confiGurator (MYNG 1.01)3, a highly customizable
GUI for generating RELAX NG Compact Syntax (RNC) schemas or
approximating XSD schemas. We formalized the rulebase based on RNC schemas and
validated using a validation webservice4. The webservice can validate Datalog+
RuleML 1.01/XML instances against schemas, including Relax NG schemas and
Namespace-Based Validation Dispatching Language NVDL5. We validated
every assert and query separately using the webservice against the appropriate
RNC schema and retracted any assertions causing inconsistency in the rulebase.
Finally, the complete rulebase containing all asserts, retracts, and queries is
validated against the RNC schema.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>1. The International Consortium of Investigative Journalists. http://www.icij.org/.</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>ICIJ</given-names>
            <surname>Offshore</surname>
          </string-name>
          <article-title>Leaks Database</article-title>
          . http://offshoreleaks.icij.org/about/caveats.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <source>Datalog+ RuleML 1</source>
          .01. http://deliberation.ruleml.
          <source>org/1</source>
          .01.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <article-title>4. Analysing the Offshore Leaks with graphs</article-title>
          . http://linkurio.us
          <article-title>/ analysing-the-offshore-leaks-with-graphs/.</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5. Andrea Cal`ı, Georg Gottlob, and
          <string-name>
            <given-names>Thomas</given-names>
            <surname>Lukasiewicz</surname>
          </string-name>
          .
          <article-title>A general datalogbased framework for tractable query answering over ontologies</article-title>
          .
          <source>In Proceedings of the Twenty-eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS '09</source>
          , pages
          <fpage>77</fpage>
          -
          <lpage>86</lpage>
          , New York, NY, USA,
          <year>2009</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Georg</given-names>
            <surname>Gottlob</surname>
          </string-name>
          , Giorgio Orsi, Andreas Pieris, and
          <string-name>
            <given-names>Mantas</given-names>
            <surname>Simkus</surname>
          </string-name>
          .
          <article-title>Datalog and its extensions for semantic web databases</article-title>
          . In Thomas Eiter and Thomas Krennwallner, editors,
          <source>Reasoning Web</source>
          , volume
          <volume>7487</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>54</fpage>
          -
          <lpage>77</lpage>
          . Springer,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7. Mohammad Sadnan Al Manir.
          <article-title>Towards rif-owl combination: An effective reasoning technique in integrating owl and negation-free rules</article-title>
          . In Frank Olken, Monica Palmirani, and Davide Sottara, editors,
          <source>RuleML America</source>
          , volume
          <volume>7018</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>33</fpage>
          -
          <lpage>48</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          1 http://deliberation.ruleml.
          <source>org/1</source>
          .01/exa/RulebaseCompetition2014/OffshoreHoldingAnalytics.ruleml
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          2 http://xml-copy-editor.
          <source>sourceforge.net/</source>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          3 http://deliberation.ruleml.
          <source>org/1</source>
          .01/myng/
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>4 http://validator.nu</mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>5 http://nvdl.org</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>