Digital forensics and investigations meet artificial intelligence

In the frame of Digital Forensic (DF) and Digital Investigations (DI), the “Evidence Analysis” phase has the aim to provide objective data, and to perform suitable elaboration of these data so as to help in the formation of possible hypotheses, which could later be presented as elements of proof in court. The aim of our research is to explore the applicability of Artificial Intelligence (AI) along with computational logic tools – and in particular the Answer Set Programming (ASP) approach — to the automation of evidence analysis. We will show how significant complex investigations, hardly solvable for human experts, can be expressed as optimization problems belonging in many cases to the ℙ$\mathbb {P}$ or ℕℙ$\mathbb {N}\mathbb {P}$ complexity classes. All these problems can be expressed in ASP. As a proof of concept, in this paper we present the formalization of realistic investigative cases via simple ASP programs, and show how such a methodology can lead to the formulation of tangible investigative hypotheses. We also sketch a design for a feasible Decision Support System (DSS) especially meant for investigators, based on artificial intelligence tools.

[1]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Luca Pulina,et al.  Multi-engine ASP solving with policy adaptation , 2015, J. Log. Comput..

[3]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[4]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

[5]  Eoghan Casey,et al.  Handbook of Digital Forensics and Investigation , 2009 .

[6]  Pedro Cabalar,et al.  Causal Logic Programming , 2012, Correct Reasoning.

[7]  Francesca Toni,et al.  Abstract argumentation , 1996, Artificial Intelligence and Law.

[8]  Michael Gelfond,et al.  Answer Sets , 2008, Handbook of Knowledge Representation.

[9]  Miroslaw Truszczynski.  Logic Programming for Knowledge Representation , 2007, ICLP.

[10]  Stefania Costantini,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming on the Existence of Stable Models of Non-stratified Logic Programs , 2022 .

[11]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[12]  Gerhard Brewka,et al.  Multi-Context Systems for Reactive Reasoning in Dynamic Environments , 2014, ECAI.

[13]  Stefania Costantini,et al.  Exchanging Data and Ontological Definitions in Multi-Agent-Contexts Systems , 2015, Challenge+DC@RuleML.

[14]  Blai Bonet,et al.  Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA , 2015, AAAI.

[15]  José Júlio Alferes,et al.  Preserving Strong Equivalence while Forgetting , 2014, JELIA.

[16]  Pier Luigi M. Lucatuorto.  Artificial Intelligence and Law: Judicial Applications of Expert Systems (Intelligenza Artificiale e Diritto: Le Applicazioni Giuridiche dei Sistemi Esperti) , 2006 .

[17]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[18]  Clara Smith,et al.  Legal Responsibility for the Acts of Others: A Logical Analysis , 2014, RuleML.

[19]  Pedro Cabalar,et al.  Strong Equivalence of Non-Monotonic Temporal Theories , 2014, KR.

[20]  Erhard Rahm,et al.  Data Cleaning: Problems and Current Approaches , 2000, IEEE Data Eng. Bull..

[21]  Evelina Lamma,et al.  Evaluating compliance: from LTL to abductive logic programming , 2015, CILC.

[22]  Thomas Eiter,et al.  Nonmonotonic Multi-Context Systems: A Flexible Approach for Integrating Heterogeneous Knowledge Sources , 2011, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning.

[23]  Marcello Balduccini,et al.  Logic programming, knowledge representation, and nonmonotonic reasoning: essays dedicated to Michael Gelfond on the occasion of his 65th birthday , 2011 .

[24]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[25]  Nicola Leone.  Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications , 2007, LPNMR.

[26]  Guido Governatori.  Un Modello Formale Per Il Ragionamento Giuridico , 1997 .

[27]  Guido Governatori,et al.  Computing Strong and Weak Permissions in Defeasible Logic , 2012, Journal of Philosophical Logic.

[28]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[29]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[30]  Stefania Costantini,et al.  Contributions to the Stable Model Semantics of Logic Programs with Negation , 1993, Theor. Comput. Sci..

[31]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

[32]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[33]  Chitta Baral,et al.  Knowledge Representation, Reasoning and Declarative Problem Solving , 2003 .

[34]  Michael Gelfond,et al.  Applications of Answer Set Programming , 2016, AI Mag..

[35]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[36]  Stefania Costantini,et al.  On the equivalence and range of applicability of graph-based representations of logic programs , 2002, Inf. Process. Lett..

[37]  Moshe Y. Vardi.  Branching vs. Linear Time: Final Showdown , 2001, TACAS.

[38]  Miroslaw Truszczynski,et al.  Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative , 2004, LPNMR.

[39]  Stefania Costantini,et al.  ACE: A Flexible Environment for Complex Event Processing in Logical Agents , 2015, EMAS@AAMAS.

[40]  Antonis C. Kakas,et al.  Computing Argumentation in Logic Programming , 1999, J. Log. Comput..

[41]  Antonius Weinzierl,et al.  Managed Multi-Context Systems , 2011, IJCAI.

[42]  Stefania Costantini,et al.  Knowledge Acquisition via Non-monotonic Reasoning in Distributed Heterogeneous Environments , 2015, LPNMR.

[43]  Katharina Wagner,et al.  Digital Evidence And Computer Crime Forensic Science Computers And The Internet , 2016 .

[44]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[45]  Guido Governatori,et al.  Deontic defeasible reasoning in legal interpretation: two options for modelling interpretive arguments , 2015, ICAIL.

[46]  Vladimir Lifschitz,et al.  Twelve Definitions of a Stable Model , 2008, ICLP.

[47]  Michael Gelfond,et al.  Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach , 2014 .

[48]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[49]  David Pearce,et al.  Synonymus Theories in Answer Set Programming and Equilibrium Logic , 2004, ECAI.

[50]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[51]  Maja Cevnik.  Applications of graph theory in communication networks , 2015 .

[52]  Evelina Lamma,et al.  The SCIFF Abductive Proof-Procedure , 2005, AI*IA.

[53]  Fabrizio Riguzzi,et al.  A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics , 2017, Int. J. Approx. Reason..

[54]  Kewen Wang,et al.  Semantic forgetting in answer set programming , 2008, Artif. Intell..