{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:05:51Z","timestamp":1760598351436,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556296"},{"type":"electronic","value":"9783031556302"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55630-2_1","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning the\u00a0Parameters of\u00a0Probabilistic Answer Set Programs"],"prefix":"10.1007","author":[{"given":"Damiano","family":"Azzolini","sequence":"first","affiliation":[]},{"given":"Elena","family":"Bellodi","sequence":"additional","affiliation":[]},{"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s13218-018-0545-9","volume":"32","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Faber, W.: Aggregates in answer set programming. KI-K\u00fcnstliche Intelligenz 32(2), 119\u2013124 (2018). https:\/\/doi.org\/10.1007\/s13218-018-0545-9","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: Statistical statements in probabilistic logic programming. In: Inclezan, G.G.D., Maratea, M. (eds.) 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022) (2022)","DOI":"10.1007\/978-3-031-15707-3_4"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S1471068421000260","volume":"21","author":"D Azzolini","year":"2021","unstructured":"Azzolini, D., Riguzzi, F.: Optimizing probabilities in probabilistic logic programs. Theory Pract. Logic Program. 21(5), 543\u2013556 (2021). https:\/\/doi.org\/10.1017\/S1471068421000260","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"1_CR4","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.3233\/IDA-130582","journal-title":"Intell. Data Anal."},{"issue":"12","key":"1_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"key":"1_CR6","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":"1_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1613\/jair.5482","volume":"60","author":"FG Cozman","year":"2017","unstructured":"Cozman, F.G., Mau\u00e1, D.D.: On the semantics and complexity of probabilistic logic programs. J. Artif. Intell. Res. 60, 221\u2013262 (2017). https:\/\/doi.org\/10.1613\/jair.5482","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ijar.2020.07.004","volume":"125","author":"FG Cozman","year":"2020","unstructured":"Cozman, F.G., Mau\u00e1, D.D.: The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. Int. J. Approx. Reason. 125, 218\u2013239 (2020). https:\/\/doi.org\/10.1016\/j.ijar.2020.07.004","journal-title":"Int. J. Approx. Reason."},{"key":"1_CR9","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1613\/jair.989","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-78652-8_1","volume-title":"Probabilistic Inductive Logic Programming","author":"L De Raedt","year":"2008","unstructured":"De Raedt, L., Kersting, K.: Probabilistic inductive logic programming. In: De Raedt, L., Frasconi, P., Kersting, K., Muggleton, S. (eds.) Probabilistic Inductive Logic Programming. LNCS (LNAI), vol. 4911, pp. 1\u201327. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78652-8_1"},{"key":"1_CR11","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: Problog: a probabilistic prolog and its application in link discovery. In: Veloso, M.M. (ed.) IJCAI, pp. 2462\u20132467 (2007)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200\u2013212. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30227-8_19"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot asp solving with clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2019). https:\/\/doi.org\/10.1017\/S1471068418000054","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01929-6_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected Boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 71\u201386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_7"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-87479-9_49","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B Gutmann","year":"2008","unstructured":"Gutmann, B., Kimmig, A., Kersting, K., De Raedt, L.: Parameter learning in probabilistic databases: a least squares approach. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008. LNCS (LNAI), vol. 5211, pp. 473\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87479-9_49"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-642-23780-5_47","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B Gutmann","year":"2011","unstructured":"Gutmann, B., Thon, I., De Raedt, L.: Learning the parameters of probabilistic logic programs from interpretations. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6911, pp. 581\u2013596. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23780-5_47"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Islam, M.A., Ramakrishnan, C., Ramakrishnan, I.: Parameter learning in PRISM programs with continuous random variables. arXiv:1203.4287 (2012). https:\/\/doi.org\/10.48550\/ARXIV.1203.4287","DOI":"10.48550\/ARXIV.1203.4287"},{"key":"1_CR18","unstructured":"Lee, J., Wang, Y.: Weight learning in a probabilistic extension of answer set programs. In: Thielscher, M., Toni, F., Wolter, F. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 22\u201331. AAAI Press (2018)"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-642-96826-6","edition":"2"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ijar.2019.12.003","volume":"118","author":"DD Mau\u00e1","year":"2020","unstructured":"Mau\u00e1, D.D., Cozman, F.G.: Complexity results for probabilistic answer set programming. Int. J. Approx. Reason. 118, 133\u2013154 (2020). https:\/\/doi.org\/10.1016\/j.ijar.2019.12.003","journal-title":"Int. J. Approx. Reason."},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-48758-8_24","volume-title":"Logics in Artificial Intelligence","author":"M Nickles","year":"2016","unstructured":"Nickles, M.: A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 369\u2013384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_24"},{"issue":"2","key":"1_CR22","first-page":"1","volume":"10","author":"LD Raedt","year":"2016","unstructured":"Raedt, L.D., Kersting, K., Natarajan, S., Poole, D.: Statistical relational artificial intelligence: logic, probability, and computation. Synth. Lect. Artif. Intell. Mach. Learn. 10(2), 1\u2013189 (2016)","journal-title":"Synth. Lect. Artif. Intell. Mach. Learn."},{"key":"1_CR23","volume-title":"Foundations of Probabilistic Logic Programming: Languages, semantics, inference and learning","author":"F Riguzzi","year":"2018","unstructured":"Riguzzi, F.: Foundations of Probabilistic Logic Programming: Languages, semantics, inference and learning. River Publishers, Gistrup, Denmark (2018)"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s10994-011-5247-6","journal-title":"Mach. Learn."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"715","DOI":"10.7551\/mitpress\/4298.003.0069","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, Cambridge (1995). https:\/\/doi.org\/10.7551\/mitpress\/4298.003.0069"},{"key":"1_CR26","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."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Totis, P., Kimmig, A., Raedt, L.D.: Smproblog: stable model semantics in problog and its applications in argumentation. arXiv:2110.01990 (2021). https:\/\/doi.org\/10.48550\/ARXIV.2110.01990","DOI":"10.48550\/ARXIV.2110.01990"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Tuckey, D., Russo, A., Broda, K.: Pasocs: a parallel approximate solver for probabilistic logic programs under the credal semantics. arXiv:2105.10908 (2021). https:\/\/doi.org\/10.48550\/ARXIV.2105.10908","DOI":"10.48550\/ARXIV.2105.10908"},{"issue":"3","key":"1_CR29","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","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":"1_CR30","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). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_30"},{"key":"1_CR31","doi-asserted-by":"publisher","unstructured":"Yang, Z., Ishay, A., Lee, J.: NeurASP: embracing neural networks into answer set programming. In: Bessiere, C. (ed.) Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 1755\u20131762. ijcai.org (2020). https:\/\/doi.org\/10.24963\/ijcai.2020\/243","DOI":"10.24963\/ijcai.2020\/243"}],"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-031-55630-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:36Z","timestamp":1710831096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","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":"Windsor Great Park","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijclr22.doc.ic.ac.uk\/ilp2022.html\/index.html","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":"26","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":"11","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":"0","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":"42% - 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)"}}]}}