This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
J. Allen 1983. Maintaining knowledge about temporal intervals. Communications of the ACM 26, 11, 832–843.
A. Artikis , M. Sergot and G. Paliouras 2010. A logic programming approach to activity recognition. In Proceedings of ACM Workshop on Events in Multimedia. ACM, New York, NY, USA, 3–8.
M. Brand , N. Oliver and A. Pentland 1997. Coupled hidden Markov models for complex action recognition. In Proceedings of International Conference on Computer Vision and Pattern Recognition (CVPR). D. Plummer and I. Tonvick , Eds. IEEE Computer Society, Los Alamitos, CA, USA, 994–999.
M. L. Ginsberg 1990. Bilattices and modal operators. Journal of Logic and Computation 1, 1–41.
S. Gong and T. Xiang 2003. Recognition of group activities using dynamic probabilistic networks. In Proceedings of International Conference on Computer Vision. IEEE Computer Society, Los Alamitos, CA, USA, 742–749.
A. Hakeem and M. Shah 2007. Learning, detection and representation of multi-agent events in videos. Artificial Intelligence 171, 8–9, 586–605.
S. Hongeng and R. Nevatia 2003. Large-scale event detection using semi-Hidden Markov Models. In Proceedings of International Conference on Computer Vision. IEEE Computer Society, Los Alamitos, CA, USA, 1455–1462.
R. Kowalski and M. Sergot 1986. A logic-based calculus of events. New Generation Computing 4, 1, 67–96.
L. Liao , D. Fox and H. Kautz 2007. Hierarchical conditional random fields for GPS-based activity recognition. Robotics Research 28, 487–506.
L. Rabiner and B. Juang 1986. An introduction to Hidden Markov Models. ASSP Magazine 3, 1, 4–16.
M. Richardson and P. Domingos 2006. Markov logic networks. Machine Learning 62, 1–2, 107–136.
D. Vail , M. Veloso and J. Lafferty 2007. Conditional random fields for activity recognition. In Proceedings of International Conference on Autonomous Agents and Multiagent Systems (AAMAS). ACM, New York, NY, USA, 1–8.
L. G. Valiant 1979. The complexity of enumeration and reliability problems. SIAM Journal on Computing 8, 410–421.