{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:09:57Z","timestamp":1778486997709,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819201839","type":"print"},{"value":"9789819201846","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0184-6_10","type":"book-chapter","created":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T07:33:38Z","timestamp":1778484818000},"page":"202-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Linear Logic Programming with\u00a0an\u00a0Application to\u00a0Bayesian Network Computations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0425-2825","authenticated-orcid":false,"given":"Matteo","family":"Acclavio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9723-7183","authenticated-orcid":false,"given":"Roberto","family":"Maieli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,12]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. J. Symb. Log. 59(2), 543\u2013574 (1994). https:\/\/doi.org\/10.2307\/2275407","journal-title":"J. Symb. Log."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4204\/eptcs.408.3","volume":"408","author":"M Acclavio","year":"2024","unstructured":"Acclavio, M., Maieli, R.: Logic programming with multiplicative structures. Electron. Proc. Theor. Comput. Sci. 408, 42\u201361 (2024). https:\/\/doi.org\/10.4204\/eptcs.408.3","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"key":"10_CR3","unstructured":"Acclavio, M., Maieli, R.: Probabilistic linear logic programming with an application to bayesian network computations (extended version) (2026). https:\/\/arxiv.org\/abs\/2601.13270"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-031-91118-7_2","volume-title":"Programming Languages and Systems","author":"M Acclavio","year":"2025","unstructured":"Acclavio, M., Manara, G., Montesi, F.: Formulas as processes, deadlock-freedom as choreographies. In: Vafeiadis, V. (ed.) Programming Languages and Systems, pp. 23\u201355. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91118-7_2"},{"issue":"3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"JM Andreoli","year":"1992","unstructured":"Andreoli, J.M.: Logic programming with focusing proofs in linear logic. J. Log. Comput. 2(3), 297\u2013347 (1992)","journal-title":"J. Log. Comput."},{"issue":"10","key":"10_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/97946.97953","volume":"25","author":"J Andreoli","year":"1990","unstructured":"Andreoli, J., Pareschi, R.: Lo and behold! concurrent structured processes. ACM SIGPLAN Not. 25(10), 44\u201356 (1990). https:\/\/doi.org\/10.1145\/97946.97953","journal-title":"ACM SIGPLAN Not."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0038690","volume-title":"Extensions of Logic Programming","author":"J-M Andreoli","year":"1991","unstructured":"Andreoli, J.-M., Pareschi, R.: Logic programming with sequent systems. In: Schroeder-Heister, P. (ed.) ELP 1989. LNCS, vol. 475, pp. 1\u201330. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0038690"},{"key":"10_CR8","volume-title":"Programming in Prolog","author":"WF Clocksin","year":"1981","unstructured":"Clocksin, W.F., Mellish, C.S.: Programming in Prolog, 1st edn. Springer, Heidelberg (1981)","edition":"1"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"De\u00a0Raedt, L., Kimmig, A.: Probabilistic (logic) programming concepts. Mach. Learn. 100, 5\u201347 (2015). https:\/\/doi.org\/10.1007\/s10994-015-5494-z","DOI":"10.1007\/s10994-015-5494-z"},{"key":"10_CR10","unstructured":"De\u00a0Raedt, L., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2462\u20132467 (2007)"},{"key":"10_CR11","unstructured":"De\u00a0Raedt, L., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog for knowledge representation and reasoning. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2462\u20132467 (2007)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Docef, A., Negulescu, R., Prunescu, M.: Using z3 to verify inferences in fragments of linear logic (2023). arXiv preprint arXiv:2309.13796","DOI":"10.4204\/EPTCS.389.2"},{"key":"10_CR13","unstructured":"Ehrhard, T., Faggian, C., Pagani, M.: Bayesian networks and proof-nets: a proof-theoretical account of bayesian inference (2024). arXiv preprint arxiv:2412.20540"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Eng, B., Seiller, T.: Multiplicative linear logic from a resolution-based tile system (2022). CoRR arxiv:2207.08465. https:\/\/doi.org\/10.48550\/arXiv.2207.08465","DOI":"10.48550\/arXiv.2207.08465"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Fierens, D., et al.: Inference and learning in probabilistic logic programs using weighted Boolean formulas. In: Theory and Practice of Logic Programming (2015)","DOI":"10.1017\/S1471068414000076"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50(1), 1\u2013101 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"JS Hodas","year":"1994","unstructured":"Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Inf. Comput. 110(2), 327\u2013365 (1994)","journal-title":"Inf. Comput."},{"key":"10_CR18","unstructured":"Horne, R.: The sub-additives: a proof theory for probabilistic choice extending linear logic. In: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), p. 23-1. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"10_CR19","unstructured":"Jensen, F.V.: An Introduction to Bayesian Networks. UCL Press (1996)"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Kersting, K., De\u00a0Raedt, L.: Bayesian logic programs. Technical report, arXiv (2000). https:\/\/doi.org\/10.48550\/arXiv.cs\/0111058","DOI":"10.48550\/arXiv.cs\/0111058"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Kobayashi, N.: Concurrent Linear Logic Programming. Ph.D. thesis, University of Tokyo (1996)","DOI":"10.1007\/BFb0026568"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Kobayashi, N., Yonezawa, A.: Asynchronous communication model based on linear logic. In: Halstead, R.H., Ito, T. (eds.) Parallel Symbolic Computing: Languages, Systems, and Applications, pp. 331\u2013336. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BF01211602","DOI":"10.1007\/BF01211602"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Lauritzen, S.L., Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their application to expert systems. J. R. Stat. Soc. Series B (1988)","DOI":"10.1111\/j.2517-6161.1988.tb01721.x"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Liang, C.C., Miller, D.: Focusing and polarization in linear, intuitionistic, and classical logics. Theor. Comput. Sci. 410(46), 4747\u20134768 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.07.041","DOI":"10.1016\/j.tcs.2009.07.041"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-75560-9_27","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R Maieli","year":"2007","unstructured":"Maieli, R.: Retractile proof nets of the purely multiplicative and additive fragment of linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 363\u2013377. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_27"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Maieli, R.: A proof of the focusing theorem via mall proof nets. In: Proceedings of WoLLIC 2022. Lecture Notes in Computer Science, vol. 13468. Springer, Heidelberh (2022). https:\/\/doi.org\/10.1007\/978-3-031-15298-6_1","DOI":"10.1007\/978-3-031-15298-6_1"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Maieli, R.: Bayesian proof nets: an encoding of bayesian networks in proof nets of linear logic. In: Lecture Notes in Networks and Systems, vol.\u00a01198, pp. 142\u2013152. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-76459-2_13","DOI":"10.1007\/978-3-031-76459-2_13"},{"issue":"6","key":"10_CR28","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1017\/S1471068421000533","volume":"22","author":"D Miller","year":"2022","unstructured":"Miller, D.: A survey of the proof-theoretic foundations of logic programming. Theory Pract. Logic Program. 22(6), 859\u2013904 (2022). https:\/\/doi.org\/10.1017\/S1471068421000533","journal-title":"Theory Pract. Logic Program."},{"issue":"1\u20132","key":"10_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Ann. Pure Appl. Logic 51(1\u20132), 125\u2013157 (1991). https:\/\/doi.org\/10.1016\/0168-0072(91)90068-W","journal-title":"Ann. Pure Appl. Logic"},{"key":"10_CR30","unstructured":"Pearl, J.: Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, Burlington (1988)"},{"key":"10_CR31","unstructured":"Pinl, A.: Probability Propagation Nets \u2013 Unveiling Structure and Propagations of Bayesian Networks by Means of Petri Nets. Phd thesis, Universit\u00e4t Koblenz-Landau, Campus Koblenz, Koblenz, Germany (2007)"},{"key":"10_CR32","unstructured":"Sato, T., Kameya, Y.: PRISM: A Logic-Based Probabilistic Modeling Language. Morgan Kaufmann, Burlington (1997)"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1613\/jair.912","volume":"15","author":"T Sato","year":"2001","unstructured":"Sato, T., Kameya, Y.: Parameter learning of logic programs for symbolic-statistical modeling. J. Artif. Intell. Res. 15, 391\u2013454 (2001)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"10_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1183278.1183284","volume":"7","author":"J Vennekens","year":"2006","unstructured":"Vennekens, J., Denecker, M., Bruynooghe, M.: Logic programs with annotated disjunctions. ACM Trans. Comput. Log. 7(4), 1\u201337 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR35","unstructured":"Zhang, N.L., Poole, D.L.: A simple approach to bayesian inference in belief networks. IEEE Trans. Syst. Man Cybern. (1994)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0184-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T07:33:51Z","timestamp":1778484831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0184-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819201839","9789819201846"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0184-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FLOPS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Functional and Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Akita","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"flops2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/functional-logic.org\/events\/flops\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}