{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T01:29:00Z","timestamp":1762738140209},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T00:00:00Z","timestamp":1194480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10994-007-5030-x","type":"journal-article","created":{"date-parts":[[2007,11,7]],"date-time":"2007-11-07T09:01:30Z","timestamp":1194426090000},"page":"151-168","source":"Crossref","is-referenced-by-count":19,"title":["Compressing probabilistic Prolog programs"],"prefix":"10.1007","volume":"70","author":[{"given":"L.","family":"De Raedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Kersting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Kimmig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Revoredo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Toivonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,8]]},"reference":[{"issue":"8","key":"5030_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. E. Bryant","year":"1986","unstructured":"Bryant, R. E. (1986). Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8), 677\u2013691.","journal-title":"IEEE Transactions on Computers"},{"key":"5030_CR2","first-page":"2443","volume-title":"Proceedings of the 20th international joint conference on artificial intelligence","author":"M. Chavira","year":"2007","unstructured":"Chavira, M., & Darwiche, A. (2007). Compiling Bayesian networks using variable elimination. In M. Veloso (Ed.), Proceedings of the 20th international joint conference on artificial intelligence (pp. 2443\u20132449). Menlo Park: AAAI Press."},{"issue":"1","key":"5030_CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/959242.959247","volume":"5","author":"L. Raedt De","year":"2003","unstructured":"De Raedt, L., & Kersting, K. (2003). Probabilistic logic learning. SIGKDD Explorations, 5(1), 31\u201348.","journal-title":"SIGKDD Explorations"},{"key":"5030_CR4","first-page":"2468","volume-title":"Proceedings of the 20th international joint conference on artificial intelligence","author":"L. Raedt De","year":"2007","unstructured":"De Raedt, L., Kimmig, A., & Toivonen, H. (2007). ProbLog: a probabilistic Prolog and its application in link discovery. In M. Veloso (Ed.), Proceedings of the 20th international joint conference on artificial intelligence (pp. 2468\u20132473). Menlo Park: AAAI Press."},{"key":"5030_CR5","volume-title":"Simply logical: intelligent reasoning by example","author":"P. A. Flach","year":"1994","unstructured":"Flach, P. A. (1994). Simply logical: intelligent reasoning by example. New York: Wiley."},{"key":"5030_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/(SICI)1097-4571(2000)51:2<95::AID-ASI2>3.0.CO;2-H","volume":"51","author":"N. Fuhr","year":"2000","unstructured":"Fuhr, N. (2000). Probabilistic datalog: implementing logical information retrieval for advanced applications. Journal of the American Society for Information Science, 51, 95\u2013110.","journal-title":"Journal of the American Society for Information Science"},{"key":"5030_CR7","volume-title":"Statistical relational learning","year":"2007","unstructured":"Getoor, L., & Taskar, B. (Eds.). (2007). Statistical relational learning. Cambridge: MIT Press."},{"key":"5030_CR8","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.27","volume":"1","author":"M. Koppel","year":"1994","unstructured":"Koppel, M., Feldman, R., & Segre, A. M. (1994). Bias-driven revision of logical domain theories. Journal of Artificial Intelligence Research, 1, 159\u2013208.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5030_CR9","first-page":"2550","volume-title":"Proceedings of the 20th international joint conference on artificial intelligence","author":"S. Minato","year":"2007","unstructured":"Minato, S., Satoh, K., & Sato, T. (2007). Compiling Bayesian networks by symbolic probability calculation based on zero-suppressed BDDs. In M. Veloso (Ed.), Proceedings of the 20th international joint conference on artificial intelligence (pp. 2550\u20132555). Menlo Park: AAAI Press."},{"key":"5030_CR10","volume-title":"Advances in inductive logic programming","author":"S. H. Muggleton","year":"1996","unstructured":"Muggleton, S. H. (1996). Stochastic logic programs. In L. De Raedt (Ed.), Advances in inductive logic programming. Amsterdam: IOS Press."},{"key":"5030_CR11","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1038\/ng895","volume":"31","author":"C. Perez-Iratxeta","year":"2002","unstructured":"Perez-Iratxeta, C., Bork, P., & Andrade, M. A. (2002). Association of genes to genetically inherited diseases using data mining. Nature Genetics, 31, 316\u2013319.","journal-title":"Nature Genetics"},{"key":"5030_CR12","unstructured":"Poole, D. (1992). Logic programming, abduction and probability. In Fifth generation computing systems (pp.\u00a0530\u2013538)."},{"key":"5030_CR13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","volume":"64","author":"D. Poole","year":"1993","unstructured":"Poole, D. (1993). Probabilistic Horn abduction and Bayesian networks. Artificial Intelligence, 64, 81\u2013129.","journal-title":"Artificial Intelligence"},{"key":"5030_CR14","first-page":"391","volume":"15","author":"T. Sato","year":"2001","unstructured":"Sato, T., & Kameya, Y. (2001). Parameter learning of logic programs for symbolic-statistical modeling. Journal of AI Research, 15, 391\u2013454.","journal-title":"Journal of AI Research"},{"key":"5030_CR15","series-title":"Lecture notes in bioinformatics","volume-title":"Data integration in the life sciences 2006","author":"P. Sevon","year":"2006","unstructured":"Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., & Toivonen, H. (2006). Link discovery in graphs derived from biological databases. In U. Leser, F. Naumann, & B. Eckman (Eds.), Lecture notes in bioinformatics : Vol. 4075. Data integration in the life sciences 2006. Berlin: Springer."},{"key":"5030_CR16","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8, 410\u2013411.","journal-title":"SIAM Journal of Computing"},{"key":"5030_CR17","volume-title":"Advances in inductive logic programming","author":"S. Wrobel","year":"1996","unstructured":"Wrobel, S. (1996). First Order Theory Refinement. In L. De Raedt (Ed.), Advances in inductive logic programming. Amsterdam: IOS Press."},{"key":"5030_CR18","unstructured":"Zelle, J. M., & Mooney, R. J. (1994). Inducing deterministic Prolog parsers from treebanks: a machine learning approach. In Proceedings of the 12th national conference on artificial intelligence (AAAI-94) (pp.\u00a0748\u2013753)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5030-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-007-5030-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-007-5030-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:23Z","timestamp":1559338823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-007-5030-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,8]]},"references-count":18,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["5030"],"URL":"https:\/\/doi.org\/10.1007\/s10994-007-5030-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,8]]}}}