{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:41:04Z","timestamp":1768686064391,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319942049","type":"print"},{"value":"9783319942056","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94205-6_14","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T16:22:50Z","timestamp":1530289370000},"page":"194-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Probably Half True: Probabilistic Satisfiability over \u0141ukasiewicz Infinitely-Valued Logic"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Preto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,30]]},"reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009). http:\/\/scip.zib.de\/","journal-title":"Math. Program. Comput."},{"key":"14_CR2","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.N.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bofill, M., Manya, F., Vidal, A., Villaret, M.: Finding hard instances of satisfiability in \u0141ukasiewicz logics. In: ISMVL, pp. 30\u201335. IEEE (2015)","DOI":"10.1109\/ISMVL.2015.10"},{"key":"14_CR4","unstructured":"Boole, G.: An Investigation on the Laws of Thought. Macmillan, London (1854). Available on project Gutemberg at http:\/\/www.gutenberg.org\/etext\/15114"},{"key":"14_CR5","series-title":"Algorithms and Combinatorics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61578-8","volume-title":"The Simplex Method: A Probabilistic Analysis","author":"KH Borgward","year":"1986","unstructured":"Borgward, K.H.: The Simplex Method: A Probabilistic Analysis. Algorithms and Combinatorics, vol. 1. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/978-3-642-61578-8"},{"issue":"3","key":"14_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)","journal-title":"Int. J. Approx. Reason."},{"key":"14_CR7","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: 12th IJCAI, pp. 331\u2013337. Morgan Kaufmann (1991)"},{"key":"14_CR8","series-title":"Trends in Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9480-6","volume-title":"Algebraic Foundations of Many-Valued Reasoning","author":"R Cignoli","year":"2000","unstructured":"Cignoli, R., d\u2019Ottaviano, I., Mundici, D.: Algebraic Foundations of Many-Valued Reasoning. Trends in Logic. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-94-015-9480-6"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.4064\/fm-17-1-298-329","volume":"17","author":"B Finetti de","year":"1931","unstructured":"de Finetti, B.: Sul significato soggettivo della probabilit\u00e0. Fundamenta Mathematicae 17(1), 298\u2013329 (1931)","journal-title":"Fundamenta Mathematicae"},{"key":"14_CR10","unstructured":"de Finetti, B.: La pr\u00e9vision: Ses lois logiques, ses sources subjectives (1937)"},{"key":"14_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9781119286387","volume-title":"Theory of Probability: A Critical Introductory Treatment","author":"B Finetti de","year":"2017","unstructured":"de Finetti, B.: Theory of Probability: A Critical Introductory Treatment. Wiley, Hoboken (2017). Translated by Antonio Mach\u00ed and Adrian Smith"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-08867-9_49","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2014","unstructured":"Dutertre, B.: Yices\u00a02.2. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 737\u2013744. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_49"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/B978-0-444-89596-7.50017-1","volume-title":"Handbook of Convex Geometry","author":"J\u00fcrgen ECKHOFF","year":"1993","unstructured":"Eckhoff, J.: Helly, Radon, and Caratheodory type theorems. In: Handbook of Convex Geometry, pp. 389\u2013448. Elsevier Science Publishers (1993)"},{"key":"14_CR14","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":"14_CR15","first-page":"351","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)","journal-title":"AMAI"},{"issue":"3","key":"14_CR16","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. Ann. Math. Artif. Intell. 75(3), 351\u2013379 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR17","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: Proceedings of the Eleventh European Conference on Artificial Intelligence, ECAI 1994, pp. 105\u2013109. Wiley (1994)"},{"issue":"1","key":"14_CR18","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)","journal-title":"J. Complex."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","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.) CSL 1990. LNCS, vol. 533, pp. 248\u2013260. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54487-9_62"},{"key":"14_CR20","series-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-94-017-1737-3_8","volume-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","author":"P Hansen","year":"2000","unstructured":"Hansen, P., Jaumard, B.: Probabilistic satisfiability. In: Kohlas, J., Moral, S. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems. HAND, vol. 5, pp. 321\u2013367. Springer, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-94-017-1737-3_8"},{"key":"14_CR21","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":"14_CR22","first-page":"189","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)","journal-title":"AMAI"},{"key":"14_CR23","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. Log. 16, 1\u201313 (1951)","journal-title":"J. Symb. Log."},{"key":"14_CR24","series-title":"Trends in Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-0840-2","volume-title":"Advanced \u0141ukasiewicz calculus and MV-algebras","author":"D Mundici","year":"2011","unstructured":"Mundici, D.: Advanced \u0141ukasiewicz calculus and MV-algebras. Trends in Logic. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-94-007-0840-2"},{"issue":"1\u20132","key":"14_CR25","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":"14_CR26","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 logic. J. Symb. Log. 59(2), 596\u2013602 (1994)","journal-title":"J. Symb. Log."},{"issue":"3","key":"14_CR27","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)","journal-title":"Int. J. Approx. Reason."},{"issue":"1","key":"14_CR28","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":"14_CR29","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C Papadimitriou","year":"1998","unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94205-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T05:22:55Z","timestamp":1571548975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94205-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319942049","9783319942056"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94205-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}