{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:46:19Z","timestamp":1765889179549,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436185"},{"type":"electronic","value":"9783031436192"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_45","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"665-680","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Logics with\u00a0Probabilistic Team Semantics and\u00a0the\u00a0Boolean Negation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9637-6664","authenticated-orcid":false,"given":"Miika","family":"Hannula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2701-9620","authenticated-orcid":false,"given":"Minna","family":"Hirvonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0115-5154","authenticated-orcid":false,"given":"Juha","family":"Kontinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5651-5391","authenticated-orcid":false,"given":"Yasir","family":"Mahmood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8061-5376","authenticated-orcid":false,"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1582-3718","authenticated-orcid":false,"given":"Jonni","family":"Virtema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Blum, L., Shub, M., Smale, S.: On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines. In: 29th Annual Symposium on Foundations of Computer Science, pp. 387\u2013397 (1988)","key":"45_CR1","DOI":"10.1109\/SFCS.1988.21955"},{"issue":"2","key":"45_CR2","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.jco.2005.11.001","volume":"22","author":"P B\u00fcrgisser","year":"2006","unstructured":"B\u00fcrgisser, P., Cucker, F.: Counting complexity classes for numeric computations II: algebraic and semialgebraic sets. J. Complex. 22(2), 147\u2013191 (2006)","journal-title":"J. Complex."},{"issue":"3\u20134","key":"45_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10472-017-9568-4","volume":"83","author":"A Durand","year":"2018","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Approximation and dependence via multiteam semantics. Ann. Math. Artif. Intell. 83(3\u20134), 297\u2013320 (2018)","journal-title":"Ann. Math. Artif. Intell."},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-319-90050-6_11","volume-title":"Foundations of Information and Knowledge Systems","author":"A Durand","year":"2018","unstructured":"Durand, A., Hannula, M., Kontinen, J., Meier, A., Virtema, J.: Probabilistic team semantics. In: Ferrarotti, F., Woltran, S. (eds.) FoIKS 2018. LNCS, vol. 10833, pp. 186\u2013206. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-90050-6_11"},{"doi-asserted-by":"crossref","unstructured":"Durand, A., Kontinen, J., de Rugy-Altherre, N., V\u00e4\u00e4n\u00e4nen, J.: Tractability frontier of data complexity in team semantics. ACM Trans. Comput. Log. 23(1), 3:1\u20133:21 (2022)","key":"45_CR5","DOI":"10.1145\/3471618"},{"unstructured":"Galliani, P.: Game values and equilibria for undetermined sentences of dependence logic. MSc Thesis. ILLC Publications, MoL-2008-08 (2008)","key":"45_CR6"},{"unstructured":"Galliani, P., Hella, L.: Inclusion logic and fixed point logic. In: CSL. LIPIcs, vol. 23, pp. 281\u2013295. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013)","key":"45_CR7"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1997.2675","volume":"140","author":"E Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E., Gurevich, Y.: Metafinite model theory. Inf. Comput. 140(1), 26\u201381 (1998)","journal-title":"Inf. Comput."},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"104759","DOI":"10.1016\/j.ic.2021.104759","volume":"287","author":"M Hannula","year":"2022","unstructured":"Hannula, M., Hella, L.: Complexity thresholds in inclusion logic. Inf. Comput. 287, 104759 (2022)","journal-title":"Inf. Comput."},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/978-3-030-19570-0_20","volume-title":"Logics in Artificial Intelligence","author":"M Hannula","year":"2019","unstructured":"Hannula, M., Hirvonen, \u00c5., Kontinen, J., Kulikov, V., Virtema, J.: Facets of distribution identities in probabilistic team semantics. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 304\u2013320. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_20"},{"issue":"10","key":"45_CR11","doi-asserted-by":"publisher","first-page":"103104","DOI":"10.1016\/j.apal.2022.103104","volume":"173","author":"M Hannula","year":"2022","unstructured":"Hannula, M., Hirvonen, M., Kontinen, J.: On elementary logics for quantitative dependencies. Ann. Pure Appl. Log. 173(10), 103104 (2022)","journal-title":"Ann. Pure Appl. Log."},{"doi-asserted-by":"crossref","unstructured":"Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., Virtema, J.: Logics with probabilistic team semantics and the Boolean negation. arXiv arXiv:2306.00420 (2023)","key":"45_CR12","DOI":"10.1007\/978-3-031-43619-2_45"},{"doi-asserted-by":"crossref","unstructured":"Hannula, M., Kontinen, J., den Bussche, J.V., Virtema, J.: Descriptive complexity of real computation and probabilistic independence logic. In: LICS, pp. 550\u2013563. ACM (2020)","key":"45_CR13","DOI":"10.1145\/3373718.3394773"},{"doi-asserted-by":"crossref","unstructured":"Hannula, M., Kontinen, J., L\u00fcck, M., Virtema, J.: On quantified propositional logics and the exponential time hierarchy. In: GandALF. EPTCS, vol. 226, pp. 198\u2013212 (2016)","key":"45_CR14","DOI":"10.4204\/EPTCS.226.14"},{"doi-asserted-by":"crossref","unstructured":"Hannula, M., Kontinen, J., Virtema, J., Vollmer, H.: Complexity of propositional logics in team semantic. ACM Trans. Comput. Log. 19(1), 2:1\u20132:14 (2018)","key":"45_CR15","DOI":"10.1145\/3157054"},{"issue":"10","key":"45_CR16","doi-asserted-by":"publisher","first-page":"103108","DOI":"10.1016\/j.apal.2022.103108","volume":"173","author":"M Hannula","year":"2022","unstructured":"Hannula, M., Virtema, J.: Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. Ann. Pure Appl. Log. 173(10), 103108 (2022)","journal-title":"Ann. Pure Appl. Log."},{"issue":"4","key":"45_CR17","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1093\/jigpal\/5.4.539","volume":"5","author":"W Hodges","year":"1997","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. Log. J. IGPL 5(4), 539\u2013563 (1997)","journal-title":"Log. J. IGPL"},{"issue":"5\u20136","key":"45_CR18","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s00153-017-0535-x","volume":"56","author":"T Hyttinen","year":"2017","unstructured":"Hyttinen, T., Paolini, G., V\u00e4\u00e4n\u00e4nen, J.: A logic for arguing about probabilities in measure teams. Arch. Math. Log. 56(5\u20136), 475\u2013489 (2017)","journal-title":"Arch. Math. Log."},{"issue":"2\u20134","key":"45_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.3233\/FI-2011-386","volume":"106","author":"J Kontinen","year":"2011","unstructured":"Kontinen, J., Nurmi, V.: Team logic and second-order logic. Fundam. Informaticae 106(2\u20134), 259\u2013272 (2011)","journal-title":"Fundam. Informaticae"},{"key":"45_CR20","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1017\/jsl.2022.80","volume":"88","author":"J Kontinen","year":"2022","unstructured":"Kontinen, J., Yang, F.: Complete logics for elementary team properties. J. Symbolic Logic 88, 579\u2013619 (2022). https:\/\/doi.org\/10.1017\/jsl.2022.80","journal-title":"J. Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Li, C.T.: First-order theory of probabilistic independence and single-letter characterizations of capacity regions. In: ISIT, pp. 1536\u20131541. IEEE (2022)","key":"45_CR21","DOI":"10.1109\/ISIT50566.2022.9834552"},{"unstructured":"L\u00fcck, M.: Team logic: axioms, expressiveness, complexity. Ph.D. thesis, University of Hanover, Hannover, Germany (2020). www.repo.uni-hannover.de\/handle\/123456789\/9430","key":"45_CR22"},{"unstructured":"Papadimitriou, C.H.: Computational complexity. Academic Internet Publ. (2007)","key":"45_CR23"},{"issue":"2","key":"45_CR24","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., Stefankovic, D.: Fixed points, Nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"V\u00e4\u00e4n\u00e4nen, J.A.: Dependence Logic - A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol. 70. Cambridge University Press, Cambridge (2007)","key":"45_CR25","DOI":"10.1017\/CBO9780511611193"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,22]],"date-time":"2023-12-22T12:56:16Z","timestamp":1703249776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_45","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":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","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":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","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":"111","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":"41","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":"11","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":"37% - 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,6","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)"}}]}}