{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:01:12Z","timestamp":1760598072273,"version":"3.40.5"},"reference-count":32,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T00:00:00Z","timestamp":1632355200000},"content-version":"unspecified","delay-in-days":22,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Probabilistic logic programming is an effective formalism for encoding problems characterized by uncertainty. Some of these problems may require the optimization of probability values subject to constraints among probability distributions of random variables. Here, we introduce a new class of probabilistic logic programs, namely probabilistic<jats:italic>optimizable<\/jats:italic>logic programs, and we provide an effective algorithm to find the best assignment to probabilities of random variables, such that a set of constraints is satisfied and an objective function is optimized.<\/jats:p>","DOI":"10.1017\/s1471068421000260","type":"journal-article","created":{"date-parts":[[2021,9,23]],"date-time":"2021-09-23T06:48:08Z","timestamp":1632379688000},"page":"543-556","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Probabilities in Probabilistic Logic Programs"],"prefix":"10.1017","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7133-2673","authenticated-orcid":false,"given":"DAMIANO","family":"AZZOLINI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1654-9703","authenticated-orcid":false,"given":"FABRIZIO","family":"RIGUZZI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2021,9,23]]},"reference":[{"key":"S1471068421000260_ref23","unstructured":"Riguzzi, F. and Swift, T. 2010. Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. In Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010. LIPIcs, vol. 7. Schloss Dagstuhl, 162\u2013171."},{"key":"S1471068421000260_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103452"},{"key":"S1471068421000260_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-017-5668-y"},{"key":"S1471068421000260_ref4","doi-asserted-by":"crossref","unstructured":"Babaki, B. , Guns, T. and de Raedt, L. 2017. Stochastic constraint programming with and-or branch-and-bound. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-2017, 539\u2013545.","DOI":"10.24963\/ijcai.2017\/76"},{"key":"S1471068421000260_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/12.537122"},{"key":"S1471068421000260_ref26","doi-asserted-by":"publisher","DOI":"10.1613\/jair.912"},{"key":"S1471068421000260_ref30","doi-asserted-by":"crossref","unstructured":"Vennekens, J. , Verbaeten, S. and Bruynooghe, M. 2004. Logic programs with annotated disjunctions. In 20th International Conference on Logic Programming (ICLP 2004), Demoen, B. and Lifschitz, V. , Eds. Lecture Notes in Computer Science, vol. 3131. Springer, 431\u2013445.","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"S1471068421000260_ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499362822"},{"key":"S1471068421000260_ref17","first-page":"262","article-title":"Algorithm 733: Tomp\u2013Fortran modules for optimal control calculations","volume":"3","author":"Kraft","year":"1994","journal-title":"20"},{"key":"S1471068421000260_ref29","unstructured":"Van den Broeck, G. , Thon, I. , van Otterlo, M. and De Raedt, L. 2010. DTProbLog: A decision-theoretic probabilistic Prolog. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, Fox, M. and Poole, D. , Eds. AAAI Press, 1217\u20131222."},{"key":"S1471068421000260_ref12","doi-asserted-by":"crossref","unstructured":"Gutmann, B. , Thon, I. and De Raedt, L. 2011. Learning the parameters of probabilistic logic programs from interpretations. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD 2011), Gunopulos, D. , Hofmann, T. , Malerba, D. , and Vazirgiannis, M. , Eds. Lecture Notes in Computer Science, vol. 6911. Springer, 581\u2013596.","DOI":"10.1007\/978-3-642-23780-5_47"},{"key":"S1471068421000260_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78652-8"},{"key":"S1471068421000260_ref31","first-page":"111","article-title":"Stochastic constraint programming","volume":"1","author":"Walsh","year":"2002","journal-title":"Proceedings of the 15th European Conference on Artificial Intelligence"},{"key":"S1471068421000260_ref15","unstructured":"Kimmig, A. , Van den Broeck, G. and De Raedt, L. 2011. An algebraic prolog for reasoning about possible worlds. In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence. Vol. 1. AAAI Press, 209\u2013214."},{"key":"S1471068421000260_ref9","unstructured":"De Raedt, L. , Kimmig, A. and Toivonen, H. 2007. Problog: A probabilistic prolog and its application in link discovery. In IJCAI, M. M. Veloso, Ed., 2462\u20132467."},{"key":"S1471068421000260_ref14","unstructured":"Johnson, S. G. 2020. The nlopt nonlinear-optimization package."},{"key":"S1471068421000260_ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000076"},{"key":"S1471068421000260_ref24","doi-asserted-by":"crossref","unstructured":"Rossi, R. A. and Ahmed, N. K. 2015. The network data repository with interactive graph analytics and visualization. In AAAI.","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"S1471068421000260_ref25","unstructured":"Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming, L. Sterling, Ed. MIT Press, 715\u2013729."},{"year":"2019","author":"Azzolini","key":"S1471068421000260_ref3"},{"volume-title":"CUDD: CU Decision Diagram Package Release 3.0.0","year":"2015","author":"Somenzi","key":"S1471068421000260_ref27"},{"key":"S1471068421000260_ref32","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000494"},{"key":"S1471068421000260_ref1","doi-asserted-by":"crossref","unstructured":"Antuori, V. and Richoux, F. 2019. Constrained optimization under uncertainty for decision-making problems: Application to real-time strategy games. In 2019 IEEE Congress on Evolutionary Computation (CEC), 458\u2013465.","DOI":"10.1109\/CEC.2019.8789922"},{"volume-title":"Foundations of Probabilistic Logic Programming","year":"2018","author":"Riguzzi","key":"S1471068421000260_ref22"},{"volume-title":"Adaptive Computation and Machine Learning","year":"2009","author":"Koller","key":"S1471068421000260_ref16"},{"key":"S1471068421000260_ref7","doi-asserted-by":"publisher","DOI":"10.1613\/jair.989"},{"key":"S1471068421000260_ref11","doi-asserted-by":"crossref","unstructured":"Gutmann, B. , Kimmig, A. , Kersting, K. and De Raedt, L. 2008. Parameter learning in probabilistic databases: A least squares approach. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD 2008). Lecture Notes in Computer Science, vol. 5211. Springer, 473\u2013488.","DOI":"10.1007\/978-3-540-87479-9_49"},{"key":"S1471068421000260_ref13","unstructured":"Jiang, C. , Babar, J. , Ciardo, G. , Miner, A. S. and Smith, B. 2017. Variable reordering in binary decision diagrams. In 26th International Workshop on Logic and Synthesis, 1\u20138."},{"key":"S1471068421000260_ref18","doi-asserted-by":"crossref","unstructured":"Latour, A. L. D. , Babaki, B. , Dries, A. , Kimmig, A. , Van den Broeck, G. and Nijssen, S. 2017. Combining stochastic constraint optimization and probabilistic programming. In Principles and Practice of Constraint Programming, J. C. Beck, Ed. Springer International Publishing, Cham, 495\u2013511.","DOI":"10.1007\/978-3-319-66158-2_32"},{"key":"S1471068421000260_ref20","doi-asserted-by":"crossref","unstructured":"Meurer, A. , Smith, C. P. , Paprocki, M. , \u010cert\u00edk, O. , Kirpichev, S. B. , Rocklin, M. , Kumar, A. , Ivanov, S. , Moore, J. K. , Singh, S. , Rathnayake, T. , Vig, S. , Granger, B. E. , Muller, R. P. , Bonazzi, F. , Gupta, H. , Vats, S. , Johansson, F. , Pedregosa, F. , Curry, M. J. , Terrel, A. R. , Rou\u010dka, V. , Saboo, A. , Fernando, I. , Kulal, S. , Cimrman, R. and Scopatz, A. 2017. Sympy: Symbolic computing in python. PeerJ Computer Science 3, e103.","DOI":"10.7717\/peerj-cs.103"},{"key":"S1471068421000260_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.02.004"},{"key":"S1471068421000260_ref5","doi-asserted-by":"crossref","unstructured":"Bellodi, E. and Riguzzi, F. 2012. Learning the structure of probabilistic logic programs. In 22nd International Conference on Inductive Logic Programming, Muggleton, S. , Tamaddoni-Nezhad, A. and Lisi, F. , Eds. Lecture Notes in Computer Science, vol. 7207. Springer Berlin Heidelberg, 61\u201375.","DOI":"10.1007\/978-3-642-31951-8_10"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068421000260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T00:35:39Z","timestamp":1673310939000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068421000260\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S1471068421000260"],"URL":"https:\/\/doi.org\/10.1017\/s1471068421000260","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2021,9]]},"assertion":[{"value":"\u00a9 The Author(s), 2021. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}