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.
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.
Only violent acts considered in this book are included here.
- 2.
In other words, if we stated that a specific literal cannot possibly be made true (e.g., the variable which says LeT stops being a religious organization cannot possible be made true), then this must be respected.
References
Alon, N., Moshkovitz, D., & Safra, S. (2006). Algorithmic construction of sets for k-restrictions. The ACM Transactions on Algorithms, 2(2), 153–177.
Baral, C., Kraus, S., Minker, J., & Subrahmanian, V. S. (1992). Combining knowledge bases consisting of first order theories. Computational Intelligence, 8(1), 45–71.
Bell, C., Nerode, A., Ng, R., & Subrahmanian, V. S. (1994a). Implementing deductive databases by mixed integer programming. ACM Transactions on Database Systems, 21(2), 238–269.
Bell, C., Nerode, A., Ng, R., & Subrahmanian, V. S. (1994b). Mixed integer methods for computing non-monotonic deductive databases. Journal of the ACM, 41(6), 1178–1215.
Cook, S. (1971). The complexity of theorem proving procedures, Proceedings of the third annual ACM symposium on Theory of computing. pp. 151–158.
Eén, N., & Sörensson, N. (2004). An extensible SAT-solver. In Theory and applications of satisfiability testing (pp. 333–336). Berlin: Springer.
Hamadi, Y., Jabbour, S., & Sais, L. (2009). ManySAT: A parallel SAT solver. Int. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 6, 245–262 IOS Press.
Karp, R. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.
Mendelson, E. (2009). Introduction to mathematical logic (5th ed.). London: Chapman and Hall/CRC Press
Minker, J. (1982). On indefinite databases and the closed-world assumption, Proceedings of 6th international conference on automated deduction, Lecture Notes in Computer Science Vol. 138, pages 292–308
Lund, C., & Yannakakis, M. (1994). On the hardness of approximating minimization problems. Journal of the ACM, 41(5), 960–981.
Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23–41.
Subrahmanian, V. S., Nau, D. S., & Vago, C. (1995). WFS + branch and bound = stable models. IEEE Transactions on Knowledge and Data Engineering, 7(3), 362–377.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Subrahmanian, V.S., Mannes, A., Sliva, A., Shakarian, J., Dickerson, J.P. (2013). Computing Policy Options. In: Computational Analysis of Terrorist Groups: Lashkar-e-Taiba. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4769-6_10
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4769-6_10
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-4768-9
Online ISBN: 978-1-4614-4769-6
eBook Packages: Computer ScienceComputer Science (R0)