{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:36Z","timestamp":1725567576653},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_36","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"504-518","source":"Crossref","is-referenced-by-count":1,"title":["Variable Compression in ProbLog"],"prefix":"10.1007","author":[{"given":"Theofrastos","family":"Mantadelis","sequence":"first","affiliation":[]},{"given":"Gerda","family":"Janssens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic prolog and its application in link discovery. In: Proceedings of IJCAI, pp. 2462\u20132467 (2007)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-89982-2_22","volume-title":"Logic Programming","author":"A. Kimmig","year":"2008","unstructured":"Kimmig, A., Santos Costa, V., Rocha, R., Demoen, B., De Raedt, L.: On the efficient execution of ProbLog programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 175\u2013189. Springer, Heidelberg (2008)"},{"issue":"6","key":"36_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Computers\u00a027(6), 509\u2013516 (1978)","journal-title":"IEEE Trans. Computers"},{"issue":"8","key":"36_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"36_CR5","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"36_CR6","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. Safe\u00a079(1), 33\u201342 (2003)","journal-title":"Reliab. Eng. Syst. Safe"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Fujita, M., Fujisawa, H., Kawato, M.: Evaluation and improvements of boolean comparison method based on binary decision diagrams. In: Proceedings of ICCAD, pp. 2\u20135 (1988)","DOI":"10.1109\/ICCAD.1988.122450"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Malik, S., Wang, A., Brayton, R., Sangionvanni-Vincentelli, A.: Logic verification using binary decision diagrams in a logic synthesis environment. In: Proceedings of ICCAD, pp. 6\u20139 (1988)","DOI":"10.1109\/ICCAD.1988.122451"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Rudell, R.: Dynamic variable ordering for ordered binary decision diagrams. In: Proceedings of ICCAD, pp. 42\u201347 (1993)","DOI":"10.1109\/ICCAD.1993.580029"},{"issue":"2","key":"36_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s100090100042","volume":"3","author":"F. Somenzi","year":"2001","unstructured":"Somenzi, F.: Efficient manipulation of decision diagrams. STTT\u00a03(2), 171\u2013181 (2001)","journal-title":"STTT"},{"key":"36_CR11","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11799511_5","volume-title":"Data Integration in the Life Sciences","author":"P. Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Leser, U., Naumann, F., Eckman, B. (eds.) DILS 2006. LNCS (LNBI), vol.\u00a04075, pp. 35\u201349. Springer, Heidelberg (2006)"},{"issue":"2","key":"36_CR12","first-page":"322","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. ACM\u00a025(2), 322\u2013336 (1978)","journal-title":"ACM"},{"key":"36_CR13","unstructured":"Somenzi, F.: CUDD: Colorado university decision diagram package release 2.4.1 (2005), http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/"},{"key":"36_CR14","unstructured":"Panda, S., Somenzi, F.: Who are the variables in your neighborhood. In: Proceedings of ICCAD, pp. 74\u201377 (1995)"},{"key":"36_CR15","unstructured":"Santos Costa, V., Damas, L., Reis, R., Azevedo, R.: YAP User\u2019s Manual (2002), http:\/\/www.ncc.up.pt\/~vsc\/Yap"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Aloul, F.A., Markov, I.L., Sakallah, K.A.: Faster SAT and smaller BDDs via common function structure. In: Proceedings of ICCAD, pp. 443\u2013448 (2001)","DOI":"10.1109\/ICCAD.2001.968669"},{"key":"36_CR17","unstructured":"Narodytska, N., Walsh, T.: Constraint and variable ordering heuristics for compiling configuration problems. In: Proceedings of IJCAI, pp. 149\u2013154 (2007)"},{"key":"36_CR18","series-title":"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.\u00a04702, pp. 471\u2013478. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T10:18:02Z","timestamp":1591957082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}