Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
10. Computing Policy Options
verfasst von : V. S. Subrahmanian, Aaron Mannes, Amy Sliva, Jana Shakarian, John P. Dickerson
Erschienen in: Computational Analysis of Terrorist Groups: Lashkar-e-Taiba
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
This chapter describes the methodology and the algorithm used to automatically compute policy options. It provides a mathematical definition of a policy against LeT and then proves the LeT Violence Non-Eliminability Theorem that shows there is no policy that will stop all of LeT’s terrorist actions. The reason for this is that attacks on holidays are carried out in situations that are inconsistent with situations when LeT carries out other types of attacks. The chapter presents an algorithm to compute all policies (in accordance with the mathematical definition of policy) that have good potential to significantly reduce all types of attacks carried out by LeT (except for attacks on holidays). Readers who do not wish to wade through the technical details can skip directly to Sect. 10.5 which summarizes the results of this chapter.