{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:48:09Z","timestamp":1780058889125,"version":"3.54.0"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319697741","type":"print"},{"value":"9783319697758","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69775-8_5","type":"book-chapter","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T04:23:14Z","timestamp":1509164594000},"page":"89-116","source":"Crossref","is-referenced-by-count":13,"title":["Probabilistic Logic Programming in Action"],"prefix":"10.1007","author":[{"given":"Arnaud Nguembang","family":"Fadja","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,10,29]]},"reference":[{"issue":"1","key":"5_CR1","first-page":"47","volume":"11","author":"M Alberti","year":"2017","unstructured":"Alberti, M., Bellodi, E., Cota, G., Riguzzi, F., Zese, R.: cplint on SWISH: probabilistic logical inference with a web browser. Intell. Artif. 11(1), 47\u201364 (2017)","journal-title":"Intell. Artif."},{"issue":"4\u20135","key":"5_CR2","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1017\/S1471068414000283","volume":"14","author":"E Bellodi","year":"2014","unstructured":"Bellodi, E., Lamma, E., Riguzzi, F., Costa, V.S., Zese, R.: Lifted variable elimination for probabilistic logic programming. Theor. Pract. Log. Prog. 14(4\u20135), 681\u2013695 (2014)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"1","key":"5_CR3","first-page":"3","volume":"8","author":"E Bellodi","year":"2012","unstructured":"Bellodi, E., Riguzzi, F.: Experimentation of an expectation maximization algorithm for probabilistic logic programs. Intell. Artif. 8(1), 3\u201318 (2012)","journal-title":"Intell. Artif."},{"issue":"2","key":"5_CR4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.3233\/IDA-130582","volume":"17","author":"E Bellodi","year":"2013","unstructured":"Bellodi, E., Riguzzi, F.: Expectation maximization over binary decision diagrams for probabilistic logic programs. Intell. Data Anal. 17(2), 343\u2013363 (2013)","journal-title":"Intell. Data Anal."},{"issue":"2","key":"5_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1017\/S1471068413000689","volume":"15","author":"E Bellodi","year":"2015","unstructured":"Bellodi, E., Riguzzi, F.: Structure learning of probabilistic logic programs by searching the clause space. Theor. Pract. Log. Prog. 15(2), 169\u2013212 (2015)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR6","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet allocation. J. Mach. Learn. Res. 3, 993\u20131022 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR7","unstructured":"Cozman, F.G., Mau\u00e1, D.D.: The structure and complexity of credal semantics. In: Hommersom, A., Abdallah, S.A. (eds.) PLP 2016, CEUR Workshop Proceedings, vol. 1661, pp. 3\u201314. CEUR-WS.org (2016)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-55460-2_11","volume-title":"Logic Programming","author":"E Dantsin","year":"1992","unstructured":"Dantsin, E.: Probabilistic logic programs and their semantics. In: Voronkov, A. (ed.) RCLP -1990. LNCS, vol. 592, pp. 152\u2013164. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55460-2_11"},{"key":"5_CR9","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. J. Artif. Intell. Res. 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-30215-5_3","volume-title":"Algorithmic Learning Theory","author":"L Raedt","year":"2004","unstructured":"Raedt, L., Kersting, K.: Probabilistic inductive logic programming. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 19\u201336. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30215-5_3"},{"issue":"1","key":"5_CR11","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10994-015-5494-z","volume":"100","author":"L Raedt De","year":"2015","unstructured":"De Raedt, L., Kimmig, A.: Probabilistic (logic) programming concepts. Mach. Learn. 100(1), 5\u201347 (2015)","journal-title":"Mach. Learn."},{"key":"5_CR12","first-page":"2462","volume-title":"IJCAI 2007","author":"L Raedt De","year":"2007","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic Prolog and its application in link discovery. In: Veloso, M.M. (ed.) IJCAI 2007, vol. 7, pp. 2462\u20132467. AAAI Press, Palo Alto (2007)"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10994-015-5510-3","volume":"100","author":"N Mauro Di","year":"2015","unstructured":"Di Mauro, N., Bellodi, E., Riguzzi, F.: Bandit-based Monte-Carlo structure learning of probabilistic logic programs. Mach. Learn. 100(1), 127\u2013156 (2015)","journal-title":"Mach. Learn."},{"issue":"3","key":"5_CR14","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1017\/S1471068414000076","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. Theor. Pract. Log. Prog. 15(3), 358\u2013401 (2015)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"4\u20135","key":"5_CR15","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1017\/S1471068412000245","volume":"12","author":"A Gorlin","year":"2012","unstructured":"Gorlin, A., Ramakrishnan, C.R., Smolka, S.A.: Model checking with probabilistic tabled logic programming. Theor. Pract. Log. Prog. 12(4\u20135), 681\u2013700 (2012)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"4\u20135","key":"5_CR16","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1017\/S1471068411000238","volume":"11","author":"B Gutmann","year":"2011","unstructured":"Gutmann, B., Thon, I., Kimmig, A., Bruynooghe, M., De Raedt, L.: The magic of logical inference in probabilistic programming. Theor. Pract. Log. Prog. 11(4\u20135), 663\u2013680 (2011)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"1","key":"5_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/make1010001","volume":"1","author":"A Holzinger","year":"2017","unstructured":"Holzinger, A.: Introduction to machine learning and knowledge extraction (MAKE). Mach. Learn. Knowl. Extr. 1(1), 1\u201320 (2017)","journal-title":"Mach. Learn. Knowl. Extr."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-662-43968-5_16","volume-title":"Interactive Knowledge Discovery and Data Mining in Biomedical Informatics","author":"A Holzinger","year":"2014","unstructured":"Holzinger, A., Schantl, J., Schroettner, M., Seifert, C., Verspoor, K.: Biomedical text mining: state-of-the-art, open problems and future challenges. In: Holzinger, A., Jurisica, I. (eds.) Interactive Knowledge Discovery and Data Mining in Biomedical Informatics. LNCS, vol. 8401, pp. 271\u2013300. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-43968-5_16"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-45685-6_16","volume-title":"Theorem Proving in Higher Order Logics","author":"J Hurd","year":"2002","unstructured":"Hurd, J.: A formal approach to probabilistic termination. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 230\u2013245. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45685-6_16"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1017\/S1471068412000154","volume":"12","author":"MA Islam","year":"2012","unstructured":"Islam, M.A., Ramakrishnan, C., Ramakrishnan, I.: Inference in probabilistic logic programs with continuous random variables. Theor. Pract. Log. Prog. 12, 505\u2013523 (2012)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-662-49498-1_15","volume-title":"Programming Languages and Systems","author":"BL Kaminski","year":"2016","unstructured":"Kaminski, B.L., Katoen, J.-P., Matheja, C., Olmedo, F.: Weakest precondition reasoning for expected run\u2013times of probabilistic programs. In: Thiemann, P. (ed.) ESOP 2016. LNCS, vol. 9632, pp. 364\u2013389. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49498-1_15"},{"issue":"5","key":"5_CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.2307\/2691167","volume":"70","author":"DM Kilgour","year":"1997","unstructured":"Kilgour, D.M., Brams, S.J.: The truel. Math. Mag. 70(5), 315\u2013326 (1997)","journal-title":"Math. Mag."},{"issue":"2\u20133","key":"5_CR23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1017\/S1471068410000566","volume":"11","author":"A Kimmig","year":"2011","unstructured":"Kimmig, A., Demoen, B., De Raedt, L., Costa, V.S., Rocha, R.: On the implementation of the probabilistic logic programming language ProbLog. Theor. Pract. Log. Prog. 11(2\u20133), 235\u2013262 (2011)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-13840-9_10","volume-title":"Inductive Logic Programming","author":"W Meert","year":"2010","unstructured":"Meert, W., Struyf, J., Blockeel, H.: CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods. In: Raedt, L. (ed.) ILP 2009. LNCS (LNAI), vol. 5989, pp. 96\u2013109. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13840-9_10"},{"issue":"B","key":"5_CR25","first-page":"141","volume":"4","author":"S Muggleton","year":"2000","unstructured":"Muggleton, S.: Learning stochastic logic programs. Electron. Trans. Artif. Intell. 4(B), 141\u2013153 (2000)","journal-title":"Electron. Trans. Artif. Intell."},{"key":"5_CR26","unstructured":"Nampally, A., Ramakrishnan, C.: Adaptive MCMC-based inference in probabilistic logic programs. arXiv preprint arXiv:1403.6036 (2014)"},{"issue":"2","key":"5_CR27","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0890-5401(92)90061-J","volume":"101","author":"RT Ng","year":"1992","unstructured":"Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Inf. Comput. 101(2), 150\u2013201 (1992)","journal-title":"Inf. Comput."},{"issue":"3","key":"5_CR28","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10994-016-5558-8","volume":"103","author":"D Nitti","year":"2016","unstructured":"Nitti, D., De Laet, T., De Raedt, L.: Probabilistic logic programming for hybrid relational domains. Mach. Learn. 103(3), 407\u2013449 (2016)","journal-title":"Mach. Learn."},{"key":"5_CR29","unstructured":"Perov, Y., Paige, B., Wood, F.: The Indian GPA problem (2017). http:\/\/www.robots.ox.ac.uk\/~fwood\/anglican\/examples\/viewer\/?worksheet=indian-gpa . Accessed 15 Apr 2017"},{"key":"5_CR30","volume-title":"Practical Probabilistic Programming","author":"A Pfeffer","year":"2016","unstructured":"Pfeffer, A.: Practical Probabilistic Programming. Manning Publications, Cherry Hill (2016)"},{"key":"5_CR31","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/S0004-3702(97)00027-1","volume":"94","author":"D Poole","year":"1997","unstructured":"Poole, D.: The independent choice logic for modelling multiple agents under uncertainty. Artif. Intell. 94, 7\u201356 (1997)","journal-title":"Artif. Intell."},{"issue":"1\u20133","key":"5_CR32","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0743-1066(99)00071-0","volume":"44","author":"D Poole","year":"2000","unstructured":"Poole, D.: Abducing through negation as failure: stable models within the independent choice logic. J. Logic Program. 44(1\u20133), 5\u201335 (2000)","journal-title":"J. Logic Program."},{"issue":"1","key":"5_CR33","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.: Probabilistic horn abduction and Bayesian networks. Artif. Intell. 64(1), 81\u2013129 (1993)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"5_CR34","doi-asserted-by":"crossref","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":"2\u20133","key":"5_CR35","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10994-007-5032-8","volume":"70","author":"F Riguzzi","year":"2008","unstructured":"Riguzzi, F.: ALLPAD: approximate learning of logic programs with annotated disjunctions. Mach. Learn. 70(2\u20133), 207\u2013223 (2008)","journal-title":"Mach. Learn."},{"issue":"4","key":"5_CR36","doi-asserted-by":"crossref","first-page":"521","DOI":"10.3233\/FI-2013-847","volume":"124","author":"F Riguzzi","year":"2013","unstructured":"Riguzzi, F.: MCINTYRE: a Monte Carlo system for probabilistic logic programming. Fund. Inform. 124(4), 521\u2013541 (2013)","journal-title":"Fund. Inform."},{"issue":"3","key":"5_CR37","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1093\/comjnl\/bxt096","volume":"57","author":"F Riguzzi","year":"2014","unstructured":"Riguzzi, F.: Speeding up inference for probabilistic logic programs. Comput. J. 57(3), 347\u2013363 (2014)","journal-title":"Comput. J."},{"key":"5_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijar.2016.05.005","volume":"77","author":"F Riguzzi","year":"2016","unstructured":"Riguzzi, F.: The distribution semantics for normal programs with function symbols. Int. J. Approx. Reason. 77, 1\u201319 (2016)","journal-title":"Int. J. Approx. Reason."},{"issue":"10","key":"5_CR39","doi-asserted-by":"crossref","first-page":"1381","DOI":"10.1002\/spe.2386","volume":"46","author":"F Riguzzi","year":"2016","unstructured":"Riguzzi, F., Bellodi, E., Lamma, E., Zese, R., Cota, G.: Probabilistic logic programming on the web. Softw. Pract. Exper. 46(10), 1381\u20131396 (2016)","journal-title":"Softw. Pract. Exper."},{"key":"5_CR40","first-page":"1602","volume-title":"ECAI 2016","author":"F Riguzzi","year":"2016","unstructured":"Riguzzi, F., Bellodi, E., Zese, R., Cota, G., Lamma, E.: Scaling structure learning of probabilistic logic programs by mapreduce. In: Fox, M., Kaminka, G. (eds.) ECAI 2016, vol. 285, pp. 1602\u20131603. IOS Press, Prague (2016)"},{"key":"5_CR41","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ijar.2016.10.002","volume":"80","author":"F Riguzzi","year":"2017","unstructured":"Riguzzi, F., Bellodi, E., Zese, R., Cota, G., Lamma, E.: A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics. Int. J. Approx. Reason. 80, 313\u2013333 (2017)","journal-title":"Int. J. Approx. Reason."},{"issue":"1","key":"5_CR42","first-page":"1","volume":"29","author":"F Riguzzi","year":"2016","unstructured":"Riguzzi, F., Cota, G.: Probabilistic logic programming tutorial. Assoc. Log. Program. Newslett. 29(1), 1\u20131 (2016)","journal-title":"Assoc. Log. Program. Newslett."},{"issue":"1","key":"5_CR43","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10994-011-5247-6","volume":"86","author":"F Riguzzi","year":"2012","unstructured":"Riguzzi, F., Di Mauro, N.: Applying the information bottleneck to statistical relational learning. Mach. Learn. 86(1), 89\u2013114 (2012)","journal-title":"Mach. Learn."},{"key":"5_CR44","unstructured":"Riguzzi, F., Lamma, E., Alberti, M., Bellodi, E., Zese, R., Cota, G.: Probabilistic logic programming for natural language processing. In: Chesani, F., Mello, P., Milano, M. (eds.) Workshop on Deep Understanding and Reasoning, URANIA 2016, CEUR Workshop Proceedings, vol. 1802, pp. 30\u201337 (2017)"},{"issue":"4\u20135","key":"5_CR45","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1017\/S147106841100010X","volume":"11","author":"F Riguzzi","year":"2011","unstructured":"Riguzzi, F., Swift, T.: The PITA system: tabling and answer subsumption for reasoning under uncertainty. Theor. Pract. Log. Prog. 11(4\u20135), 433\u2013449 (2011)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Riguzzi, F., Swift, T.: Welldefinedness and efficient inference for probabilistic logic programming under the distribution semantics. Theor. Pract. Log. Prog. 13(Special Issue 02\u201325th Annual GULP Conference), 279\u2013302 (2013)","DOI":"10.1017\/S1471068411000664"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-58694-6_25","volume-title":"Knowledge Engineering and Knowledge Management","author":"F Riguzzi","year":"2017","unstructured":"Riguzzi, F., Zese, R., Cota, G.: Probabilistic inductive logic programming on the web. In: Ciancarini, P., Poggi, F., Horridge, M., Zhao, J., Groza, T., Suarez-Figueroa, M.C., d\u2019Aquin, M., Presutti, V. (eds.) EKAW 2016. LNCS (LNAI), vol. 10180, pp. 172\u2013175. Springer, Cham (2017). doi: 10.1007\/978-3-319-58694-6_25"},{"key":"5_CR48","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1017\/S1471068413000562","volume":"14","author":"T Sato","year":"2014","unstructured":"Sato, T., Meyer, P.: Infinite probability computation by cyclic explanation graphs. Theor. Pract. Log. Prog. 14, 909\u2013937 (2014)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR49","first-page":"715","volume-title":"ICLP 1995","author":"T Sato","year":"1995","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Sterling, L. (ed.) ICLP 1995, pp. 715\u2013729. MIT Press, Cambridg (1995)"},{"key":"5_CR50","unstructured":"Sato, T., Kameya, Y.: PRISM: a language for symbolic-statistical modeling. In: IJCAI 1997, vol. 97, pp. 1330\u20131339 (1997)"},{"issue":"02","key":"5_CR51","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1017\/S1471068413000677","volume":"15","author":"T Sato","year":"2015","unstructured":"Sato, T., Kubota, K.: Viterbi training in prism. Theor. Pract. Log. Prog. 15(02), 147\u2013168 (2015)","journal-title":"Theor. Pract. Log. Prog."},{"key":"5_CR52","unstructured":"Sato, T., Meyer, P.: Tabling for infinite probability computation. In: Dovier, A., Costa, V.S. (eds.) ICLP TC 2012. LIPIcs, vol. 17, pp. 348\u2013358 (2012)"},{"issue":"3","key":"5_CR53","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"5_CR54","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. J. ACM 38(3), 620\u2013650 (1991)","journal-title":"J. ACM"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Verbaeten, S.: Logic programs with annotated disjunctions. Technical report CW386, KU Leuven (2003)","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"5_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-27775-0_30","volume-title":"Logic Programming","author":"J Vennekens","year":"2004","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431\u2013445. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-27775-0_30"},{"key":"5_CR57","first-page":"36","volume":"12","author":"J Neumann Von","year":"1951","unstructured":"Von Neumann, J.: Various techniques used in connection with random digits. Nat. Bureau Stand. Appl. Math. Ser. 12, 36\u201338 (1951)","journal-title":"Nat. Bureau Stand. Appl. Math. Ser."},{"issue":"1\u20132","key":"5_CR58","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theor. Pract. Log. Prog. 12(1\u20132), 67\u201396 (2012)","journal-title":"Theor. Pract. Log. Prog."}],"container-title":["Lecture Notes in Computer Science","Towards Integrative Machine Learning and Knowledge Extraction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69775-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T18:03:49Z","timestamp":1603217029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69775-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319697741","9783319697758"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69775-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}