{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:27:31Z","timestamp":1742974051401,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031660207"},{"type":"electronic","value":"9783031660214"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T00:00:00Z","timestamp":1722643200000},"content-version":"vor","delay-in-days":215,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, we present a logic <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textbf{FPL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>FPL<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> (Frequentist Probability Logic) to reason about probabilities with a relative frequency interpretation. We show that it is possible to interpret the language of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textbf{FPL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>FPL<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> with the standard semantics for propositional logic. <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textbf{FPL}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>FPL<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> can give a peculiar frequentist interpretation of a probability operator. We then give a proof system for the language, prove that the traditional theorems of probability hold, and prove soundness and completeness.<\/jats:p>","DOI":"10.1007\/978-3-031-66021-4_4","type":"book-chapter","created":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T13:46:05Z","timestamp":1722606365000},"page":"54-71","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Frequentist Probability Logic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7250-5011","authenticated-orcid":false,"given":"Alessandro","family":"Aldini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8828-8920","authenticated-orcid":false,"given":"Pierluigi","family":"Graziani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3875-0512","authenticated-orcid":false,"given":"Mirko","family":"Tagliaferri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,3]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1108\/ICS-05-2016-0037","volume":"25","author":"A Aldini","year":"2017","unstructured":"Aldini, A., Seigneur, J.M., Ballester Lafuente, C., Titi, X., Guislain, J.: Design and validation of a trust-based opportunity-enabled risk management system. Inf. Comput. Secur. 25, 2\u201325 (2017)","journal-title":"Inf. Comput. Secur."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Aldini, A., Curzi, G., Graziani, P., Tagliaferri, M.: Trust evidence logic. In: Vejnarov\u00e1, J., Wilson, N. (eds.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th European Conference (ECSQARU 2021). LNAI, vol. 12897, pp. 575\u2013589. Springer (2021)","DOI":"10.1007\/978-3-030-86772-0_41"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aldini, A., Tagliaferri, M.: Logics to reason formally about trust computation and manipulation. In: Saracino, A., Mori, P. (eds.) Emerging Technologies for Authorization and Authentication. LNCS, vol. 11967, pp. 1\u201315. Springer (2020)","DOI":"10.1007\/978-3-030-39749-4_1"},{"key":"4_CR4","unstructured":"Antonelli, M., Lago, U.D., Pistone, P.: On counting propositional logic and wagner\u2019s hierarchy. In: Coen, C.S., Salvo, I. (eds.) Proceedings of the 22nd Italian Conference on Theoretical Computer Science. CEUR Workshop Proceedings, vol.\u00a03072. Technical University of Aachen (2021)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Casadei, R., Aldini, A., Viroli, M.: Combining trust and aggregate computing. In: Cerone, A., Roveri, M. (eds.) Software Engineering and Formal Methods, SEFM 2017. LNCS, vol. 10729, p. 507\u2013522. Springer (2018)","DOI":"10.1007\/978-3-319-74781-1_34"},{"key":"4_CR6","unstructured":"Demey, L., Kooi, B., Sack, J.: Logic and probability. In: Zalta, E.N., Nodelman, U. (eds.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Fall 2023 edn. (2023)"},{"issue":"1\u20132","key":"4_CR7","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","volume":"87","author":"R Fagin","year":"1990","unstructured":"Fagin, R., Halpern, J.Y., Megiddo, N.: A logic for reasoning about probabilities. Inf. Comput. 87(1\u20132), 78\u2013128 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF00379767","volume":"44","author":"M Fattorosi-Barnaba","year":"1985","unstructured":"Fattorosi-Barnaba, M., Caro, F.D.: Graded modalities. I. Stud. Logica. 44(2), 197\u2013221 (1985)","journal-title":"Stud. Logica."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Fazlyab, M., Morari, M., Pappas, G.J.: Probabilistic verification and reachability analysis of neural networks via semidefinite programming. In: 2019 IEEE 58th Conference on Decision and Control (CDC), pp. 2726\u20132731 (2019)","DOI":"10.1109\/CDC40024.2019.9029310"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"H\u00e9rault, T., Lassaigne, R., Magniette, F., Peyronnet, S.: Approximate probabilistic model checking. In: Steffen, B., Levi, G. (eds.) Verification, Model Checking, and Abstract Interpretation, pp. 73\u201384. Springer (2004)","DOI":"10.1007\/978-3-540-24622-0_8"},{"key":"4_CR11","unstructured":"H\u00e1jek, A.: Interpretations of probability. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Fall 2019 edn. (2019)"},{"key":"4_CR12","unstructured":"Legay, A., Delahaye, B., Bensalem, S.: Statistical model checking: an overview. In: Barringer, H., Falcone, Y., Finkbeiner, B., Havelund, K., Lee, I., Pace, G., Ro\u015fu, G., Sokolsky, O., Tillmann, N. (eds.) Runtime Verification, pp. 122\u2013135. Springer (2010)"},{"key":"4_CR13","unstructured":"O\u2019Donoghue, B., Osband, I., Ionescu, C.: Making Sense of Reinforcement Learning and Probabilistic Inference (2020)"},{"key":"4_CR14","unstructured":"Pilipovsky, J., Sivaramakrishnan, V., Oishi, M., Tsiotras, P.: Probabilistic verification of ReLU neural networks via characteristic functions. In: Matni, N., Morari, M., Pappas, G.J. (eds.) Proceedings of The 5th Annual Learning for Dynamics and Control Conference, vol.\u00a0211, pp. 966\u2013979. PMLR (2023)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Tagliaferri, M., Aldini, A.: From knowledge to trust: A logical framework for pre-trust computations. In: Gal-Oz, N., Lewis, P. (eds.) Trust Management XII. IFIP AICT, vol.\u00a0528, pp. 107\u2013123. Springer (2018)","DOI":"10.1007\/978-3-319-95276-5_8"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Tagliaferri, M., Aldini, A.: A trust logic for the varieties of trust. In: Camara, J., Steffen, M. (eds.) Software Engineering and Formal Methods. LNCS, vol. 12226, pp. 119\u2013136. Springer (2020)","DOI":"10.1007\/978-3-030-57506-9_10"},{"issue":"6","key":"4_CR17","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1093\/logcom\/exac016","volume":"32","author":"M Tagliaferri","year":"2022","unstructured":"Tagliaferri, M., Aldini, A.: From belief to trust: a quantitative framework based on modal logic. J. Log. Comput. 32(6), 1017\u20131047 (2022)","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods. SEFM 2023 Collocated Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66021-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T13:48:12Z","timestamp":1722606492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66021-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031660207","9783031660214"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66021-4_4","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":"3 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","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":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","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":"41","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":"19","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":"46% - 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":"4,5","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)"}}]}}