There are numerous applications where we need to make statements of the form "Formula G becomes true with 50 to 60% probability 5 time units after formula F became true." With APT Logic, we extract such rules from various data sources and will consider them with a reasoning engine to make predictions. In this way, we can make predictions based on temporal relationships over multiple units of time, as opposed to if-then type rules that consider only one period of time. Currently, we are extracting rules for numerous terror organizations, including HizbAllah.
Started in 2007
The goal of the CAGE project is to develop a software platform within which we can rapidly recreate a given part of the world - complete with the "look and feel" of that part of the world and, more importantly, with people who behave in accordance with models of the behaviors of the socio-cultural-ethnic-religious groups to which they belong, and whose behaviors can be predicted through the use of some of our predictive tools such as SOMA and CONVEX (as well as others that may be developed by other researchers).
Started in 2007
Given a road network describing the streets of a city, some high profile targets that terrorists might target, and some finite set of resources available for protection, how can a police, military or homeland security force best protect these potential targets?
Started in 2009
Nowadays there are plenty of applications which have to deal with incomplete and inconsistent data.
In many cases, different users of the same database might have different needs and might want to resolve inconsistency and incompleteness by taking their knowledge of the data into account. Tools for managing inconsistent and incomplete data today do not support such users.
The main goal of this project is to provide a single tool to define policies for handling inconsistency and incompleteness according to users' needs.
Started in 2008
SOMA is a straightforward variant of probabilistic logic programs (PLPs) called action-probabilistic logic programs (ap-programs) that can be used to model the behavior of certain socio-cultural-economic groups in different parts of the world.
Started in 2005
The SOMA Terror Organization Portal (STOP) is an online tool that provides national security experts, policy analysts, and political science researchers with a single point of contact through which to access data on terror organizations and the behavioral modeling and forecasting tools developed by LCCD.
Started in 2007
TREX is a generic, domain-independent Information Extraction system. The Automatic Coding Engine augments TREX extraction capabilities with a logic level, allowing to perform the reasoning steps needed to combine multiple facts and find answers to complex questions.
Started in 2006
Numerous applications need to continuously monitor a body of data for the occurrence of certain activities. Data to be monitored might include activity at an airport or military base or another sensitive site, video streams from surveillance cameras, or logs generated by web applications or any transaction processing system (e.g., ATMs). Applications might require activity detection to be preformed either in real-time as data is being received or offline after a body of data has been acquired. Activities tend to be high-level and can often be executed in many different ways.
Our research is aimed at developing techniques and algorithms to formally describe what the activities of interest are and identify instances of them from a body of data, both online and offline.
Started in 2006
We apply computational modeling techniques like SOMA, alongside computational game-theoretic analyses, to provide policy recommendations regarding Lashkhar-e-Taiba (LeT), a terrorist group in Pakistan.
Started in 2011
COSI leverages compute clouds and is not only the first algorithm to perform subgraph matching using clouds, but is also the first algorithm to perform subgraph matching of complex query subgraphs against a social network database consisting of 778M edges in under a second.
Started in 2009
In a social network, for example, a political candidate may wish to determine how support for him is spreading in the presence of competing messages from his opponent. The goal of competitive diffusion problems is to understand how the diffusion process is eventually resolved (e.g. is there more expected support for candidate A or candidate B?). We have developed efficient algorithms to solve competitive diffusion problems in the presence of any diffusion models (for the competing processes) that are expressible as Generalized Annotated (logic) Programs.
Started in 2009
The DOGMA project investigates novel approaches to storing and retrieving graph data from disk. DOGMA features index structures and retrieval algorithms inspired by concepts from graph theory which have been shown to outperform existing systems.
Started in 2008
In decision-making situations where there are sufficiently good models of all the relevant information, it is generally believed that looking ahead (to predict the possible results of one's actions) will help to produce better decisions. We have shown this to be false.
Started in 2004
Our objective is to develop formal models and computational techniques that will lead to better decision-making in various multi-player domains.
Started in 2004
Suppose you are interacting with a collection of agents who are unfamiliar to you. How can you decide the best way to behave? How can you overcome difficulties that might arise from accidents or miscommunications?
Started in 2004
We are developing formalisms and algorithms for game-tree search in partially-observable Euclidean space, and implementation and tests in a scenario where a multi-agent team of tracking agents pursues a target agent that wants to evade the tracking agents
Started in 2004
We investigate the phenomenon of social learning (learning from observations of the behavior of others), which is an important capability in many animal species, especially humans.
Started in 2004
Using generalized annotated programs, we study "social network optimization problems" (SNOPs) where we wish to achieve a certain goal (e.g. maximize the expected number of adoptees of a product or minimize the spread of a disease) where we have limited resources to use in trying to achieve the goal (e.g. give out a few free plans, provide medication to key people in the SN) - and want to use these resources in a way to maximize diffusion through the network.
Started in 2009
The ability to query social networking sites, understand how phenomena spread in a social network, and make intelligent decisions in social networks is key for many applications. The lab's social network research includes the DOGMA, COSI, SNOPs, and Diffusion projects.
Started in 2008
There are many applications where we have pairs of locations - observations and partners - in a geospatial area related based on a set of constraints. This new type of reasoning is called Geospatial Abduction. SCARE - the Spatio Cultural Abductive Reasoning Engine employs this new type of reasoning. Recently, we implemented SCARE to predict IED caches based on attack locations.
Started in 2009

