{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:23:46Z","timestamp":1743085426415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030974534"},{"type":"electronic","value":"9783030974541"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97454-1_13","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"183-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A First Step Towards Even More Sparse Encodings of Probability Distributions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9683-5250","authenticated-orcid":false,"given":"Florian Andreas","family":"Marwitz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0282-4284","authenticated-orcid":false,"given":"Tanya","family":"Braun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1174-3323","authenticated-orcid":false,"given":"Ralf","family":"M\u00f6ller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10994-013-5385-0","volume":"92","author":"B Ahmadi","year":"2013","unstructured":"Ahmadi, B., Kersting, K., Mladenov, M., Natarajan, S.: Exploiting symmetries for scaling loopy belief propagation and relational training. Mach. Learn. 92(1), 91\u2013132 (2013)","journal-title":"Mach. Learn."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-46073-4_3","volume-title":"KI 2016: Advances in Artificial Intelligence","author":"T Braun","year":"2016","unstructured":"Braun, T., M\u00f6ller, R.: Lifted junction tree algorithm. In: Friedrich, G., Helmert, M., Wotawa, F. (eds.) KI 2016. LNCS (LNAI), vol. 9904, pp. 30\u201342. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46073-4_3"},{"key":"13_CR3","unstructured":"Van den Broeck, G., Taghipour, N., Meert, W., Davis, J., De Raedt, L.: Lifted probabilistic inference by first-order knowledge compilation. In: IJCAI 2011 Proceedings of the 22nd International Joint Conference on AI, pp. 2178\u20132185. IJCAI Organization (2011)"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40488-015-0028-6","volume":"2","author":"S Chakraborty","year":"2015","unstructured":"Chakraborty, S.: Generating discrete analogues of continuous probability distributions-a survey of methods and constructions. J. Stat. Distrib. Appl. 2(1), 1\u201330 (2015)","journal-title":"J. Stat. Distrib. Appl."},{"key":"13_CR5","unstructured":"Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: IJCAI 2007 Proceedings of the 20th International Joint Conference on AI, pp. 2443\u20132449. IJCAI Organization (2007)"},{"key":"13_CR6","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic prolog and its application in link discovery. In: IJCAI 2007 Proceedings of 20th International Joint Conference on AI, pp. 2062\u20132467. IJCAI Organization (2007)"},{"key":"13_CR7","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD 1996 Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining, pp. 226\u2013231. AAAI Press (1996)"},{"key":"13_CR8","unstructured":"Gogate, V., Domingos, P.: Probabilistic theorem proving. In: UAI 2011 Proceedings of the 27th Conference on Uncertainty in AI, pp. 256\u2013265. AUAI Press (2011)"},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1002\/j.1538-7305.1956.tb03835.x","volume":"35","author":"EJ McCluskey","year":"1956","unstructured":"McCluskey, E.J.: Minimization of Boolean functions. Bell Syst. Tech. J. 35(6), 1417\u20131444 (1956)","journal-title":"Bell Syst. Tech. J."},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-011-5244-9","volume":"86","author":"S Natarajan","year":"2012","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., Shavlik, J.: Gradient-based boosting for statistical relational learning: the relational dependency network case. Mach. Learn. 86, 25\u201356 (2012)","journal-title":"Mach. Learn."},{"key":"13_CR11","unstructured":"Poole, D.: First-order probabilistic inference. In: IJCAI 2003 Proceedings of the 18th International Joint Conference on AI, pp. 985\u2013991. IJCAI Organization (2003)"},{"issue":"1\u20132","key":"13_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1\u20132), 107\u2013136 (2006)","journal-title":"Mach. Learn."},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/3068335","volume":"42","author":"E Schubert","year":"2017","unstructured":"Schubert, E., Sander, J., Ester, M., Kriegel, H.P., Xu, X.: DBSCAN revisited, revisited: why and how you should (still) use DBSCAN. ACM Trans. Database Syst. (TODS) 42(3), 19 (2017)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1613\/jair.3793","volume":"47","author":"N Taghipour","year":"2013","unstructured":"Taghipour, N., Fierens, D., Davis, J., Blockeel, H.: Lifted variable elimination: decoupling the operators from the constraint language. J. Artif. Intell. Res. 47, 393\u2013439 (2013)","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR15","unstructured":"Van den Broeck, G.: Lifted inference and learning in statistical relational models. Ph.D. thesis, KU Leuven (2013)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-97454-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:03:43Z","timestamp":1645646623000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"160% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}