{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T13:14:18Z","timestamp":1781615658312,"version":"3.54.5"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031157066","type":"print"},{"value":"9783031157073","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Probabilistic Logic Programs under the distribution semantics (PLPDS) do not allow statistical probabilistic statements of the form \u201c90% of birds fly\u201d, which were defined \u201cType 1\u201d statements by Halpern. In this paper, we add this kind of statements to PLPDS and introduce the PASTA (\u201cProbabilistic Answer set programming for STAtistical probabilities\u201d) language. We translate programs in our new formalism into probabilistic answer set programs under the credal semantics. This approach differs from previous proposals, such as the one based on \u201cprobabilistic conditionals\u201d as, instead of choosing a single model by making the maximum entropy assumption, we take into consideration all models and we assign probability intervals to queries. In this way we refrain from making assumptions and we obtain a more neutral framework. We also propose an inference algorithm and compare it with an existing solver for probabilistic answer set programs on a number of programs of increasing size, showing that our solution is faster and can deal with larger instances.<\/jats:p>","DOI":"10.1007\/978-3-031-15707-3_4","type":"book-chapter","created":{"date-parts":[[2022,8,26]],"date-time":"2022-08-26T11:02:47Z","timestamp":1661511767000},"page":"43-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Statistical Statements in\u00a0Probabilistic Logic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7133-2673","authenticated-orcid":false,"given":"Damiano","family":"Azzolini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3717-3779","authenticated-orcid":false,"given":"Elena","family":"Bellodi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1654-9703","authenticated-orcid":false,"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"issue":"2","key":"4_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)","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aziz, R.A., Chu, G., Muise, C.J., Stuckey, P.J.: Stable model counting and its application in probabilistic logic programming. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 3468\u20133474. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9691"},{"key":"4_CR3","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)","journal-title":"Int. J. Approx. Reason."},{"issue":"1","key":"4_CR4","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)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"12","key":"4_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)","journal-title":"Commun. ACM"},{"key":"4_CR6","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)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR7","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)","journal-title":"Int. J. Approx. Reason."},{"key":"4_CR8","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)"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Eiter, T., Hecher, M., Kiesel, R.: Treewidth-aware cycle breaking for algebraic answer set counting. In: Bienvenu, M., Lakemeyer, G., Erdem, E. (eds.) Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, pp. 269\u2013279 (2021)","DOI":"10.24963\/kr.2021\/26"},{"key":"4_CR10","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":"4_CR11","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)","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR12","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"},{"issue":"3","key":"4_CR13","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":"4_CR14","doi-asserted-by":"crossref","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)","DOI":"10.1016\/B978-1-4832-1452-8.50124-X"},{"key":"4_CR15","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":"4_CR16","unstructured":"Lee, J., Wang, Y.: A probabilistic extension of the stable model semantics. In: AAAI Spring Symposia (2015)"},{"key":"4_CR17","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"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Paris, J.B.: The Uncertain Reasoner\u2019s Companion: A Mathematical Perspective. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511526596"},{"key":"4_CR19","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 (2018)"},{"key":"4_CR20","doi-asserted-by":"crossref","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)","DOI":"10.7551\/mitpress\/4298.003.0069"},{"issue":"5","key":"4_CR21","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1093\/jigpal\/jzs010","volume":"20","author":"M Thimm","year":"2012","unstructured":"Thimm, M., Kern-Isberner, G.: On probabilistic inference in relational conditional logics. Logic J. IGPL 20(5), 872\u2013908 (2012)","journal-title":"Logic J. IGPL"},{"key":"4_CR22","unstructured":"Totis, P., Kimmig, A., Raedt, L.D.: SMProbLog: stable model semantics in ProbLog and its applications in argumentation. ArXiv arXiv:2110.01990 (2021)"},{"key":"4_CR23","unstructured":"Tuckey, D., Russo, A., Broda, K.: PASOCS: a parallel approximate solver for probabilistic logic programs under the credal semantics. ArXiv arXiv:2105.10908 (2021)"},{"issue":"3","key":"4_CR24","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":"4_CR25","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)"}],"updated-by":[{"DOI":"10.1007\/978-3-031-15707-3_40","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000}}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15707-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T17:05:54Z","timestamp":1727888754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15707-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031157066","9783031157073"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15707-3_4","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-031-15707-3_40","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"29 August 2022","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Chapters [\u201cStatistical Statements in Probabilistic Logic Programming\u201c and \u201cEfficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination\u201d] were previously published non-open access. They have now been changed to open access under a CC BY 4.0 license and the copyright holder updated to \u2018The Author(s)\u2019. The book has also been updated with these changes.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LPNMR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic Programming and Nonmonotonic Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Genoa","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":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lpnmr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lpnmr2022.dibris.unige.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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","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":"34","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":"5","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":"60% - 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)"}}]}}