APT Logic
Annotated Probabilistic Temporal Logic
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." APT Logic extends the well known "annotated logic" paradigm due to Kifer and Subrahamanian to support the expression of such statements. Our APT-EXTRACT algorithm can automatically extract APT rules from certain types of data sources. In particular, we have used APT-EXTRACT to extract rules about the behavior of over 30 terror groups worldwide. These rules allow us to understand not only the circumstances under which these groups take certain actions, but how the temporal relationship between when the circumstances became true and when the group took those actions. Our APT Logic work provides a formal theoretical basis for sets of APT rules extracted in this way, together with algorithms to answer various kinds of queries and make certain types of forecasts.
Project Lead: Prof. VS Subrahmanian.
For additional information, please contact Prof. VS Subrahmanian.
Last updated: December, 2009.
This research is currently unsponsored. Please contact VS Subrahmanian if you are interested in funding this project.
Research and implementation of this project is performed by members of the University of Maryland.
This page will be updated as our work enters print. For information about receiving draft publications, technical reports, and conference presentations, please do not hesitate to contact team members.
The following sections may include links to restricted access material. Please do not hesitate to contact a group member for instructions regarding how to obtain a username and password.
The following sections may include links to restricted access material. Please do not hesitate to contact a group member for instructions regarding how to obtain a username and password.