{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:42:10Z","timestamp":1743154930986,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031271809"},{"type":"electronic","value":"9783031271816"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,11]],"date-time":"2023-03-11T00:00:00Z","timestamp":1678492800000},"content-version":"vor","delay-in-days":69,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>\u201cType 1\u201d statements were introduced by Halpern in 1990 with the goal to represent statistical information about a domain of interest. These are of the form \u201cx% of the elements share the same property\u201d. The recently proposed language PASTA (Probabilistic Answer set programming for STAtistical probabilities) extends Probabilistic Logic Programs under the Distribution Semantics and allows the definition of this type of statements. To perform exact inference, PASTA programs are converted into probabilistic answer set programs under the Credal Semantics. However, this algorithm is infeasible for scenarios when more than a few random variables are involved. Here, we propose several algorithms to perform both conditional and unconditional approximate inference in PASTA programs and test them on different benchmarks. The results show that approximate algorithms scale to hundreds of variables and thus can manage real world domains.<\/jats:p>","DOI":"10.1007\/978-3-031-27181-6_3","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:34:21Z","timestamp":1678422861000},"page":"33-46","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximate Inference in Probabilistic Answer Set Programming for Statistical Probabilities"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7133-2673","authenticated-orcid":false,"given":"Damiano","family":"Azzolini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3717-3779","authenticated-orcid":false,"given":"Elena","family":"Bellodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1654-9703","authenticated-orcid":false,"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ijar.2021.11.003","volume":"142","author":"D Azzolini","year":"2022","unstructured":"Azzolini, D., Bellodi, E., Ferilli, S., Riguzzi, F., Zese, R.: Abduction with probabilistic logic programming under the distribution semantics. Int. J. Approx. Reason. 142, 41\u201363 (2022). https:\/\/doi.org\/10.1016\/j.ijar.2021.11.003","journal-title":"Int. J. Approx. Reason."},{"key":"3_CR2","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: Abduction in (probabilistic) answer set programming. In: Calegari, R., Ciatto, G., Omicini, A. (eds.) Proceedings of the 36th Italian Conference on Computational Logic. CEUR Workshop Proceedings, vol. 3204, pp. 90\u2013103. Sun SITE Central Europe, Aachen, Germany (2022)"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: Statistical statements in probabilistic logic programming. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) Logic Programming and Nonmonotonic Reasoning (LPNMR 2022), LNCS, vol. 13416, pp. 43\u201355. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_4","DOI":"10.1007\/978-3-031-15707-3_4"},{"key":"3_CR4","series-title":"CEUR-WS","first-page":"1","volume-title":"Workshop on Probabilistic Logic Programming (PLP 2020)","author":"D Azzolini","year":"2020","unstructured":"Azzolini, D., Riguzzi, F., Lamma, E.: An analysis of Gibbs sampling for probabilistic logic programs. In: Dodaro, C., et al. (eds.) Workshop on Probabilistic Logic Programming (PLP 2020). CEUR-WS, vol. 2678, pp. 1\u201313. Sun SITE Central Europe, Aachen, Germany (2020)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-35166-3_2","volume-title":"AI*IA 2019 \u2013 Advances in Artificial Intelligence","author":"Damiano Azzolini","year":"2019","unstructured":"Azzolini, Damiano, Riguzzi, Fabrizio, Masotti, Franco, Lamma, Evelina: A comparison of MCMC sampling for\u00a0probabilistic logic programming. In: Alviano, Mario, Greco, Gianluigi, Scarcello, Francesco (eds.) AI*IA 2019. LNCS (LNAI), vol. 11946, pp. 18\u201329. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35166-3_2"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S1471068408003645","volume":"9","author":"C Baral","year":"2009","unstructured":"Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theor. Pract. Log. Prog. 9(1), 57\u2013144 (2009). https:\/\/doi.org\/10.1017\/S1471068408003645","journal-title":"Theor. Pract. Log. Prog."},{"issue":"12","key":"3_CR7","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":"3_CR8","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":"3_CR9","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":"3_CR10","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\/IJCAI (2007)"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.artint.2010.04.002","volume":"175","author":"W Faber","year":"2011","unstructured":"Faber, W., Pfeifer, G., Leone, N.: Semantics and complexity of recursive aggregates in answer set programming. Artif. Intell. 175(1), 278\u2013298 (2011). https:\/\/doi.org\/10.1016\/j.artint.2010.04.002","journal-title":"Artif. Intell."},{"issue":"1","key":"3_CR12","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":"3_CR13","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using NetworkX. In: Varoquaux, G., Vaught, T., Millman, J. (eds.) Proceedings of the 7th Python in Science Conference, pp. 11\u201315. Pasadena, CA, USA (2008)","DOI":"10.25080\/TCWV9851"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0004-3702(90)90019-V","volume":"46","author":"JY Halpern","year":"1990","unstructured":"Halpern, J.Y.: An analysis of first-order logics of probability. Artif. Intell. 46(3), 311\u2013350 (1990)","journal-title":"Artif. Intell."},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Jaeger, M.: Probabilistic reasoning in terminological logics. In: Doyle, J., Sandewall, E., Torasso, P. (eds.) 4th International Conference on Principles of Knowledge Representation and Reasoning, pp. 305\u2013316. Morgan Kaufmann (1994). https:\/\/doi.org\/10.1016\/B978-1-4832-1452-8.50124-X","DOI":"10.1016\/B978-1-4832-1452-8.50124-X"},{"key":"3_CR16","unstructured":"Kern-Isberner, G., Thimm, M.: Novel semantical approaches to relational probabilistic conditionals. In: Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, pp. 382\u2013392. AAAI Press (2010)"},{"key":"3_CR17","unstructured":"Lee, J., Wang, Y.: A probabilistic extension of the stable model semantics. In: AAAI Spring Symposia (2015)"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Lloyd, J.W.: Foundations of logic programming, 2nd edn. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-642-83189-8","DOI":"10.1007\/978-3-642-83189-8"},{"key":"3_CR19","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":"Matthias Nickles","year":"2016","unstructured":"Nickles, Matthias: A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics. In: Michael, Loizos, Kakas, Antonis (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 369\u2013384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_24"},{"key":"3_CR20","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)"},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Sterling, L. (ed.) ICLP 1995, pp. 715\u2013729. MIT Press (1995). https:\/\/doi.org\/10.7551\/mitpress\/4298.003.0069","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"3_CR22","unstructured":"Totis, P., Kimmig, A., De Raedt, L.: SMProbLog: stable model semantics in ProbLog and its applications in argumentation. arXiv preprint arXiv:2110.01990 (2021)"},{"key":"3_CR23","unstructured":"Tuckey, D., Russo, A., Broda, K.: PASOCS: a parallel approximate solver for probabilistic logic programs under the credal semantics. arXiv preprint arXiv:2105.10908 (2021)"},{"key":"3_CR24","unstructured":"Wilhelm, M., Kern-Isberner, G., Finthammer, M., Beierle, C.: Integrating typed model counting into first-order maximum entropy computations and the connection to Markov logic networks. In: Bart\u00e1k, R., Brawner, K.W. (eds.) Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, pp. 494\u2013499. AAAI Press (2019)"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T03:08:50Z","timestamp":1729048130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.it\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","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":"33","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":"61% - 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":"3","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This proceeding includes one invited paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}