<!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>Knowledge Representation and Reasoning meets Digital Forensics: The COST Action DigForASP?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Stefania Costantini</string-name>
          <email>Stefania.Costantini@univaq.it</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Francesca Alessandra Lisi</string-name>
          <email>FrancescaAlessandra.Lisi@uniba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ra aele Olivieri</string-name>
          <email>Raffaele.Olivieri@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dipartimento di Informatica &amp; Centro Interdipartimentale di Logica e Applicazioni (CILA) Universita degli Studi di Bari \Aldo Moro"</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica Universita degli Studi dell'Aquila</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Digital Forensics is a branch of criminalistics which deals with the identi cation, acquisition, preservation, analysis and presentation of the information content of digital devices. In this paper, we brie y describe DigForASP, a COST Action that aims to create a cooperation network for exploring the potential of the application of techniques from the eld of Arti cial Intelligence, in particular from the area of Knowledge Representation and Reasoning, in the Digital Forensics eld, and to foster synergies between these elds. More precisely, in DigForASP the challenge is to address the so-called Evidence Analysis phase, where evidence about possible crimes and crimes' perpetrators must be exploited so as to reconstruct possible events, event sequences and scenarios related to a crime. Results from this phase are then made available to the involved stakeholders (law enforcement, investigators, public prosecutors, lawyers and judges). Reliability, explainability and veri ability of the results are therefore crucial.</p>
      </abstract>
      <kwd-group>
        <kwd>Knowledge Representation Automated Reasoning Digital Forensics</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Digital Forensics (DF) is a branch of criminalistics which deals with the
identication, acquisition, preservation, analysis and presentation of the information
content of computer systems, or in general of digital devices, by means of
specialized software, and according to speci c regulations. In particular, the phase
of Evidence Analysis involves examining and aggregating evidence about
possible crimes and crime perpetrators collected from various electronic devices in
? Copyright c 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
order to reconstruct events, event sequences and scenarios related to a crime.
Evidence Analysis results are made available to law enforcement, investigators,
intelligence agencies, public prosecutors, lawyers and judges.</p>
      <p>Started in September 2018, the COST Action \Digital forensics: evidence
analysis via intelligent systems and practices" (DigForASP)3 aims at creating a
research infrastructure for the application of Arti cial Intelligence (AI), together
with other complementary areas, in the eld of Digital Forensics. DigForASP
constitutes a timely challenge for both areas: DF and AI. From the AI
perspective, the proposed research infrastructure will foster the development of new
theoretical results, methods and techniques that will contribute in the long term
to the development of new software tools that will rely on a complex combination
of concepts and results from di erent areas of Knowledge Representation (KR)
and Automated Reasoning (AR) such as diagnosis, causal explanation,
temporal reasoning about actions, epistemic reasoning, the treatment of incomplete
knowledge, deontic and legal reasoning, inductive learning and formal concept
analysis, which will be complemented by other ones needed for the purpose of
the Action. At the same time, the application of (intelligent) automated tools
to DF - capable of reliable and exhaustive exploration of evidence, and with a
level of analysis that goes beyond the scope of human observation and in time
- will constitute a breakthrough that will have a direct impact on the practical
investigation of crime scenarios.</p>
      <p>To meet the challenge, the Action has built a network composed of researchers
and engineers from the AI eld together with DF experts belonging to
Government Institutions and NGOs alongside scholars from the eld of Information
and Communication Technologies (ICT) and Law as well as social scientists,
criminologists and philosophers (the latter for the ethical issues). The network
is carrying out a set of activities and building resources to promote interaction,
exchange and cooperation between these di erent areas. It is enabling computer
scientists to understand the main issues and open problems of DF, especially
Evidence Analysis, and it is helping to promote the exploitation of AI for
addressing in an innovative, e ective and adaptive way the key problems in this
domain. Network partners is thus being able to identify KR&amp;AR techniques
which can be applied to Evidence Analysis, and to suggest guidelines for
creating and developing suitable new techniques and methods aimed at advancing
the state of the art in both DF and AI, strengthening European research and
innovation capability in these areas. The long-term objective of the Network is to
increase know-how and competences, so as to devise and to implement concrete
projects and tools to be applied by Police Scienti c Investigation Departments in
solving real cases in so-called COST Member Countries, COST Near Neighbour
Countries (NNCs) and COST International Partner Countries (IPCs).</p>
      <p>The paper is organized as follows: In Section 2 we provide a short overview
of the automated tools used in DF. In Section 3 we identify the challenges of DF
to the areas of KR &amp; AR. In Section 4 we brie y discuss the preliminary results
achieved, and we conclude by outlining some promising directions for research.
3 https://digforasp.uca.es/</p>
    </sec>
    <sec id="sec-2">
      <title>State of the Art in Digital Forensics</title>
      <p>Digital Forensics is a complex and rapidly evolving eld, where methods for
collecting evidence are varied, rapidly evolving and becoming increasingly
sophisticated. Clearly, the development of DF is highly related to the development
of ICTs in the last decades, and to the widespread di usion of electronic devices
and infrastructures. It involves various disciplines such as computer science,
electronic engineering, various branches of law, investigation techniques and
criminological sciences. Organizational aspects are also relevant and DF investigation
involves, in general, several experts working with sophisticated instruments and
software, with limited resources and tight timing.</p>
      <p>To better understand the context of DF, we need to provide some details
about how investigations are conducted. An investigation consists, in general
terms, in a series of actions and initiatives implemented by the investigators
(law enforcement and judges) in order to ascertain the \truth" and acquire all
possible information and data about a perpetrated crime and related facts with
their logical implications. A large number of entities are involved in this process,
where they help to pursue a criminal activity, which could still be in progress.
In an accurate vision, and according to the Italian Code of Criminal Procedure,
investigations can be de ned as \the set of activities carried out by the o cers
and agents of the criminal police". An investigation has therefore the ultimate
goal of establishing the existence of a crime and the consequences that it has
determined (generic proof or \de delicto"), and identifying the criminals (speci c
proof or \de reo"). These activities start from the acquisition of the crime notice
or from the analysis of a crime scene. Through a series of initiatives and actions,
the investigation allows the collection of data and elements which, according to
certain deductive logical reasoning, should lead to draw conclusions. Investigative
cases are usually complex, and involve a number of factors that need to be
taken into account. Most of the collected data are nowadays obtained through
digital devices and platforms either seized from the suspects, or available on the
Internet or shared by telecommunication companies. This explains the increasing
importance of DF in the legal process.</p>
      <p>DF is divided into sub- elds according to the kind of data analyzed,
including those extracted from the Internet, and it encompasses the following phases:
(1) Identi cation, (2) Acquisition, (3) Preservation, (4) Evidence Analysis, and
(5) Presentation. Phases 1-3 are supported by a number of hardware and
software tools, the latter being both proprietary and open source. These tools are
continuously evolving to follow the evolution of the involved technologies and
devices, and recently related procedures have been standardized in all
communities. However, they do not require advanced reasoning capabilities. Phase 4,
i.e. Evidence Analysis, is where the main thrust of the Action will lie. It involves
examining fragmented, incomplete knowledge, and aggregating evidence items
into complex scenarios possibly involving time, uncertainty, causality and
alternative possibilities. Currently, no single established procedure exists for Evidence
Analysis, which is usually performed by Scienti c Investigation experts on the
basis of their experience and intuition. This phase requires therefore advanced
reasoning capabilities that are not currently supported by available devices and
software. In fact, these are limited to data recovery (and data recognition) and
to providing metadata (size, dates of creation/modi cation/elimination, etc.).
Therefore, such retrieved data must be analysed by human experts, possibly
with the support of available automated tools. However such tools, apart from
text analysis, header les analysis and mining software packages, operate as a
\black box" (i.e., they provide results without motivation or explanation), and
for veri cation of the results one needs to perform a secondary analysis.</p>
      <p>It should be acknowledged that AI techniques have been already applied to
DF for di erent purposes. However, they have mainly focused on data retrieval
and categorization tasks. The analysis of image and video les or the detection of
anomalies in large databases such as email exchanges, network transactions, etc.
are examples of such applications. These tasks bene t in particular from Machine
Learning (ML) techniques. The Action takes a step beyond the state of the art as
it fosters the application of KR&amp;R methods to retrieved data in order to elicit
evidence that can be used in a trial. For instance, from data items retrieved
from di erent sources (like, e.g., mobile devices, social network activities, cloud
computing tracks, etc.), we may obtain the set of all possible patterns of activity
of a suspect during the execution of a crime. AR tools can constitute a crucial
advantage since the amount of data to examine and interpret is large and keeps
growing with the increasing adoption of digital devices in everyday life. Thus,
the Action proposes innovations in the following two directions:
1. a substantial evolution of the current paradigm of evaluation and
interpretation of data in DF, which might be exportable, in the future, also to other
Forensic Sciences;
2. a breakthrough innovation for the judicial system, based on the possibility
of adopting intelligent, reliable and dependable decision-support systems for
the reconstruction of facts, able to take into account the wide number of
elements and variables involved in complex cases, so as to aid judges in their
assessments and decisions.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Research challenges for KR and AR in DigForASP</title>
      <p>Unlike the phase of Identi cation, where the application of ML techniques can
be useful for the analysis of big data, the phase of Evidence Analysis has
particular requirements that make the proposal of DigForASP based upon KR and
AR a much more promising approach, potentially becoming a breakthrough
in the state-of-the-art. The ultimate goal of Evidence Analysis is the
formulation of veri able evidence that can be rationally presented in a trial. Under
this perspective, the results provided by ML classi ers or other types of \black
box" AI systems do not have more value than human witness' suspicions and
cannot be used as legal evidence. Logical methods provide a broad range of
proof-based reasoning functionalities that can be implemented in a declarative
framework where the problem speci cation and the computational program are
closely aligned. This has the bene t that the correctness of the resulting
systems can be formally veri ed. Moreover, recent research has led to new methods
for visualising and explaining the results of computed answers (e.g., based on
argumentation schemes). So one can not only represent and solve relevant
problems, but also provide tools to explain the conclusions (and their proofs) in a
transparent, comprehensible and justi ed way.</p>
      <p>DigForASP aims at promoting formal and veri able AI methods and
techniques for Evidence Analysis. As already mentioned, this DF phase requires
examining fragmented incomplete knowledge, and aggregating evidence items
into complex scenarios. Relevant aspects to be considered include:
{ Timing of events and actions;
{ Possible causal correlations;
{ Uncertainty and imprecision;
{ Contexts in which suspicious actions occurred;
{ Skills of the involved suspects;
{ Awareness of the involved suspects of committing a violation or a crime and
of the degree of severity of the violation/crime.</p>
      <p>Moreover, given available evidence, several possible underlying scenarios may
exist that should be identi ed, examined and evaluated. Currently, no single
established procedure exists for this phase, which is usually performed by Scienti c
Investigation experts on the basis of their experience and intuition. The aim of
the Action is that all the above should be performed via techniques that are
veri able with respect to the results they provide, how such results are
generated, and how the results can be explained. Therefore, such software tools can
be reliable and trustworthy, in the sense of con dence in the system's correct
behaviour. Otherwise there remains an undesirable uncertainty about the
outcome of these stages, and di erent technicians analyzing the same case can reach
di erent conclusions which may lead to di erent judgements in court.</p>
      <p>In AI, several methods and techniques have been developed over the years
for uncertain, causal and temporal reasoning, and for devising and examining
alternative consistent scenarios that might be compatible with a set of known
facts. To the best of our knowledge, these techniques have never been applied to
Evidence Analysis. Therefore, studying their applicability in this domain with
the aim of developing suitable prototypes is per se a signi cant advance over
the state of the art. Moreover, the application to such a challenging eld will
foster the re nement and/or improvement of known methods and techniques, and
the development of novel ones. Overall, Evidence Analysis constitutes an ideal
application domain for logical reasoning in AI, as it combines di erent classical
aspects of KR&amp;R. Also the two areas share a common feature: the search for a
proof (a formal proof vs a valid argumentation in a trial). In the short term, DF
can provide the AI community with non-trivial AR benchmarks that constitute a
breakthrough with respect to available synthetic or ad hoc examples used in the
scienti c literature. It will act as a proof of concept to check whether di erent
available KR&amp;R techniques and tools are directly applicable or, most probably,
require adjustments to take into account the domain features.</p>
    </sec>
    <sec id="sec-4">
      <title>Achievements and Promising Directions</title>
      <p>
        Modern investigative activities consist of well-established practical steps, such
as the crime scene reconstruction, alibi veri cation, as well as the analysis of
huge amounts of data coming from data les, smart-phone and telephone logs.
So, as a rst attempt, we have devised a reformulation of these activities which
exploits provably correct encodings of known mathematical problems in order
to elicit scenarios from DF data [
        <xref ref-type="bibr" rid="ref4 ref8">8, 4</xref>
        ]. In particular, we have considered to
represent (fragments of) cases in Answer Set Programming (ASP), which is a
wellestablished computational logic paradigm for dealing with computationally hard
problems (cf., among many, [
        <xref ref-type="bibr" rid="ref1 ref10 ref11 ref13 ref16 ref9">10, 11, 16, 1, 13, 9</xref>
        ] for relevant literature). ASP has
been selected for these preliminary experiments because of its ease of use and
readability, for the availability of e cient freely available inference engines (\ASP
solvers") and for the possibility of performing proof of correctness of the software
(the reader may refer to [
        <xref ref-type="bibr" rid="ref12 ref14 ref15">14, 12, 15</xref>
        ] for the de nition of the underlying formal
properties). When applicable, the ASP encodings generate all possible scenarios
compatible with the case's data and constraints. In the general case, this can be
of great help as the human expert might sometimes overlook some of the
possibilities: this has been veri ed by everyday practice, where di erent experts often
generate di erent interpretations. Overall, leveraging the experience gained over
the years by investigators, we have been able to claim with good reason that
indeed a wide range of fragments of real cases can be mapped to computational
problems, often to known ones.
      </p>
      <p>
        In a future perspective, we may notice that logical methods (like ASP) could
provide a broad range of proof-based reasoning functionalities (including, e.g.,
time and time intervals logic, causality, forms of induction, etc.) that can be
integrated into a declarative framework for Evidence Analysis where the problem
speci cation and the computational program are closely aligned. The encoding of
cases via such tools would have the bene t that (at least in principle) the
correctness of such declarative systems based on computational logic can be formally
veri ed. Moreover, recent research has led to new methods for visualizing and
explaining the results of computed answers (e.g., based on argumentation schemes).
So, one could not only represent and solve relevant problems, but might also
employ suitable tools to explain the conclusions (and their proofs) in a transparent,
comprehensible and justi ed way. The engine of such a future Decision Support
System might be based, again remaining within the computational logic realm,
on Multi-Context Systems (MCS) [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ] and their agent-oriented extensions such
as DACMACS (Data-Aware Commitment-based managed Multi-Agent-Context
Systems, [
        <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
        ]) and ACEs (Agent Computational Environments, [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]).
Agentbased simulation is also a promising direction to explore in Evidence Analysis,
since it allows the generation of plausible scenarios. Finally, besides deduction,
other inferences should be considered, notably induction and abduction.
Acknowledgments The network \DigForASP - Digital forensics: evidence analysis
via intelligent systems and practices" is funded by the European Cooperation in Science
and Technology (COST) under the Horizon 2020 framework programme.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Baral</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Knowledge representation, reasoning and declarative problem solving</article-title>
          . Cambridge University Press (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Brewka</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eiter</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fink</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weinzierl</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Managed multi-context systems</article-title>
          .
          <source>In: IJCAI 2011, Proceedings of the 22nd Intl. Joint Conf. on Arti cial Intelligence. IJCAI/AAAI</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Brewka</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ellmauthaler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Puhrer, J.:
          <article-title>Multi-context systems for reactive reasoning in dynamic environments</article-title>
          .
          <source>In: ECAI</source>
          <year>2014</year>
          ,
          <article-title>21st European Conf</article-title>
          .
          <source>on Arti cial Intelligence</source>
          ,
          <source>Proceedings. IJCAI/AAAI</source>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Costantini</surname>
            , S. De Gasperis,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Olivieri</surname>
          </string-name>
          , R.:
          <article-title>Digital forensics and investigations meet arti cial intelligence</article-title>
          ,
          <source>Annals of Mathematics and Arti cial Intelligence</source>
          , in press (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Costantini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Ace: a exible environment for complex event processing in logical agents</article-title>
          . In: Engineering
          <string-name>
            <surname>Multi-Agent</surname>
            <given-names>Systems</given-names>
          </string-name>
          , Third International Workshop, EMAS 2015,
          <source>Revised Selected Papers. Lecture Notes in Computer Science</source>
          , vol.
          <volume>9318</volume>
          . Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Costantini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Knowledge acquisition via non-monotonic reasoning in distributed heterogeneous environments</article-title>
          .
          <source>In: 13th Int. Conf. on Logic Programming and Nonmonotonic Reasoning LPNMR 2013, Proceedings. Lecture Notes in Computer Science</source>
          , vol.
          <volume>9345</volume>
          . Springer (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Costantini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>De Gasperis</surname>
          </string-name>
          , G.:
          <article-title>Exchanging data and ontological de nitions in multi-agent-contexts systems</article-title>
          . In: Paschke,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Fodor</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Giurca</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Kliegr</surname>
          </string-name>
          , T. (eds.)
          <article-title>RuleMLChallenge track</article-title>
          ,
          <source>Proceedings. CEUR Workshop Proceedings</source>
          , CEUR-WS.org (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Costantini</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Olivieri</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Digital forensics evidence analysis: An answer set programming approach for generating investigation hypotheses</article-title>
          .
          <source>In: 13th Int. Conf. on Logic Programming and Nonmonotonic Reasoning LPNMR 2015, Proceedings. Lecture Notes in Computer Science</source>
          , vol.
          <volume>9345</volume>
          , pp.
          <volume>242</volume>
          {
          <fpage>249</fpage>
          . Springer (
          <year>2015</year>
          ).
          <source>Presented also at CILC</source>
          <year>2015</year>
          , 30th Italian Conference of Computational Logic, CEUR Workshop Proceedings 1459, CEUR-WS.org
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Erdem</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leone</surname>
          </string-name>
          , N.:
          <article-title>Applications of answer set programming</article-title>
          .
          <source>AI Magazine</source>
          <volume>37</volume>
          (
          <issue>3</issue>
          ),
          <volume>53</volume>
          {
          <fpage>68</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Gelfond</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          :
          <article-title>Classical negation in logic programs</article-title>
          and disjunctive databases.
          <source>New Generation Computing</source>
          <volume>9</volume>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Leone</surname>
          </string-name>
          , N.:
          <article-title>Logic programming and nonmonotonic reasoning: From theory to systems and applications</article-title>
          .
          <source>In: Logic Programming and Nonmonotonic Reasoning</source>
          , 9th Intl. Conference,
          <string-name>
            <surname>LPNMR</surname>
          </string-name>
          <year>2007</year>
          , Proceedings. Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Lifschitz</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pearce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valverde</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Strongly equivalent logic programs</article-title>
          .
          <source>ACM Transactions on Computational Logic</source>
          <volume>2</volume>
          ,
          <issue>526</issue>
          {
          <fpage>541</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lifschitz</surname>
          </string-name>
          , V.:
          <article-title>Twelve de nitions of a stable model</article-title>
          .
          <source>In: Proceedings of the 24th Intl. Conference on Logic Programming. Lecture Notes in Computer Science</source>
          , vol.
          <volume>5366</volume>
          , Springer (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Pearce</surname>
            ,
            <given-names>D.:</given-names>
          </string-name>
          <article-title>A new logical characterization of stable models and answer sets</article-title>
          .
          <source>In: Non-Monotonic Extensions of Logic Programming</source>
          , pp.
          <source>55{70. Lecture Notes in Arti cial Intelligence</source>
          , vol.
          <volume>1216</volume>
          , Springer (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Pearce</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valverde</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Synonymous theories in answer set programming and equilibrium logic</article-title>
          .
          <source>ECAI</source>
          <year>2004</year>
          ,
          <article-title>16th European Conf</article-title>
          .
          <source>on Arti cial Intelligence</source>
          ,
          <source>Proceedings. IJCAI/AAAI</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Truszczynski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Logic programming for knowledge representation</article-title>
          .
          <source>In: Logic Programming, 23rd Intl. Conference ICLP</source>
          <year>2007</year>
          , Proceedings. Springer (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>