{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:33:29Z","timestamp":1725568409701},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169519"},{"type":"electronic","value":"9783642169526"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16952-6_46","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:52:47Z","timestamp":1288691567000},"page":"453-462","source":"Crossref","is-referenced-by-count":1,"title":["A Logic Based Algorithm for Solving Probabilistic Satisfiability"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"Finger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Glauber","family":"De Bona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"46_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1012332915908","volume":"33","author":"K. Andersen","year":"2001","unstructured":"Andersen, K., Pretolani, D.: Easy cases of probabilistic satisfiability. Annals of Mathematics in Artificial Intelligence\u00a033(1), 69\u201391 (2001)","journal-title":"Annals of Mathematics in Artificial Intelligence"},{"key":"46_CR2","volume-title":"An Investigation on the Laws of Thought","author":"G. Boole","year":"1854","unstructured":"Boole, G.: An Investigation on the Laws of Thought. Macmillan, London (1854)"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Third Annual ACM Symposium on Theory of Computing (STOC)","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Third Annual ACM Symposium on Theory of Computing (STOC), pp. 151\u2013158. ACM, New York (1971)"},{"key":"46_CR4","unstructured":"Dixon, H.E., Ginsberg, M.L.: Inference methods for a pseudo-boolean satisfiability solver. In: AAAI\/IAAI, pp. 635\u2013640 (2002)"},{"key":"46_CR5","unstructured":"Gent, I.P., Walsh, T.: The SAT phase transition. In: ECAI 1994 \u2013 Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 105\u2013109 (1994)"},{"issue":"1","key":"46_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), 1\u201311 (1988)","journal-title":"Journal of Complexity"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: Berkmin: A Fast and Robust SAT Solver. In: Design Automation and Test in Europe (DATE 2002), pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"46_CR8","first-page":"69","volume-title":"Recent Advances in Mathematical Programming","author":"R. Gomory","year":"1963","unstructured":"Gomory, R.: An algorithm for integer solutions to linear programs. In: Recent Advances in Mathematical Programming, pp. 69\u2013302. McGraw-Hill, New York (1963)"},{"issue":"3","key":"46_CR9","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1305\/ndjfl\/1093870625","volume":"25","author":"T. Hailperin","year":"1984","unstructured":"Hailperin, T.: Prob. logic. N. D. Journal of Formal Logic\u00a025(3), 198\u2013212 (1984)","journal-title":"N. D. Journal of Formal Logic"},{"key":"46_CR10","unstructured":"Hansen, P., Jaumard, B.: Probabilistic satisability. Technical Report, Les Cahiers du GERAD G-96-31, \u00c9cole Polytechique de Montr\u00e9al (1996)"},{"key":"46_CR11","unstructured":"Hansen, P., et al.: Probabilistic satisfiability with imprecise probabilities. In: 1st Int. Symposium on Imprecise Probabilities and Their Applications, pp. 165\u2013174 (1999)"},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"issue":"1","key":"46_CR13","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. Artificial Intelligence\u00a028(1), 71\u201387 (1986)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"46_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0004-3702(93)90167-A","volume":"59","author":"N. Nilsson","year":"1993","unstructured":"Nilsson, N.: Probabilistic logic revisited. Artificial Intelligence\u00a059(1-2), 39\u201342 (1993)","journal-title":"Artificial Intelligence"},{"key":"46_CR15","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"2","key":"46_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J.P. Warners","year":"1998","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into conjunctive normal form. Inf. Process. Lett.\u00a068(2), 63\u201369 (1998)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16952-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:19:53Z","timestamp":1553203193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16952-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169519","9783642169526"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16952-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}