{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T10:47:56Z","timestamp":1776077276541,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/21880-4"],"award-info":[{"award-number":["2015\/21880-4"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2014\/12236-1"],"award-info":[{"award-number":["2014\/12236-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["PQ 303609\/2018-4"],"award-info":[{"award-number":["PQ 303609\/2018-4"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s10817-020-09558-9","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T02:02:17Z","timestamp":1591408937000},"page":"1269-1286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Probably Partially True: Satisfiability for \u0141ukasiewicz Infinitely-Valued Probabilistic Logic and Related Topics"],"prefix":"10.1007","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1391-1175","authenticated-orcid":false,"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4448-5364","authenticated-orcid":false,"given":"Sandro","family":"Preto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"key":"9558_CR1","first-page":"315","volume-title":"Weierstrass Approximation Theorem and \u0141ukasiewicz Formulas with One Quantified Variable","author":"S Aguzzoli","year":"2003","unstructured":"Aguzzoli, S., Mundici, D.: Weierstrass Approximation Theorem and \u0141ukasiewicz Formulas with One Quantified Variable, pp. 315\u2013335. Physica-Verlag HD, Heidelberg (2003)"},{"key":"9558_CR2","volume-title":"Introduction to Linear Optimization. Athena Scientific Series in Optimization and Neural Computation","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific Series in Optimization and Neural Computation. Athena Scientific, Belmont (1997)"},{"key":"9558_CR3","doi-asserted-by":"crossref","unstructured":"Bofill, M., Manya, F., Vidal, A., Villaret, M.: Finding hard instances of satisfiability in \u0141ukasiewicz logics. In: ISMVL. IEEE, pp. 30\u201335 (2015)","DOI":"10.1109\/ISMVL.2015.10"},{"key":"9558_CR4","unstructured":"Boole, G.: An Investigation on the Laws of Thought. Macmillan, London (1854). http:\/\/www.gutenberg.org\/etext\/15114"},{"key":"9558_CR5","volume-title":"The Simplex Method: A Probabilistic Analysis. Algorithms and Combinatorics","author":"KH Borgward","year":"1986","unstructured":"Borgward, K.H.: The Simplex Method: A Probabilistic Analysis. Algorithms and Combinatorics, vol. 1. Springer, Berlin (1986)"},{"issue":"3","key":"9558_CR6","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.ijar.2009.10.002","volume":"51","author":"S Bova","year":"2010","unstructured":"Bova, S., Flaminio, T.: The coherence of \u0141ukasiewicz assessments is NP-complete. Int. J. Approx. Reason. 51(3), 294\u2013304 (2010). https:\/\/doi.org\/10.1016\/j.ijar.2009.10.002","journal-title":"Int. J. Approx. Reason."},{"key":"9558_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9480-6","volume-title":"Algebraic Foundations of Many-Valued Reasoning. Trends in Logic","author":"R Cignoli","year":"2000","unstructured":"Cignoli, R., d\u2019Ottaviano, I., Mundici, D.: Algebraic Foundations of Many-Valued Reasoning. Trends in Logic. Springer, Berlin (2000)"},{"key":"9558_CR8","unstructured":"de Finetti, B.: La pr\u00e9vision: Ses lois logiques, ses sources subjectives (1937)"},{"issue":"1","key":"9558_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.4064\/fm-17-1-298-329","volume":"17","author":"B de Finetti","year":"1931","unstructured":"de Finetti, B.: Sul significato soggettivo della probabilit\u00e0. Fundam. Math. 17(1), 298\u2013329 (1931)","journal-title":"Fundam. Math."},{"key":"9558_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9781119286387","volume-title":"Theory of Probability: A Critical Introductory Treatment. Translated by Antonio Mach\u00ed and Adrian Smith","author":"B de Finetti","year":"2017","unstructured":"de Finetti, B.: Theory of Probability: A Critical Introductory Treatment. Translated by Antonio Mach\u00ed and Adrian Smith. Wiley, Hoboken (2017)"},{"key":"9558_CR11","doi-asserted-by":"crossref","unstructured":"Eckhoff, J.: Helly, Radon, and Caratheodory type theorems. In: Gruber, P.M., Wills, J.M. (eds.) Handbook of Convex Geometry, pp. 389\u2013448. Elsevier Science Publishers (1993)","DOI":"10.1016\/B978-0-444-89596-7.50017-1"},{"issue":"1","key":"9558_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s001530050173","volume":"40","author":"F Esteva","year":"2001","unstructured":"Esteva, F., Godo, L., Montagna, F.: The \u0141$$\\Pi $$ and \u0141$$\\Pi \\frac{1}{2}$$ logics: two complete fuzzy systems joining \u0141ukasiewicz and product logics. Arch. Math. Logic 40(1), 39\u201367 (2001)","journal-title":"Arch. Math. Logic"},{"key":"9558_CR13","unstructured":"Finger, M., Bona, G.D.: Probabilistic satisfiability: logic-based algorithms and phase transition. In: Walsh, T. (ed.) IJCAI, IJCAI\/AAAI, pp. 528\u2013533 (2011)"},{"issue":"3","key":"9558_CR14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10472-015-9466-6","volume":"75","author":"M Finger","year":"2015","unstructured":"Finger, M., De Bona, G.: Probabilistic satisfiability: algorithms with the presence and absence of a phase transition. AMAI 75(3), 351\u2013379 (2015). https:\/\/doi.org\/10.1007\/s10472-015-9466-6","journal-title":"AMAI"},{"key":"9558_CR15","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-94205-6_14","volume-title":"Automated Reasoning","author":"M Finger","year":"2018","unstructured":"Finger, M., Preto, S.: Probably half true: probabilistic satisfiability over \u0141ukasiewicz infinitely-valued logic. In: Galmiche, D., Schulz, S., Sebastiani, R. (eds.) Automated Reasoning, pp. 194\u2013210. Springer, Cham (2018)"},{"issue":"1","key":"9558_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G Georgakopoulos","year":"1988","unstructured":"Georgakopoulos, G., Kavvadias, D., Papadimitriou, C.H.: Probabilistic satisfiability. J. Complex. 4(1), 1\u201311 (1988). https:\/\/doi.org\/10.1016\/0885-064X(88)90006-4","journal-title":"J. Complex."},{"issue":"6","key":"9558_CR17","first-page":"579","volume":"11","author":"B Gerla","year":"2001","unstructured":"Gerla, B.: Rational \u0141ukasiewicz logic and DMV-algebras. Neural Netw. World 11(6), 579\u2013594 (2001)","journal-title":"Neural Netw. World"},{"key":"9558_CR18","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/3-540-54487-9_62","volume-title":"Computer Science Logic","author":"R H\u00e4hnle","year":"1991","unstructured":"H\u00e4hnle, R.: Towards an efficient tableau proof procedure for multiple-valued logics. In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M., Sch\u00f6nfeld, W. (eds.) Computer Science Logic, pp. 248\u2013260. Springer, Heidelberg (1991)"},{"key":"9558_CR19","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44, 279\u2013303 (1990). https:\/\/doi.org\/10.1007\/BF02241270","journal-title":"Computing"},{"key":"9558_CR20","doi-asserted-by":"crossref","unstructured":"Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 5, p. 321. Springer (2000)","DOI":"10.1007\/978-94-017-1737-3_8"},{"key":"9558_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01531078","volume":"1","author":"D Kavvadias","year":"1990","unstructured":"Kavvadias, D., Papadimitriou, C.H.: A linear programming approach to reasoning about probabilities. AMAI 1, 189\u2013205 (1990). https:\/\/doi.org\/10.1007\/BF01531078","journal-title":"AMAI"},{"key":"9558_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2268660","volume":"16","author":"R McNaughton","year":"1951","unstructured":"McNaughton, R.: A theorem about infinite-valued sentential logic. J. Symb. Logic 16, 1\u201313 (1951)","journal-title":"J. Symb. Logic"},{"issue":"1\u20132","key":"9558_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theor. Comput. Sci. 52(1\u20132), 145\u2013153 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"9558_CR24","doi-asserted-by":"publisher","first-page":"596","DOI":"10.2307\/2275410","volume":"59","author":"D Mundici","year":"1994","unstructured":"Mundici, D.: A constructive proof of McNaughton\u2019s theorem in infinite-valued logics. J. Symb. Logic 59(2), 596\u2013602 (1994)","journal-title":"J. Symb. Logic"},{"issue":"3","key":"9558_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.ijar.2006.04.004","volume":"43","author":"D Mundici","year":"2006","unstructured":"Mundici, D.: Bookmaking over infinite-valued events. Int. J. Approx. Reason. 43(3), 223\u2013240 (2006). https:\/\/doi.org\/10.1016\/j.ijar.2006.04.004","journal-title":"Int. J. Approx. Reason."},{"key":"9558_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0840-2","volume-title":"Advanced \u0141ukasiewicz Calculus and MV-Algebras. Trends in Logic","author":"D Mundici","year":"2011","unstructured":"Mundici, D.: Advanced \u0141ukasiewicz Calculus and MV-Algebras. Trends in Logic. Springer, Dordrecht (2011)"},{"issue":"1","key":"9558_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N Nilsson","year":"1986","unstructured":"Nilsson, N.: Probabilistic logic. Artif. Intell. 28(1), 71\u201387 (1986)","journal-title":"Artif. Intell."},{"key":"9558_CR28","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C Papadimitriou","year":"1998","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-020-09558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10817-020-09558-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10817-020-09558-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T23:25:23Z","timestamp":1622935523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10817-020-09558-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":28,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9558"],"URL":"https:\/\/doi.org\/10.1007\/s10817-020-09558-9","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"20 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}