Abstract
This chapter describes the methodology and the algorithm used to automatically generate policy options. It provides a mathematical definition of a policy against IM. The chapter presents an algorithm to compute all policies (in accordance with the mathematical definition of policy) that have high probability of significantly reducing all types of attacks carried out by IM (except for attacks on holidays). We were able to find one such policy. This policy will be discussed in detail in Chap. 9.
A slight variant of this chapter was first published in (Subrahmanian et al. 2012).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
For several reasons, some steps involved in our prior study of LeT (Subrahmanian et al. 2012) were not needed in this one.
- 2.
Only violent acts considered in this book are included here.
- 3.
When reining in IM, we did not impose constraints on what a counter-terrorism organization might do as we did in our prior study of LeT (Subrahmanian et al. 2012).
References
Alon N, Moshkovitz D, Safra S (2006) Algorithmic construction of sets for k-restrictions. ACM Trans. Algorithms 2: 153–177.
Baral C, Kraus S, Minker J, Subrahmanian VS (1992) Combining knowledge bases consisting of first order theories. Computational Intelligence 8:45–71.
Bell C, Nerode A, Ng R, Subrahmanian VS (1994a) Implementing deductive databases by mixed integer programming. ACM Transactions on Database Systems 21:238–269.
Bell C, Nerode A, Ng R, Subrahmanian VS (1994b) Mixed integer methods for computing non-monotonic deductive databases. J ACM 41:1178–1215.
Cook S (1971) The complexity of theorem proving procedures. In Proceedings of the third annual ACM symposium on theory of computing 151–158.
Eén N, Sörensson N (2004) An extensible SAT-solver. In Theory and Applications of Satisfiability Testing, Springer, Berlin.
Hamadi Y, Jabbour S, Sais L (2009) ManySAT: a parallel SAT solver. Int J Satisfiability, Boolean Modeling and Computation 6.
Karp R (1972) reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York.
Lund C, Yannakakis M (1994) On the hardness of approximating minimization problems. J ACM 41:960–981.
Mendelson E (2009) Introduction to mathematical logic, 5th Edition. Chapman and Hall/CRC Press.
Minker J (1982) On indefinite databases and the closed-world assumption. Proc 6th international conference on automated deduction, lecture notes in computer science 138:292-308.
Subrahmanian VS, Nau DS, Vago C (1995) WFS + branch and bound = stable models, IEEE transactions on knowledge and data engineering 7:362–377.
Subrahmanian VS, Mannes A, Shakarian J, Sliva A, Dickerson J (2012) Computational analysis of terrorist groups: Lashkar-e-Taiba. Springer, New York.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Subrahmanian, V.S., Mannes, A., Roul, A., Raghavan, R.K. (2013). Computing Policy Options. In: Indian Mujahideen. Terrorism, Security, and Computation. Springer, Cham. https://doi.org/10.1007/978-3-319-02818-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-02818-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02817-0
Online ISBN: 978-3-319-02818-7
eBook Packages: Computer ScienceComputer Science (R0)