{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:13:04Z","timestamp":1779379984991,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642027765","type":"print"},{"value":"9783642027772","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_47","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"524-537","source":"Crossref","is-referenced-by-count":20,"title":["c-sat: A Parallel SAT Solver for Clusters"],"prefix":"10.1007","author":[{"given":"Kei","family":"Ohmura","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazunori","family":"Ueda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1016\/S0167-8191(03)00068-1","volume":"29","author":"W. Blochinger","year":"2003","unstructured":"Blochinger, W., Sinz, C., K\u00fcchlin, W.: Parallel Propositional Satisfiability Checking with Distributed Dynamic Learning. Parallel Computing\u00a029, 969\u2013994 (2003)","journal-title":"Parallel Computing"},{"key":"47_CR2","unstructured":"Blochinger, W.: Towards Robustness in Parallel SAT Solving. In: Proc. ParCo 2005, John von Neumann Institute for Computing, pp. 301\u2013308 (2006)"},{"key":"47_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"47_CR4","first-page":"71","volume":"6","author":"L. Gil","year":"2008","unstructured":"Gil, L., Flores, P., Silveira, L.M.: PMSat: a Parallel Version of MiniSAT. JSAT\u00a06, 71\u201398 (2008)","journal-title":"JSAT"},{"key":"47_CR5","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySat: Solver Description. Technical Report MSR-TR-2008-83, Microsoft Research (2008)"},{"key":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-85776-1_21","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"A. Hyv\u00e4rinen","year":"2008","unstructured":"Hyv\u00e4rinen, A., Junttila, T., Niemel\u00e4, I.: Incorporating Learning in Grid-Based Randomized SAT Solving. In: Dochev, D., Pistore, M., Traverso, P. (eds.) AIMSA 2008. LNCS, vol.\u00a05253, pp. 247\u2013261. Springer, Heidelberg (2008)"},{"issue":"16","key":"47_CR7","doi-asserted-by":"publisher","first-page":"2291","DOI":"10.1016\/j.dam.2006.04.015","volume":"154","author":"K. Inoue","year":"2006","unstructured":"Inoue, K., Soh, T., Ueda, S., Sasaura, Y., Banbara, M., Tamura, N.: A Competitive and Cooperative Approach to Propositional Satisfiability. Discrete Applied Mathematics\u00a0154(16), 2291\u20132306 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Lewis, M., Schubert, T., Becker, B.: Multithreaded SAT Solving. In: Proc. 12th Asia and South Pacific Design Automation Conference, pp. 926\u2013931 (2007)","DOI":"10.1109\/ASPDAC.2007.358108"},{"key":"47_CR9","unstructured":"Plaza, S., Kountainis, I., Andraus, Z., Bertacco, V., Mudge, T.: Advanced and Insights into Parallel SAT Solving. In: Proc. 15th Int. Workshop on Logic & Synthesis (IWLS 2006), pp. 188\u2013194 (2006)"},{"key":"47_CR10","unstructured":"SAT-Race 2008 Results (2008), \n                    \n                      http:\/\/baldur.iti.uka.de\/sat-race-2008\/results.html"},{"key":"47_CR11","volume-title":"Parallel Combinatorial Optimization","author":"D. Singer","year":"2006","unstructured":"Singer, D.: Parallel Resolution of the Satisfiability Problem: A Survey. In: Talbi, E.-G. (ed.) Parallel Combinatorial Optimization, ch.\u00a05. Wiley, Chichester (2006)"},{"key":"47_CR12","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/11499107_42","volume-title":"Theory and Applications of Satisfiability Testing","author":"H. Zhang","year":"2005","unstructured":"Zhang, H.: On Subsumption Removal and On-the-Fly CNF Simplification. In: Bacchus, F., Walsh, T. (eds.) SAT 2005, vol.\u00a03569, pp. 482\u2013489. Springer, Heidelberg (2005)"},{"issue":"4","key":"47_CR13","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1006\/jsco.1996.0030","volume":"21","author":"H. Zhang","year":"1996","unstructured":"Zhang, H., Bonacina, M.P., Hsiang, J.: PSATO: a Distributed Propositional Prover and Its Application to Quasigroup Problems. J. Symb. Comput.\u00a021(4), 543\u2013560 (1996)","journal-title":"J. Symb. Comput."},{"key":"47_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45657-0_2","volume-title":"Computer Aided Verification","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: The Quest for Efficient Boolean Satisfiability Solvers. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 17\u201336. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T00:19:12Z","timestamp":1552090752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}