Abstract
This chapter describes the syntax and semantics of Temporal Probabilistic (or TP) behavioral rules used throughout the book to describe the behavior of Lashkar-e-Taiba. The chapter describes the intuition behind TP-rules, their formal syntax and meaning, and describes an algorithm used to derive the TP-rules automatically from data about LeT.
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
References
Dekhtyar, A., Dekhtyar, M., Subrahmanian, V.S. (1999). Temporal Probabilistic Logic Programs: Proceedings 1999 International Conference on Logic Programming, November 1999. New Mexico. (pp. 109–123).
Khuller, S., Martinez, V., Nau, D., Simari, G., Sliva, A., & Subrahmanian, V. S. (2007). Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030,000 worlds. Annals of Mathematics and Artificial Intelligence, 51(2–4), 295–331.
Kifer, M., & Subrahmanian, V. S. (1992). Theory of Generalized Annotated Logic Programming and its Applications. Journal of Logic Programming, 12(4), 335–368.
Mannes, A., Subrahmanian, V.S. (2009). Calculated terror, Foreign Policy magazine (online edition), December 15, 2009. Retrieved http://www.foreignpolicy.com/articles/2009/12/15/calculated_terror?page=full
Mannes, A., Sliva, A., Subrahmanian, V.S. (2011). A computational enabled analysis of Lashkar-e-Taiba attacks in Jammu and Kashmir: Proceedings 2011 IEEE European intelligence & security informatics conference September 2011. Athens.
Mannes, A., Sliva, A., Subrahmanian, V.S., Wilkenfeld, J. (2008a). Stochastic opponent modeling agents: a case study with hamas: proceedings 2008 international. conference on computational cultural dynamics (pp. 49–54), September 2008. AAAI Press.
Mannes, A., Michaell, M., Pate, A., Sliva, A., Subrahmanian, V.S., Wilkenfeld, J. (2008b). In Liu, H., Salerno, J., Rogers, M. (Eds.) Stochastic opponent modelling agents: a case study with hezbollah: Proceedings 2008 first intl. workshop on social computing, behavioral modeling and prediction, April 1–2, 2008, Springer Verlag, Phoenix.
Ng, R., Subrahmanian, V.S. (1993). Probabilistic Logic Programming, Information and Computation, 101, 2, 150—201.
Shakarian, J. (2012). The CMOT Codebook, available from the Lab for Computational Cultural Dynamics, University of Maryland Institute for Advanced Computer Studies, University of Maryland, College Park, MD 20742. Extended and revised by Schuetzle, B. and Nagel, M. in 2012.
Shakarian, P., Simari, G. I., & Subrahmanian, V. S. (2011a). Annotated probabilistic temporal logic: approximate fixpoint implementation. ACM Transactions on Computational Logic, 12, 1–42.
Shakarian, P., Parker, A., Simari, G., Subrahmanian, V.S. (2011b). Annotated probabilistic temporal logic. ACM Transactions on Computational Logic, 12(2).
Simari, G., Martinez, V., Sliva, A., Subrahmanian, V.S. (2012) Focused most probable world computations in probabilistic logic programs. Annals of Mathematics and Artificial Intelligence., 64 (Nrs2-3):113–143.
Subrahmanian, V.S., Ernst, J. (2009). Method and system for optimal data diagnosis, US patent Nr. 7474987, January 6.
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). Temporal Probabilistic Behavior Rules. In: Computational Analysis of Terrorist Groups: Lashkar-e-Taiba. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-4769-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-4769-6_3
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)