{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:18:07Z","timestamp":1648552687207},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T00:00:00Z","timestamp":1232496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s10479-008-0502-3","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T13:53:58Z","timestamp":1232459638000},"page":"371-387","source":"Crossref","is-referenced-by-count":0,"title":["Optimization and probabilistic satisfiability on nested and co-nested formulas"],"prefix":"10.1007","volume":"188","author":[{"given":"Daniele","family":"Pretolani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,21]]},"reference":[{"key":"502_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"R. K. Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: theory, algorithms, and applications. New York: Prentice Hall."},{"key":"502_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1012332915908","volume":"33","author":"K. A. Andersen","year":"2001","unstructured":"Andersen, K. A., & Pretolani, D. (2001). Easy cases of probabilistic satisfiability. Annals of Mathematics and Artificial Intelligence, 33, 69\u201391.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"502_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s005000000040","volume":"4","author":"G. Baioletti","year":"2000","unstructured":"Baioletti, G., Capotorti, A., Tulipani, S., & Vantaggi, B. (2000). Elimination of Boolean variables for probabilistic coherence. Soft Computing, 4(2), 81\u201388.","journal-title":"Soft Computing"},{"key":"502_CR4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1014585822798","volume":"35","author":"G. Baioletti","year":"2002","unstructured":"Baioletti, G., Capotorti, A., Tulipani, S., & Vantaggi, B. (2002). Simplification rules for the coherent probabilistic assessment problem. Annals of Mathematics and Artificial Intelligence, 35, 11\u201328.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"502_CR5","volume-title":"An investigation of the laws of thought","author":"G. Boole","year":"1854","unstructured":"Boole, G. (1854). An investigation of the laws of thought. London: Walton and Maberlay."},{"key":"502_CR6","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1145\/210118.210137","volume":"42","author":"M. Conforti","year":"1995","unstructured":"Conforti, M., & Cornu\u00e9jols, G. (1995). A class of logic problems solvable by linear programming. Journal of the ACM, 42, 1107\u20131113.","journal-title":"Journal of the ACM"},{"key":"502_CR7","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y. Crama","year":"1990","unstructured":"Crama, Y., Hansen, P., & Jaumard, B. (1990). The basic algorithm for pseudo-Boolean programming revisited. Discrete Applied Mathematics, 29, 171\u2013185.","journal-title":"Discrete Applied Mathematics"},{"key":"502_CR8","doi-asserted-by":"crossref","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. (1988). Parabilistic satisfiability. Journal of Complexity, 4, 1\u201311.","journal-title":"Journal of Complexity"},{"key":"502_CR9","series-title":"Studies in logic and the foundations of mathematics","volume-title":"Boole\u2019s logic and probability","author":"T. Hailperin","year":"1986","unstructured":"Hailperin, T. (1986). Boole\u2019s logic and probability (2nd ed.) Studies in logic and the foundations of mathematics (Vol.\u00a085). Amsterdam: North-Holland.","edition":"2"},{"key":"502_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02983372","volume":"28","author":"D. E. Knuth","year":"1990","unstructured":"Knuth, D. E. (1990). Nested satisfiability. Acta Informatica, 28, 1\u20136.","journal-title":"Acta Informatica"},{"key":"502_CR11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01209713","volume":"30","author":"J. Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J., & K\u0159iv\u00e1nek, M. (1993). Satisfiability of co-nested formulas. Acta Informatica, 30, 397\u2013403.","journal-title":"Acta Informatica"},{"key":"502_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(86)90031-7","volume":"28","author":"N. J. Nilsson","year":"1986","unstructured":"Nilsson, N. J. (1986). Probabilistic logic. Artificial Intelligence, 28, 71\u201387.","journal-title":"Artificial Intelligence"},{"key":"502_CR13","series-title":"Lecture notes comp. sci.","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-540-24605-3_29","volume-title":"Theory and application of satisfiability testing, 6th international conference, SAT 2003","author":"D. Pretolani","year":"2004","unstructured":"Pretolani, D. (2004). Hypergraphs reduction and satisfiability problems. In Lecture notes comp. sci.: Vol.\u00a02919. Theory and application of satisfiability testing, 6th international conference, SAT 2003 (pp.\u00a0383\u2013397). Berlin: Springer."},{"key":"502_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s10472-005-0430-8","volume":"43","author":"D. Pretolani","year":"2005","unstructured":"Pretolani, D. (2005). Probability logic and optimization SAT: The PSAT and CPA models. Annals of Mathematics and Artificial Intelligence, 43, 211\u2013221.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"11","key":"502_CR15","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"J. Y. Yen","year":"1971","unstructured":"Yen, J. Y. (1971). Finding the K shortest loopless paths in a network. Management Science, 17(11), 712\u2013716.","journal-title":"Management Science"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0502-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-008-0502-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-008-0502-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:07:52Z","timestamp":1559138872000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-008-0502-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,21]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["502"],"URL":"https:\/\/doi.org\/10.1007\/s10479-008-0502-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,21]]}}}