<!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>LLM-based DatalogMTL Modelling of MiCAR-compliant Crypto-Assets Markets</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Andrea Colombo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Teodoro Baldazzi</string-name>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Luigi Bellomarini</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andrea Gentili</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Emanuel Sallinger</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
          <xref ref-type="aff" rid="aff4">4</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Banca d'Italia</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria</institution>
          ,
          <addr-line>Milan</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>TU Wien, Faculty of Informatics</institution>
          ,
          <addr-line>Vienna</addr-line>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Università Roma Tre, Department of Computer Science and Engineering</institution>
          ,
          <addr-line>Rome</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff4">
          <label>4</label>
          <institution>University of Oxford, Department of Computer Science</institution>
          ,
          <addr-line>Oxford</addr-line>
          ,
          <country country="UK">UK</country>
        </aff>
      </contrib-group>
      <fpage>17</fpage>
      <lpage>22</lpage>
      <abstract>
        <p>Recent extensions of Datalog that consider the temporal dimension as a first-class citizen have unlocked the possibility of using its temporal variants, such as DatalogMTL, to model and reason about complex financial domains. Very relevant ones are crypto-activity markets, which, according to the recent Markets in Crypto-Assets Regulation (MiCAR) of the EU, are described by white papers published by crypto-assets issuers. In particular, the issuers publish semi-structured information about the assets they are willing to ofer. Then, the assets are implemented in decentralized finance contexts (i.e., in a blockchain) as executable scripts known as smart contracts. However, these scripts are often criticized for their complexity, which makes them challenging to understand and communicate. On the other hand, in our experience, the availability of a declarative and executable representation of a crypto-activity market fosters a better understanding of that market as well as improved transparency, reproducibility and, as a consequence, increased fairness. These characteristics are of major interest to the financial authorities for example for supervision purposes. In this paper, we study the problem of automatically translating textual descriptions of crypto-assets, written according to the MiCAR specifications, into DatalogMTL programs that represent and capture the respective crypto-activity market. To this end, we opt for a machine translation approach and leverage a Large Language Model. We discuss promising techniques and preliminary experimental results.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;DatalogMTL</kwd>
        <kwd>crypto assets</kwd>
        <kwd>MiCAR</kwd>
        <kwd>large language models</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Knowledge Representation and Reasoning (KRR) formalisms, such as Datalog and its extensions, are
gathering increasing attention in industrial contexts. This is particularly evident in the financial sector,
with applications in the so-called Decentralized Finance (DeFi), a novel financial paradigm that leverages
distributed ledger technologies to ofer services without intermediaries. Logical languages such as
Datalog efectively balance expressive power and computational complexity, enabling, thanks to their
extension to the temporal dimension, the creation of concise and eficiently executable formalizations
of smart contracts, i.e., executable scripts that implement a financial asset [
        <xref ref-type="bibr" rid="ref1 ref2 ref3">1, 2, 3</xref>
        ]. Additionally, the
inherent step-by-step nature of logical reasoning aligns closely with concepts of explainability, thereby
supporting transparency in decision-making activities. The declarative paradigm promotes simplicity,
trustworthiness, compactness, and code comprehensibility, making it algorithm-independent and more
aligned with high-level specifications, policies, and standards. Among these, the recent Markets in
Crypto-Assets Regulation (MiCAR) of the European Union [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] introduces rules for crypto-activity
issuers, such as the requirements for white papers, i.e., semi-structured documents containing all
information about the crypto assets being ofered or admitted to trading. The availability of such
Part
      </p>
      <p>A
B
C
D
E
F
G</p>
      <p>Description</p>
      <p>Information about the issuer
Information about the e-money</p>
      <p>token
Information about the admission</p>
      <p>to trading
Rights and obligations of the token
Information about the underlying</p>
      <p>technology</p>
      <p>Information on the risks
Information on sustainability
templates is appealing if combined with the impressive power of state-of-the-art Large Language Models
(LLMs), which have proved to be capable of understanding and manipulating complex unstructured
data as text. One of the most promising applications is using LLMs to analyze white papers, their
compliance with rules, and their features, which may impact financial markets, raising the interest of
ifnancial authorities.</p>
      <p>
        Leveraging Large Language Models for the automatic translation of natural language descriptions into
executable code on a blockchain is a novel and unexplored field due to the challenges of (i) converting
text to programming languages an LLM has rarely seen, and (ii) ensuring the fidelity and quality of
the translated content [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Recent works, such as SolMover [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], build frameworks that, by employing
LLMs, try to understand coding concepts and use them to translate from a code like Solidity into a
non-trained source language. While results are promising, this approach is a code-to-code translation,
thus not directly a natural language (NL)-to-code translation. Other works are based on a human-LLM
continuous dialogue, such as via ChatGPT, that supports the writing of Solidity code for smart contracts,
although human intervention and correction are still required [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Contribution. In this short work, we present our preliminary approach that aims at translating white
papers into an executable and inherently transparent language as DatalogMTL. Our approach leverages
the semi-structured format enforced by the MiCAR to build a pipeline that supports a pre-trained LLM
agent in the translation task by (i) reducing the amount of information passed to the model, filtering in
only specific sections of the white paper, and (ii) implementing token-specific pre- and post-processing
steps that help the LLM achieve an executable output.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        In this section, we briefly recall DatalogMTL foundations required for its use in crypto-activity modelling,
i.e., to model smart contracts. Then, we outline the main aspects of interest introduced by the MiCAR.
DatalogMTL. DatalogMTL [
        <xref ref-type="bibr" rid="ref8 ref9">8, 9</xref>
        ] is a recently developed extension of Datalog with operators from
Metric Temporal Logic (MTL) interpreted over the rational timeline and with stratified negation under
stable model semantics. In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], we showed how the only required temporal operator for implementing
ifnancial markets in DatalogMTL is the use of ⊟ [1,2] over a punctual interval, i.e., up to 1 = 2.
Informally speaking, given the rule ⊟ [1,2]1 → 2 and a time interval [, ], the ⊟ operator defines
the satisfaction of an atom 2 within the interval [ + 2,  + 1], based on the continuous satisfaction of
an atom 1 within the interval [, ], where  + 2 ≤  + 1. The idea is that, by considering punctual
intervals, we can model the evolving market at any timestamp and create rules that react in case an
event occurs, such as a transfer of assets between two market participants.
      </p>
      <p>
        The MiCA Regulation in the EU. The Markets in Crypto-Assets (MiCA) regulation, enacted by
the European Union, covers three categories: asset-referenced tokens, e-money tokens, and other
crypto-assets. Since the scope of the third category is broader, in this work we will focus only on the
ifrst two more specific tokens. For each crypto asset category, the MiCAR contains norms regarding the
content of the white paper. While no oficial template has been published yet, we report in Table 1 the
likely structure of the templates, following the consultations that are in progress [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. LLM-based White Paper Translation Pipeline</title>
      <p>The problem of translating an arbitrary NL whitepaper into a DatalogMTL specification is inherently
complex and our experience shows that pure machine translation approaches, where the LLM is directly
tasked with the NL-to-DatalogMTL translation goal (even when fine-tuning is involved) are not efective
and lead to arbitrary programs, highly afected by hallucinations and overall incorrect. To overcome
these dificulties, we suggest a paradigm shift and follow a template-based technique, implemented in
the pipeline shown in Figure 1.</p>
      <p>Overview. We pre-define a set of market mechanisms ℳ that represent standard “functional
components” of a market, such as creation (minting), selling of a token (redemption), and so on. For each
pattern, we feature pre-built templatized (i.e., with formal variables) DatalogMTL rules decorated with a
natural language description. Examples are in Figure 2. Then, given a white paper, we can first select the
templatized rules according to the token type, and iteratively prompt the LLM with all the information
required to specialize the rules to the white paper content.</p>
      <p>LLM-based Rules Specialization. Algorithm 1 describes the process we developed to adapt the
generic rules to the token-specific features. Based on a custom input MiCAR-compliant white paper, the
corresponding set of templatized rules Σ, either e-money token or asset-referenced token, is considered.
Then, for each market mechanism  of the set ℳ of mechanisms (line 1), we consider the set of
templatized rules , their description  that we have pre-defined, and we extract the portion  of the
white paper that contains relevant information for the mechanism (lines 2-4). Each mechanism is also
decorated with a set of keywords , which describe the content of the mechanism and activate optional
pre-processing steps (lines 5-7). Thus, if the mechanism deals with one of the topics defined by the
keywords, a pre-processing LLM call will be performed to rewrite the information that was inserted in
the white paper fields. The aim of this step is to support the LLM-translation task by simplifying, if
possible, the textual input. For instance, this is the case of temporal information such as the specification
of market opening days, which can be defined in multiple formats, e.g., the market is closed on weekends.
Then, the LLM is provided ,  and  and is prompted to perform the actual specification (line 8):
“These are Datalog rules: {R} where {D}. Modify them according to this information: {I}” Finally, the LLM
generates the translated rules, and we perform post-processing checks (line 9-11), such as detection
of syntax or programmatically identifiable errors. In case checks are not passed, the LLM is asked to
repeat the task until they are passed.
Mechanism</p>
      <p>Algorithm 1 Rules Specialization.</p>
      <p>1: for ∀ ∈ ℳ do
2:  ← Σ .GetRules(M )
3:  ← Σ .GetDescription(M )
4:  ← WhitePaper .GetRelevantFields(M )
5: if M .Keywords ∈  then
6:  ← LLMRewrite()
7: end if
8: * ← LLMPrompt (, , )
9: while * .ℎ not passed do
10: * ←   (, , )
11: end while
12: end for
◁ For each Token’s Market Mechanism</p>
      <p>◁ Get generalized DatalogMTL rules
◁ Get the description for the mechanism variables
◁ Query the Textual Information from the White Paper
◁ Mechanism deals with a topic requiring pre-processing</p>
      <p>◁ LLM is asked to rewrite the information
◁ LLM is prompted to adapt the rules R according to I
◁ LLM is asked to repeat the task</p>
      <p>For our preliminary experiments and tests, we employed a pre-trained LLaMA 3 70B as our reference
LLM. The model was prompted with system content providing a generic DatalogMTL adaptation
example. We opted not to perform fine-tuning since (i) few-shot learning demonstrated promising
results in our initial trials, and (ii) there is a current lack of large-scale datasets of DatalogMTL rules.
Example 1 (X-Coin - Supported Blockchain). Consider the market mechanism  = Transfer for
a hypothetical e-money token named X-Coin. It defines the conditions required by the white paper for
the approval of a transfer of tokens between a Sender  and a Receiver  of  units on the blockchain
. For instance, suppose the only main conditions for approving a transfer are (i) having enough tokens
in the sender’s balance, and (ii) that the transfer occurs on a supported blockchain. Figure 3 illustrates
the pipeline in action for the Transfer mechanism. In this example, the variable 1 (refer to Figure 2) has
been instantiated and the model has also created additional rules to account for the multiple blockchains,
i.e., inserting OR conditions. To achieve this, the input has been automatically pre-processed: since the
mechanism referred to the supported blockchain technology, a step to separate each blockchain type has
been activated. Then, post-processing checks have controlled the syntax in the output, such as the presence
of all initial predicates and the absence of additional undesired predicates.</p>
      <p>
        DatalogMTL Market Formalization. By collecting all the rules that have been generated or modified
in Algorithm 1, we can create a DatalogMTL program that formalizes the token’s specific market that, if
extensional facts are injected, is executable in a DatalogMTL engine. Full examples of our approach over
existing crypto activities, converting natural language white papers into a DatalogMTL formalization,
can be found in our repository [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Such programs are executable if the required extensional facts are
provided and replicate the conditions laid out in the white papers.
      </p>
      <p>
        Discussion and Limitations. We developed the pipeline with the goal of producing DatalogMTL
programs that are executable in any reasoner engine that supports the MTL extension of Datalog.
Thus, engines like the MeTeoR [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] and Vadalog [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] systems can execute the generated programs.
However, in all cases, the extensional database to practically run the program should be manually (or
semi-automatically) generated, in the scenario you aim to reproduce or test the market for particular
use cases, which is our goal for future work. In particular, any interested user might inject a market
scenario and run the corresponding DatalogMTL program to see what the consequences of such a
scenario would be.
      </p>
      <p>Finally, while the semantic correctness of the resulting programs can be evaluated using rule-based
checks or domain-specific constraints, which involve detecting rule-specific features, assessing the
content correctness is more challenging. Specifically, verifying that the translated rules, including
potential errors introduced by the LLM, accurately replicate the mechanisms of a specific token remains
dificult, particularly in an automated way. In fact, although employing human evaluators seems like a
straightforward solution, automatic checks and correctness experiments would require a gold standard,
i.e., the true sets of market rules, which is so far unavailable. Nevertheless, our pipeline is strictly
guided, with the presence of specific regulations and pre-defined rule templates that mitigate the issue
of creating unreliable DatalogMTL representations of crypto-markets.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusion and Future Work</title>
      <p>In this work, we presented the first approach that, by employing the enormous power of pre-trained
LLMs in a controlled fashion, tries to model crypto activity markets in a tractable and inherently
transparent formal language, i.e., DatalogMTL. Preliminary results show that we can automatically
generate executable DatalogMTL programs starting from white papers in natural language by carefully
instructing the LLM to perform the translation task and by leveraging the semi-structured nature of
the MiCAR. In future works, we will expand on this approach and industrialize it on a larger scale,
allowing stakeholders to get a DatalogMTL formalization of any MiCAR-compliant token. We will also
test whether such programs fully replicate the markets by simulating their evolution and comparing it
with the real market they aim to represent.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This work has been funded by the Vienna Science and Technology Fund (WWTF) [10.47379/VRG18013,
10.47379/NXT22018, 10.47379/ICT2201]. The views expressed in the paper are those of the authors and
do not necessarily reflect those of the Bank of Italy.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Nissl</surname>
          </string-name>
          , E. Sallinger,
          <article-title>Modelling Smart Contracts with DatalogMTL</article-title>
          ., in: EDBT/ICDT Workshops, volume
          <volume>3135</volume>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>T.</given-names>
            <surname>Baldazzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ceri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Colombo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gentili</surname>
          </string-name>
          , E. Sallinger,
          <article-title>Fine-tuning large enterprise language models via ontological reasoning</article-title>
          , in: RuleML+RR, Springer,
          <year>2023</year>
          , pp.
          <fpage>86</fpage>
          -
          <lpage>94</lpage>
          .
        </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>Favorito</surname>
          </string-name>
          , E. Laurenza,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nissl</surname>
          </string-name>
          , E. Sallinger,
          <article-title>Towards FATEful Smart Contracts</article-title>
          ,
          <source>in: "6th Distributed Ledger Technology Workshop, May 14-15</source>
          ,
          <year>2024</year>
          , Turin,
          <source>Italy"</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>EU</given-names>
            , Regulation
            <surname>-</surname>
            2023/1114 - en -
          </string-name>
          eur-lex, https://shorturl.at/QAyRM,
          <year>2023</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>F.</given-names>
            <surname>Barbàra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. A.</given-names>
            <surname>Napoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Gatteschi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Schifanella</surname>
          </string-name>
          ,
          <article-title>Automatic Smart Contract Generation Through LLMs: When The Stochastic Parrot Fails</article-title>
          ,
          <source>in: "6th Distributed Ledger Technology Workshop"</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R.</given-names>
            <surname>Karanjai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Xu</surname>
          </string-name>
          , W. Shi,
          <source>SolMover: Smart Contract Code Translation Based on Concepts</source>
          ,
          <source>Association for Computing Machinery</source>
          , New York, NY, USA,
          <year>2024</year>
          , p.
          <fpage>112</fpage>
          -
          <lpage>121</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Petrović</surname>
          </string-name>
          , I. Al-Azzoni,
          <article-title>Model-Driven Smart Contract Generation Leveraging ChatGPT</article-title>
          , in: Advances in Systems Engineering, Springer Nature Switzerland,
          <year>2023</year>
          , pp.
          <fpage>387</fpage>
          -
          <lpage>396</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>S.</given-names>
            <surname>Brandt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E. G.</given-names>
            <surname>Kalayci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Ryzhikov</surname>
          </string-name>
          , G. Xiao,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zakharyaschev</surname>
          </string-name>
          ,
          <article-title>Querying Log Data with Metric Temporal Logic</article-title>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Artif</surname>
          </string-name>
          .
          <source>Int. Res</source>
          .
          <volume>62</volume>
          (
          <year>2018</year>
          )
          <fpage>829</fpage>
          -
          <lpage>877</lpage>
          . doi:
          <volume>10</volume>
          .1613/jair.1.11229.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Walega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zawidzki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , Reasoning Techniques in DatalogMTL,
          <source>in: Proceedings of Datalog 2.0</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Colombo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ceri</surname>
          </string-name>
          , E. Laurenza, Smart Derivative Contracts in DatalogMTL,
          <source>in: Proceedings of the EDBT Conference</source>
          , volume
          <volume>26</volume>
          ,
          <year>2023</year>
          , p.
          <fpage>773</fpage>
          -
          <lpage>781</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>C.</given-names>
            <surname>Camassa</surname>
          </string-name>
          ,
          <article-title>Legal NLP Meets MiCAR: Advancing the Analysis of Crypto White Papers</article-title>
          ,
          <source>in: Proceedings of the Natural Legal Language Processing Workshop</source>
          <year>2023</year>
          ,
          <year>2023</year>
          , pp.
          <fpage>138</fpage>
          -
          <lpage>148</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Colombo</surname>
          </string-name>
          ,
          <string-name>
            <surname>MiCAR White Paper - DatalogMTL Translation Examples</surname>
          </string-name>
          , https://bit.ly/MiCARTran slations,
          <year>2024</year>
          . (Accessed on 14/08/
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Wałęga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. C.</given-names>
            <surname>Grau</surname>
          </string-name>
          , Meteor:
          <article-title>Practical reasoning in datalog with metric temporal operators</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , volume
          <volume>36</volume>
          ,
          <year>2022</year>
          , pp.
          <fpage>5906</fpage>
          -
          <lpage>5913</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bellomarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Blasi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nissl</surname>
          </string-name>
          , E. Sallinger,
          <article-title>The Temporal Vadalog System</article-title>
          ,
          <source>in: Rules and Reasoning: 6th International Joint Conference on Rules and Reasoning</source>
          ,
          <source>RuleML+RR</source>
          <year>2022</year>
          , Berlin, Germany,
          <source>September 26-28</source>
          ,
          <year>2022</year>
          , Proceedings, Springer-Verlag,
          <year>2022</year>
          , p.
          <fpage>130</fpage>
          -
          <lpage>145</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>