@inbook{1bd79fbf0689442b8cd4a318ca9942b2,
title = "Argumentation-based cyber attribution: The DeLP3E model",
abstract = "In cyber attribution, knowledge bases consisting of all the available information for a specific domain, along with the current state of affairs, will typically contain contradictory data coming from different sources, as well as data with varying degrees of uncertainty attached. In this chapter, we propose a probabilistic structured argumentation framework that arises from the extension of Presumptive Defeasible Logic Programming (PreDeLP) with probabilistic models, and argue that this formalism is especially suitable for handling such contradictory and uncertain data–hence the framework would be well-suited for cyber attribution. We conclude with the demonstration—via a case study—of how our framework can be used to address the attribution problem in cybersecurity.",
author = "Eric Nunes and Paulo Shakarian and Simari, {Gerardo I.} and Andrew Ruef",
note = "Funding Information: Literal L is called the conclusion supported by the argument, and A is the support of the argument. An argument hB; Li is a subargument of hA ; L0i iff B A . An argument hA ; Li is presumptive iff A \ ˚ is not empty. We will also use ˝.A / D A \ ˝, .A / D A \ , ∆.A / D A \ ∆, and ˚.A / D A \ ˚. For convenience, we may sometimes call an argument by its support. (e.g. argument A instead of argument hA ; Li.",
year = "2018",
doi = "10.1007/978-3-319-73788-1_3",
language = "English (US)",
series = "SpringerBriefs in Computer Science",
publisher = "Springer",
number = "9783319737874",
pages = "17--45",
booktitle = "SpringerBriefs in Computer Science",
edition = "9783319737874",
}