{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:09:19Z","timestamp":1748664559312,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232638"},{"type":"electronic","value":"9783319232645"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23264-5_35","type":"book-chapter","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T06:29:48Z","timestamp":1442212188000},"page":"425-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compacting Boolean Formulae for Inference in Probabilistic Logic Programming"],"prefix":"10.1007","author":[{"given":"Theofrastos","family":"Mantadelis","sequence":"first","affiliation":[]},{"given":"Dimitar","family":"Shterionov","sequence":"additional","affiliation":[]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,15]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: Faster SAT and smaller BDDs via common function structure. In: ICCAD, pp. 443\u2013448 (2001)","DOI":"10.1109\/ICCAD.2001.968669"},{"key":"35_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-540-24605-3_26","volume-title":"Theory and Applications of Satisfiability Testing","author":"F Bacchus","year":"2004","unstructured":"Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 341\u2013355. Springer, Heidelberg (2004)"},{"issue":"8","key":"35_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"35_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W Chen","year":"1995","unstructured":"Chen, W., Swift, T., Warren, D.S.: Efficient top-down computation of queries under the well-founded semantics. JLP 24(3), 161\u2013199 (1995)","journal-title":"JLP"},{"key":"35_CR5","unstructured":"Darwiche, A.: A compiler for deterministic, decomposable negation normal form. In: AAAI\/IAAI, pp. 627\u2013634. AAAI Press\/MIT Press (2002)"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. JAIR 17, 229\u2013264 (2002)","journal-title":"JAIR"},{"key":"35_CR7","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic Prolog and its application in link discovery. In: IJCAI, pp. 2468\u20132473. AAAI Press (2007)"},{"issue":"3","key":"35_CR8","first-page":"358","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D.S., Gutmann, B., Thon, I., Janssens, G., De Raedt, L.: Inference and learning in probabilistic logic programs using weighted boolean formulas. TPLP 15(3), 358\u2013401 (2015)","journal-title":"TPLP"},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-74976-9_48","volume-title":"Knowledge Discovery in Databases: PKDD 2007","author":"P Hintsanen","year":"2007","unstructured":"Hintsanen, P.: The most reliable subgraph problem. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 471\u2013478. Springer, Heidelberg (2007)"},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-31830-6_29","volume-title":"Bisociative Knowledge Discovery","author":"A Kimmig","year":"2012","unstructured":"Kimmig, A., Costa, F.: Link and node prediction in metabolic networks with probabilistic logic. In: Berthold, M.R. (ed.) Bisociative Knowledge Discovery. LNCS, vol. 7250, pp. 407\u2013426. Springer, Heidelberg (2012)"},{"key":"35_CR11","first-page":"235","volume":"11","author":"A Kimmig","year":"2011","unstructured":"Kimmig, A., Demoen, B., De Raedt, L., Santos Costa, V., Rocha, R.: On the implementation of the probabilistic logic programming language ProbLog. TPLP 11, 235\u2013262 (2011)","journal-title":"TPLP"},{"key":"35_CR12","unstructured":"Kowalski, R.A.: Predicate logic as programming language. In: IFIP Congress, pp. 569\u2013574 (1974)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Lagniez, J., Marquis, P.: Preprocessing for propositional model counting. In: AAAI, pp. 2688\u20132694 (2014)","DOI":"10.1609\/aaai.v28i1.9116"},{"key":"35_CR14","unstructured":"Mantadelis, T., Demoen, B., Janssens, G.: A simplified fast interface for the use of CUDD for binary decision diagrams (2008). http:\/\/people.cs.kuleuven.be\/theofrastos.mantadelis\/tools\/simplecudd.html"},{"key":"35_CR15","unstructured":"Mantadelis, T., Janssens, G.: Dedicated tabling for a probabilistic setting. In: ICLP (Technical Communications), LIPIcs, vol. 7, pp. 124\u2013133 (2010)"},{"key":"35_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-16242-8_36","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T Mantadelis","year":"2010","unstructured":"Mantadelis, T., Janssens, G.: Variable compression in ProbLog. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 504\u2013518. Springer, Heidelberg (2010)"},{"key":"35_CR17","unstructured":"Mantadelis, T., Janssens, G.: Nesting probabilistic inference (2011). CoRR, abs\/1112.3785"},{"key":"35_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-15675-5_23","volume-title":"Logics in Artificial Intelligence","author":"T Mantadelis","year":"2010","unstructured":"Mantadelis, T., Rocha, R., Kimmig, A., Janssens, G.: Preprocessing boolean formulae for BDDs in a probabilistic context. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 260\u2013272. Springer, Heidelberg (2010)"},{"key":"35_CR19","unstructured":"Moldovan, B., van Otterlo, M., Moreno, P., Santos-Victor, J., De Raedt, L.: Statistical relational learning of object affordances for robotic manipulation. In: ILP, p. 6 (2012)"},{"issue":"3\u20134","key":"35_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01581210","volume":"1","author":"J Mostow","year":"1990","unstructured":"Mostow, J.: Towards automated development of specialized algorithms for design synthesis: knowledge compilation as an approach to computer-aided design. Res. Eng. Des. 1(3\u20134), 167\u2013186 (1990)","journal-title":"Res. Eng. Des."},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Namioka, Y., Tanaka, T.: Knowledge compilation for interactive design of sequence control programs. In: IEA\/AIE, pp. 363\u2013368 (1996)","DOI":"10.1201\/9780429332111-62"},{"key":"35_CR22","unstructured":"Narodytska, N., Walsh, T.: Constraint and variable ordering heuristics for compiling configuration problems. In: IJCAI, pp. 149\u2013154 (2007)"},{"key":"35_CR23","unstructured":"Panda, S., Somenzi, F.: Who are the variables in your neighborhood. In: ICCAD, pp. 74\u201377 (1995)"},{"issue":"1","key":"35_CR24","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0951-8320(02)00165-5","volume":"79","author":"A Rauzy","year":"2003","unstructured":"Rauzy, A., Ch\u00e2telet, E., Dutuit, Y., B\u00e9renguer, C.: A practical comparison of methods to assess sum-of-products. Reliab. Eng. Syst. Saf. 79(1), 33\u201342 (2003)","journal-title":"Reliab. Eng. Syst. Saf."},{"key":"35_CR25","unstructured":"Shterionov, D., Mantadelis, T., Janssens, G.: Pattern-based compaction for ProbLog inference. In: ICLP (Technical Communications), pp. 1\u20134 (2013)"},{"key":"35_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-319-19686-2_7","volume-title":"Practical Aspects of Declarative Languages","author":"D Shterionov","year":"2015","unstructured":"Shterionov, D., Janssens, G.: Implementation and performance of probabilistic inference pipelines. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 90\u2013104. Springer, Heidelberg (2015)"},{"key":"35_CR27","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Why is Boolean complexity theory difficult? In: London Mathematical Society Symposium on Boolean Function Complexity, pp. 84\u201394 (1992)","DOI":"10.1017\/CBO9780511526633.008"},{"key":"35_CR28","unstructured":"Vlasselaer, J., Meert, W.: Statistical relational learning for prognostics. In: Belgian-Dutch Conference on Machine Learning, pp. 45\u201350 (2012)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23264-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T16:22:15Z","timestamp":1748622135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23264-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232638","9783319232645"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23264-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"15 September 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}