{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:06:15Z","timestamp":1742965575527,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319088518"},{"type":"electronic","value":"9783319088525"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08852-5_48","type":"book-chapter","created":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T14:03:23Z","timestamp":1405605803000},"page":"466-475","source":"Crossref","is-referenced-by-count":1,"title":["A Propositional CONEstrip Algorithm"],"prefix":"10.1007","author":[{"given":"Erik","family":"Quaeghebeur","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1-4","key":"48_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1014585822798","volume":"35","author":"M. Baioletti","year":"2002","unstructured":"Baioletti, M., Capotorti, A., Tulipani, S., Vantaggi, B.: Simplification rules for the coherent probability assessment problem. Annals of Mathematics and Artificial Intelligence\u00a035(1-4), 11\u201328 (2002)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-46632-0_26","volume-title":"Algorithms and Computations","author":"N. Bansal","year":"1999","unstructured":"Bansal, N., Raman, V.: Upper bounds for MaxSat: Further improved. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol.\u00a01741, pp. 247\u2013258. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"48_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10472-005-9005-y","volume":"45","author":"V. Biazzo","year":"2005","unstructured":"Biazzo, V., Gilio, A., Lukasiewicz, T., Sanfilippo, G.: Probabilistic logic under coherence: complexity and algorithms. Annals of Mathematics and Artificial Intelligence\u00a045(1-2), 35\u201381 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"48_CR4","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185. IOS Press (2009)"},{"key":"48_CR5","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-39091-3_13","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"F.G. Cozman","year":"2013","unstructured":"Cozman, F.G., di Ianni, L.F.: Probabilistic satisfiability and coherence checking through integer programming. In: van der Gaag, L.C. (ed.) ECSQARU 2013. LNCS (LNAI), vol.\u00a07958, pp. 145\u2013156. Springer, Heidelberg (2013)"},{"key":"48_CR6","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. Journal of Complexity\u00a04, 1\u201311 (1988)","journal-title":"Journal of Complexity"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Gomes, C.P., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, ch. 2, pp. 89\u2013134. Elsevier (2008)","DOI":"10.1016\/S1574-6526(07)03002-7"},{"issue":"2-3","key":"48_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0888-613X(00)00033-5","volume":"24","author":"P. Hansen","year":"2000","unstructured":"Hansen, P., Jaumard, B., de Arag\u00e3o, M.P., Chauny, F., Perron, S.: Probabilistic satisfiability with imprecise probabilities. International Journal of Approximate Reasoning\u00a024(2-3), 171\u2013189 (2000)","journal-title":"International Journal of Approximate Reasoning"},{"key":"48_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-02777-2_45","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"V. Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for weighted boolean optimization. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 495\u2013508. Springer, Heidelberg (2009)"},{"key":"48_CR10","unstructured":"Prestwich, S.: CNF encodings. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, ch. 2, pp. 75\u201398. IOS Press (2009)"},{"issue":"1-4","key":"48_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10472-005-0430-8","volume":"43","author":"D. Pretolani","year":"2005","unstructured":"Pretolani, D.: Probability logic and optimization SAT: The PSAT and CPA models. Annals of Mathematics and Artificial Intelligence\u00a043(1-4), 211\u2013221 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"48_CR12","series-title":"AISC","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-33042-1_6","volume-title":"Synergies of Soft Computing and Statistics for Intelligent Data Analysis","author":"E. Quaeghebeur","year":"2013","unstructured":"Quaeghebeur, E.: The CONEstrip algorithm. In: Kruse, R., Berthold, M.R., Moewes, C., Gil, M.A., Grzegorzewski, P., Hryniewicz, O. (eds.) Synergies of Soft Computing and Statistics. AISC, vol.\u00a0190, pp. 45\u201354. Springer, Heidelberg (2013), \n http:\/\/hdl.handle.net\/1854\/LU-3007274"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Quaeghebeur, E.: Desirability. In: Coolen, F.P.A., Augustin, T., de Cooman, G., Troffaes, M.C.M. (eds.) Introduction to Imprecise Probabilities. Wiley (2014)","DOI":"10.1002\/9781118763117.ch1"},{"key":"48_CR14","unstructured":"Quaeghebeur, E., de Cooman, G., Hermans, F.: Accept & reject statement-based uncertainty models (submitted), \n http:\/\/arxiv.org\/abs\/1208.4462"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Walley, P.: Statistical reasoning with imprecise probabilities. Monographs on Statistics and Applied Probability, vol.\u00a042. Chapman & Hall (1991)","DOI":"10.1007\/978-1-4899-3472-7"},{"issue":"2-3","key":"48_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0888-613X(00)00031-1","volume":"24","author":"P. Walley","year":"2000","unstructured":"Walley, P.: Towards a unified theory of imprecise probability. International Journal of Approximate Reasoning\u00a024(2-3), 125\u2013148 (2000)","journal-title":"International Journal of Approximate Reasoning"},{"issue":"1","key":"48_CR17","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.jspi.2003.09.005","volume":"126","author":"P. Walley","year":"2004","unstructured":"Walley, P., Pelessoni, R., Vicig, P.: Direct algorithms for checking consistency and making inferences from conditional probability assessments. Journal of Statistical Planning and Inference\u00a0126(1), 119\u2013151 (2004)","journal-title":"Journal of Statistical Planning and Inference"}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08852-5_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T09:53:44Z","timestamp":1675245224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08852-5_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319088518","9783319088525"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08852-5_48","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}