{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T10:15:58Z","timestamp":1675246558092},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2004,12,31]],"date-time":"2004-12-31T00:00:00Z","timestamp":1104451200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10472-005-0430-8","type":"journal-article","created":{"date-parts":[[2005,3,2]],"date-time":"2005-03-02T19:19:42Z","timestamp":1109791182000},"page":"211-221","source":"Crossref","is-referenced-by-count":8,"title":["Probability logic and optimization SAT: The PSAT and CPA models"],"prefix":"10.1007","volume":"43","author":[{"given":"Daniele","family":"Pretolani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,12,31]]},"reference":[{"key":"430_CR1","unstructured":"F.A. Aloul, A. Ramani, I.L. Markov and K.A. Sakallah, PBS: A backtrack-search pseudo-Boolean solver and optimizer, presented at SAT02 \u2014 Fifth Int. Symp. on Theory and Applications of Satisfiability Testing, Cincinnati, OH (2002)."},{"issue":"1","key":"430_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1012332915908","volume":"33","author":"K.A. Andersen","year":"2001","unstructured":"K.A. Andersen and D. Pretolani, Easy cases of probabilistic satisfiability, Annals of Mathematics and Artificial Intelligence 33(1) (2001) 69\u201391.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"430_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s005000000040","volume":"4","author":"M. Baioletti","year":"2000","unstructured":"M. Baioletti, A. Capotorti, S. Tulipani and B. Vantaggi, Elimination of Boolean variables for probabilistic coherence, Software Computing 4(2) (2000) 81\u201388.","journal-title":"Software Computing"},{"key":"430_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1014585822798","volume":"35","author":"M. Baioletti","year":"2002","unstructured":"M. Baioletti, A. Capotorti, S. Tulipani and B. Vantaggi, Simplification rules for the coherent probability assessment problem, Annals of Mathematics and Artificial Intelligence 35 (2002) 11\u201328.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"430_CR5","volume-title":"An Investigation of the Laws of Thought","author":"G. Boole","year":"1854","unstructured":"G. Boole, An Investigation of the Laws of Thought (Walton and Maberley, London, 1854)."},{"key":"430_CR6","first-page":"159","volume":"3","author":"G. Coletti","year":"1996","unstructured":"G. Coletti, Coherence principles for handling qualitative and quantitative partial probabilistic assessment, Mathware and Software Computing 3 (1996) 159\u2013172.","journal-title":"Mathware and Software Computing"},{"key":"430_CR7","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1145\/210118.210137","volume":"42","author":"M. Conforti","year":"1995","unstructured":"M. Conforti and G. Cornu\u00e9jols, A class of logic problems solvable by Linear Programming, Journal of the Association for Computing Machinery 42 (1995) 1107\u20131113.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"430_CR8","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0020-0190(98)00163-X","volume":"68","author":"N. Creignou","year":"1998","unstructured":"N. Creignou, Complexity versus stability for classes of propositional formulas, Information Processing Letters 68 (1998) 161\u2013165.","journal-title":"Information Processing Letters"},{"key":"430_CR9","volume-title":"Teoria della probabilit\u00e0","author":"B. Finetti de","year":"1970","unstructured":"B. de Finetti, Teoria della probabilit\u00e0, Vols. I, II (Einaudi, Torino, 1970). English translation: Theory of Probability, Vols. I, II (Wiley, New York, 1974)."},{"key":"430_CR10","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/ijoc.14.1.20.7709","volume":"14","author":"G. Felici","year":"2002","unstructured":"G. Felici and K. Truemper, A MINSAT approach for learning in logic domains, INFORMS Journal on Computing 14 (2002) 20\u201336.","journal-title":"INFORMS Journal on Computing"},{"key":"430_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"430_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0885-064X(88)90006-4","volume":"4","author":"G. Georgakopoulos","year":"1988","unstructured":"G. Georgakopoulos, D. Kavvadias and C.H. Papadimitriou, Probabilistic satisfiability, Journal of Complexity 4 (1988) 1\u201311.","journal-title":"Journal of Complexity"},{"key":"430_CR13","volume-title":"Boole\u2019s Logic and Probability","author":"T. Hailperin","year":"1986","unstructured":"T. Hailperin, Boole\u2019s Logic and Probability, 2nd ed., Studies in Logic and the Foundations of Mathematics, Vol. 85 (North-Holland, Amsterdam, 1986).","edition":"2nd ed."},{"key":"430_CR14","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0888-613X(00)00033-5","volume":"24","author":"P. Hansen","year":"2000","unstructured":"P. Hansen, B. Jaumard, M. Poggi de Arag\u00e3o, F. Chauny and S. Perron, Probabilistic satisfiability with imprecise probabilities, International Journal of Approximate Reasoning 24 (2000) 171\u2013189.","journal-title":"International Journal of Approximate Reasoning"},{"key":"430_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/ijoc.3.2.135","volume":"3","author":"B. Jaumard","year":"1991","unstructured":"B. Jaumard, P. Hansen and M. Poggi de Arag\u00e3o, Column generation methods for probabilistic logic, ORSA Journal on Computing 3 (1991) 135\u2013148.","journal-title":"ORSA Journal on Computing"},{"key":"430_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(87)90028-7","volume":"26","author":"B. Jaumard","year":"1987","unstructured":"B. Jaumard and B. Simeone, On the complexity of the Maximum Satisfiability Problem for Horn formulas, Information Processing Letters 26 (1987\/88) 1\u20134.","journal-title":"Information Processing Letters"},{"key":"430_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"430_CR18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N.J. Nilsson","year":"1986","unstructured":"N.J. Nilsson, Probabilistic logic, Artificial Intelligence 28 (1986) 71\u201387.","journal-title":"Artificial Intelligence"},{"key":"430_CR19","unstructured":"J. Slaney and T. Walsh, Phase transition behavior: From decision to optimization, presented at SAT02 \u2014 Fifth Int. Symp. on Theory and Applications of Satisfiability Testing, Cincinnati, OH (2002)."},{"key":"430_CR20","volume-title":"Effective Logic Computation","author":"K. Truemper","year":"1998","unstructured":"K. Truemper, Effective Logic Computation (Wiley, New York, 1998)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-0430-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-005-0430-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-005-0430-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:51:48Z","timestamp":1559152308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-005-0430-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12,31]]},"references-count":20,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s10472-005-0430-8","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12,31]]}}}