{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:42:19Z","timestamp":1762101739406,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T00:00:00Z","timestamp":1428883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004040","name":"KU Leuven","doi-asserted-by":"publisher","award":["GOA 13\/010"],"award-info":[{"award-number":["GOA 13\/010"]}],"id":[{"id":"10.13039\/501100004040","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,4,13]]},"DOI":"10.1145\/2695664.2696006","type":"proceedings-article","created":{"date-parts":[[2015,7,20]],"date-time":"2015-07-20T19:10:09Z","timestamp":1437419409000},"page":"1887-1889","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Crucial components in probabilistic inference pipelines"],"prefix":"10.1145","author":[{"given":"Dimitar","family":"Shterionov","sequence":"first","affiliation":[{"name":"KULeuven Celestijnenlaan, Heverlee, Belgium"}]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[{"name":"KULeuven Celestijnenlaan, Heverlee, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2015,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00028-5"},{"key":"e_1_3_2_1_3_1","first-page":"627","volume-title":"A compiler for deterministic, decomposable negation normal form","author":"Darwiche Adnan","year":"2002","unstructured":"Adnan Darwiche . A compiler for deterministic, decomposable negation normal form . In Rina Dechter and Richard S. Sutton, editors, AAAI\/IAAI, pages 627 -- 634 . AAAI Press\/MIT Press , 2002 . Adnan Darwiche. A compiler for deterministic, decomposable negation normal form. In Rina Dechter and Richard S. Sutton, editors, AAAI\/IAAI, pages 627--634. AAAI Press\/MIT Press, 2002."},{"key":"e_1_3_2_1_4_1","first-page":"328","volume-title":"Proceedings of the 16th European Conference on Artificial Intelligence","author":"Darwiche Adnan","year":"2004","unstructured":"Adnan Darwiche . New advances in compiling CNF into decomposable negation normal form . In Proceedings of the 16th European Conference on Artificial Intelligence , pages 328 -- 332 , 2004 . Adnan Darwiche. New advances in compiling CNF into decomposable negation normal form. In Proceedings of the 16th European Conference on Artificial Intelligence, pages 328--332, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1534901"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622810.1622817"},{"key":"e_1_3_2_1_7_1","first-page":"2468","volume-title":"Proceedings of the 20th International Joint Conference on Artificial Intelligence","author":"Raedt Luc De","year":"2007","unstructured":"Luc De Raedt , Angelika Kimmig , and Hannu Toivonen . ProbLog : a probabilistic Prolog and its application in link discovery . In Proceedings of the 20th International Joint Conference on Artificial Intelligence , pages 2468 -- 2473 . AAAI Press , 2007 . Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. ProbLog: a probabilistic Prolog and its application in link discovery. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pages 2468--2473. AAAI Press, 2007."},{"key":"e_1_3_2_1_8_1","volume-title":"Joris Renkens, Dimitar Shterionov","author":"Fierens Daan","year":"2013","unstructured":"Daan Fierens , Guy Van Den Broek , Joris Renkens, Dimitar Shterionov , Bern Gutmann , Ingo Thon, Gerda Janssens, and Luc de Raedt. Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory and Practice of Logic Programming, Special Issue on Probability, Logic and Learning , 2013 . Daan Fierens, Guy Van Den Broek, Joris Renkens, Dimitar Shterionov, Bern Gutmann, Ingo Thon, Gerda Janssens, and Luc de Raedt. Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory and Practice of Logic Programming, Special Issue on Probability, Logic and Learning, 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3000001.3000077"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000566"},{"key":"e_1_3_2_1_11_1","unstructured":"Theofrastos\n      Mantadelis\n     and \n      Gerda\n      Janssens\n    .\n  Dedicated tabling for a probabilistic setting\n  . In Manuel V. Hermenegildo and Torsten Schaub editors ICLP (Technical Communications) volume \n  7\n   of \n  LIPIcs pages \n  124\n  --\n  133\n  . Schloss Dagstuhl - Leibniz-Zentrum fuer \n  Informatik 2010\n  .  Theofrastos Mantadelis and Gerda Janssens. Dedicated tabling for a probabilistic setting. In Manuel V. Hermenegildo and Torsten Schaub editors ICLP (Technical Communications) volume 7 of LIPIcs pages 124--133. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2010."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30353-1_36"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0951-8320(02)00165-5"}],"event":{"name":"SAC 2015: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Salamanca Spain","acronym":"SAC 2015"},"container-title":["Proceedings of the 30th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695664.2696006","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2695664.2696006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:27Z","timestamp":1750227147000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2695664.2696006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,13]]},"references-count":13,"alternative-id":["10.1145\/2695664.2696006","10.1145\/2695664"],"URL":"https:\/\/doi.org\/10.1145\/2695664.2696006","relation":{},"subject":[],"published":{"date-parts":[[2015,4,13]]},"assertion":[{"value":"2015-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}