{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:44:53Z","timestamp":1725857093155},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405650"},{"type":"electronic","value":"9783319405667"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-40566-7_11","type":"book-chapter","created":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T05:46:36Z","timestamp":1465451196000},"page":"152-165","source":"Crossref","is-referenced-by-count":0,"title":["kProbLog: An Algebraic Prolog for Kernel Programming"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Orsini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Frasconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,10]]},"reference":[{"unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: Problog: A probabilistic prolog and its application in link discovery. In: IJCAI (2007)","key":"11_CR1"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/978-3-642-24206-9_11","volume-title":"Datalog Reloaded","author":"J Eisner","year":"2011","unstructured":"Eisner, J., Filardo, N.W.: Dyna: extending datalog for modern AI. In: de Moor, O., Gottlob, G., Furche, T., Sellers, A. (eds.) Datalog 2010. LNCS, vol. 6702, pp. 181\u2013220. Springer, Heidelberg (2011)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-22944-2_2","volume-title":"Algebra and Coalgebra in Computer Science","author":"J Esparza","year":"2011","unstructured":"Esparza, J., Luttenberger, M.: Solving fixed-point equations by derivation tree analysis. In: Corradini, A., Klin, B., C\u00eerstea, C. (eds.) CALCO 2011. LNCS, vol. 6859, pp. 19\u201335. Springer, Heidelberg (2011)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-540-73208-2_17","volume-title":"Developments in Language Theory","author":"J Esparza","year":"2007","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: An extension of newton\u2019s method to $$\\omega $$ -continuous semirings. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 157\u2013168. Springer, Heidelberg (2007)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Implementation and Application of Automata","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Luttenberger, M., Schlund, M.: FPsolve: a generic solver for fixpoint equations over semirings. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 1\u201315. Springer, Heidelberg (2014)"},{"doi-asserted-by":"crossref","unstructured":"Frasconi, P., Costa, F., De Raedt, L., De Grave, K.: kLog: A language for logical and relational learning with kernels. In: Artificial Intelligence (2014)","key":"11_CR6","DOI":"10.1016\/j.artint.2014.08.003"},{"doi-asserted-by":"crossref","unstructured":"Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Proceedings of the 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of database systems. ACM (2007)","key":"11_CR7","DOI":"10.1145\/1265530.1265535"},{"doi-asserted-by":"crossref","unstructured":"Kim, M., Candan, K.S.: Approximate tensor decomposition within a tensor-relational algebraic framework. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management. ACM (2011)","key":"11_CR8","DOI":"10.1145\/2063576.2063827"},{"doi-asserted-by":"crossref","unstructured":"Kimmig, A., Van den Broeck, G., De Raedt, L.: An algebraic prolog for reasoning about possible worlds. In: 25th AAAI Conference on Artificial Intelligence (2011)","key":"11_CR9","DOI":"10.1609\/aaai.v25i1.7852"},{"unstructured":"Landwehr, N., Passerini, A., De Raedt, L., Frasconi, P.: kFOIL: Learning simple relational kernels. In: AAAI (2006)","key":"11_CR10"},{"doi-asserted-by":"crossref","unstructured":"Lehmann, D.J.: Algebraic structures for transitive closure. In: Theoretical Computer Science (1977)","key":"11_CR11","DOI":"10.1016\/0304-3975(77)90056-1"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-33460-3_30","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Neumann","year":"2012","unstructured":"Neumann, M., Patricia, N., Garnett, R., Kersting, K.: Efficient graph kernels by randomization. In: Flach, P.A., Bie, T., Cristianini, N. (eds.) ECML PKDD 2012, Part I. LNCS, vol. 7523, pp. 378\u2013393. Springer, Heidelberg (2012)"},{"unstructured":"Orsini, F., Frasconi, P., De Raedt, L.: Graph invariant kernels. In: Proceedings of the 24th IJCAI (2015)","key":"11_CR13"},{"issue":"3","key":"11_CR14","first-page":"239","volume":"5","author":"J Ross Quinlan","year":"1990","unstructured":"Ross Quinlan, J.: Learning logical definitions from relations. Mach. Learn. 5(3), 239\u2013266 (1990)","journal-title":"Mach. Learn."},{"doi-asserted-by":"crossref","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Machine Learning (2006)","key":"11_CR15","DOI":"10.1007\/s10994-006-5833-1"},{"unstructured":"Sato, T., Kameya, Y.: PRISM: a language for symbolic-statistical modeling. In: IJCAI (1997)","key":"11_CR16"},{"key":"11_CR17","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Vlasselaer, J., Van den Broeck, G., Kimmig, A., Meert, W., De Raedt, L.: Anytime inference in probabilistic logic programs with tp-compilation. In: Proceedings of the 24th IJCAI (2015)","key":"11_CR18","DOI":"10.1016\/j.ijar.2016.06.009"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/11575467_8","volume-title":"Programming Languages and Systems","author":"J Whaley","year":"2005","unstructured":"Whaley, J., Avots, D., Carbin, M., Lam, M.S.: Using datalog with binary decision diagrams for program analysis. In: Yi, K. (ed.) APLAS 2005. LNCS, vol. 3780, pp. 97\u2013118. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40566-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T16:35:17Z","timestamp":1692376517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40566-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405650","9783319405667"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40566-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}