{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:10:27Z","timestamp":1758273027885,"version":"3.41.0"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF0910206"],"award-info":[{"award-number":["W911NF0910206"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000140910685"],"award-info":[{"award-number":["N000140910685"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95500610405"],"award-info":[{"award-number":["FA95500610405"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2012,4]]},"abstract":"<jats:p>\n            Annotated Probabilistic Temporal (APT) logic programs support building applications where we wish to reason about statements of the form \u201cFormula\n            <jats:italic>G<\/jats:italic>\n            becomes true with a probability in the range [\n            <jats:italic>L<\/jats:italic>\n            ,\n            <jats:italic>U<\/jats:italic>\n            ] within (or in exactly)\n            <jats:italic>\u0394t<\/jats:italic>\n            time units after formula\n            <jats:italic>F<\/jats:italic>\n            became true.\u201d In this paper, we present a sound, but incomplete fixpoint operator that can be used to check consistency and entailment in APT logic programs. We present the first implementation of APT-logic programs and evaluate both its compute time and convergence on a suite of 23 ground APT-logic programs that were automatically learned from two real-world data sets. In both cases, the APT-logic programs contained up to 1,000 ground rules. In one data set, entailment problems were solved on average in under 0.1 seconds per ground rule, while in the other, it took up to 1.3 seconds per ground rule. Consistency was also checked in a reasonable amount of time. When discussing entailment of APT-logic formulas, convergence of the fixpoint operator refers to (\n            <jats:italic>U<\/jats:italic>\n            \u2009\u2212\u2009\n            <jats:italic>L<\/jats:italic>\n            ) being below a certain threshold. We show that on virtually all of the 23 automatically generated APT-logic programs, convergence was quick---often in just 2-3 iterations of the fixpoint operator. Thus, our implementation is a practical first step towards checking consistency and entailment in temporal probabilistic logics without independence or Markovian assumptions.\n          <\/jats:p>","DOI":"10.1145\/2159531.2159535","type":"journal-article","created":{"date-parts":[[2012,4,24]],"date-time":"2012-04-24T18:41:10Z","timestamp":1335292870000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Annotated Probabilistic Temporal Logic"],"prefix":"10.1145","volume":"13","author":[{"given":"Paulo","family":"Shakarian","sequence":"first","affiliation":[{"name":"University of Maryland, College Park"}]},{"given":"Gerardo I.","family":"Simari","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park"}]},{"given":"V. S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park"}]}],"member":"320","published-online":{"date-parts":[[2012,4]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/4.5.531"},{"key":"e_1_2_2_2_1","unstructured":"Asal V. Carter J. and Wilkenfeld J. 2008. Ethnopolitical violence and terrorism in the middle east. In Peace and Conflict 2008 J. Hewitt J. Wilkenfeld and T. Gurr Eds. Paradigm. Asal V. Carter J. and Wilkenfeld J. 2008. Ethnopolitical violence and terrorism in the middle east. In Peace and Conflict 2008 J. Hewitt J. Wilkenfeld and T. Gurr Eds. Paradigm."},{"key":"e_1_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Aziz A. Singhal V. Balarin F. Brayton R. K. and Sangiovanni-vincentelli A. L. 1995. It Usually Works: The Temporal Logic of Stochastic Systems. Springer 155--165. Aziz A. Singhal V. Balarin F. Brayton R. K. and Sangiovanni-vincentelli A. L. 1995. It Usually Works: The Temporal Logic of Stochastic Systems . Springer 155--165.","DOI":"10.1007\/3-540-60045-0_48"},{"volume-title":"Linear Programming","author":"Chvtal V.","key":"e_1_2_2_4_1","unstructured":"Chvtal , V. 1983. Linear Programming . W. H. Freeman , New York . Chvtal, V. 1983. Linear Programming. W. H. Freeman, New York."},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.03.048"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11546207_26"},{"volume-title":"Proceedings of the International Conference on Logic Programming. MIT Press","author":"Dekhtyar A.","key":"e_1_2_2_7_1","unstructured":"Dekhtyar , A. , Dekhtyar , M. I. , and Subrahmanian , V. S . 1999. Temporal probabilistic logic programs . In Proceedings of the International Conference on Logic Programming. MIT Press , Cambridge, MA, 109--123. Dekhtyar, A., Dekhtyar, M. I., and Subrahmanian, V. S. 1999. Temporal probabilistic logic programs. In Proceedings of the International Conference on Logic Programming. MIT Press, Cambridge, MA, 109--123."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/959242.959247"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119439.1119444"},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Emerson E. A. and Halpern J. Y. 1984. \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time. Tech. rep. Austin TX. Emerson E. A. and Halpern J. Y. 1984. \u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear time. Tech. rep. Austin TX.","DOI":"10.1145\/567067.567081"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90060-U"},{"volume-title":"Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA\u201902)","author":"Giugno R.","key":"e_1_2_2_12_1","unstructured":"Giugno , R. and Lukasiewicz , T . 2002. P-shoq(d): A probabilistic extension of shoq(d) for probabilistic ontologies in the semantic web . In Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA\u201902) . Springer, 86--97. Giugno, R. and Lukasiewicz, T. 2002. P-shoq(d): A probabilistic extension of shoq(d) for probabilistic ontologies in the semantic web. In Proceedings of the European Conference on Logics in Artificial Intelligence (JELIA\u201902). Springer, 86--97."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211866"},{"volume-title":"Map of special groups activity in Iraq","key":"e_1_2_2_14_1","unstructured":"ISW. 2008. Map of special groups activity in Iraq . Institute for the Study of War. ISW. 2008. Map of special groups activity in Iraq. Institute for the Study of War."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.003"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00245460"},{"volume-title":"Proceedings of the Workshop on Advances in Verification (WAVE\u201900)","author":"Kwiatkowska M.","key":"e_1_2_2_18_1","unstructured":"Kwiatkowska , M. , Norman , G. , and Parker , D . 2000. Verifying randomized distributed algorithms with PRISM . In Proceedings of the Workshop on Advances in Verification (WAVE\u201900) . Kwiatkowska, M., Norman, G., and Parker, D. 2000. Verifying randomized distributed algorithms with PRISM. In Proceedings of the Workshop on Advances in Verification (WAVE\u201900)."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1530873.1530882"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567463"},{"key":"e_1_2_2_21_1","volume-title":"Foundations of Logic Programming","author":"Lloyd J. W.","unstructured":"Lloyd , J. W. 1987. Foundations of Logic Programming 2 nd Ed. Springer-Verlag . Lloyd, J. W. 1987. Foundations of Logic Programming 2nd Ed. Springer-Verlag.","edition":"2"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016738205696"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90061-J"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(86)90031-7"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00092-1"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0888-613X(99)00009-2"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1877714.1877720"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.12"},{"key":"e_1_2_2_29_1","unstructured":"Wilkenfeld J. Asal V. Johnson C. Pate A. and Michael M. 2007. The use of violence by ethnopolitical organizations in the middle east. Tech. rep. National Consortium for the Study of Terrorism and Responses to Terrorism. Wilkenfeld J. Asal V. Johnson C. Pate A. and Michael M. 2007. The use of violence by ethnopolitical organizations in the middle east. Tech. rep. National Consortium for the Study of Terrorism and Responses to Terrorism."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2159531.2159535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2159531.2159535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:58Z","timestamp":1750244398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2159531.2159535"}},"subtitle":["Approximate Fixpoint Implementation"],"short-title":[],"issued":{"date-parts":[[2012,4]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["10.1145\/2159531.2159535"],"URL":"https:\/\/doi.org\/10.1145\/2159531.2159535","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2012,4]]},"assertion":[{"value":"2010-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}