{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:29:42Z","timestamp":1725798582979},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_48","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T01:33:54Z","timestamp":1407893634000},"page":"655-671","source":"Crossref","is-referenced-by-count":2,"title":["Insights into Parallelism with Intensive Knowledge Sharing"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Sabharwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Samulowitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","unstructured":"Aigner, M., Biere, A., Kirsch, C.M., Niemetz, A., Preiner, M.: Analysis of portfolio-style parallel SAT solving on current multi-core architectures. In: POS-2013: Intl. Workshop on Pragmatics of SAT, Helsinki, Finland (2013)"},{"key":"48_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-31612-8_16","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"G. Audemard","year":"2012","unstructured":"Audemard, G., Hoessen, B., Jabbour, S., Lagniez, J.-M., Piette, C.: Revisiting clause exchange in parallel sat solving. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 200\u2013213. Springer, Heidelberg (2012)"},{"key":"48_CR3","unstructured":"Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: 21st IJCAI, Pasadena, CA, pp. 399\u2013404 (July 2009)"},{"key":"48_CR4","unstructured":"Balint, A., Belov, A., Heule, M., J\u00e4rvisalo, M.: SAT competition (2013)"},{"issue":"2","key":"48_CR5","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1006\/inco.2000.2885","volume":"163","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of NP-witnesses using an NP-oracle. Information and Computation\u00a0163(2), 510\u2013526 (2000)","journal-title":"Information and Computation"},{"key":"48_CR6","unstructured":"Biere, A.: Lingeling, Plingeling and Treengeling entering the SAT Competition 2013. In: Proc. of SAT Competition 2013, Univ. of Helsinki. Dept. of Computer Science Series of Publications B, vol.\u00a0B-2013-1, pp. 51\u201352 (2013)"},{"key":"48_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-31612-8_38","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"B. Bloom","year":"2012","unstructured":"Bloom, B., Grove, D., Herta, B., Sabharwal, A., Samulowitz, H., Saraswat, V.: SatX10: A scalable plug&play parallel SAT framework - (tool presentation). In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 463\u2013468. Springer, Heidelberg (2012)"},{"key":"48_CR8","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with massively parallel constraint solving. In: 21st IJCAI, pp. 443\u2013448 (2009)"},{"key":"48_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-642-39799-8_40","volume-title":"Computer Aided Verification","author":"S. Chakraborty","year":"2013","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: A scalable and nearly uniform generator of SAT witnesses. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol.\u00a08044, pp. 608\u2013623. Springer, Heidelberg (2013)"},{"key":"48_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-04244-7_20","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chu","year":"2009","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 226\u2013241. Springer, Heidelberg (2009)"},{"key":"48_CR11","unstructured":"Ermon, S., Gomes, C., Sabharwal, A., Selman, B.: Taming the curse of dimensionality: Discrete integration by hashing and optimization. In: 30th ICML, pp. 334\u2013342 (June 2013)"},{"key":"48_CR12","unstructured":"Ermon, S., Gomes, C., Sabharwal, A., Selman, B.: Low-density parity constraints for hashing-based discrete integration. In: 31st ICML (2014)"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Monaci, M., Salvagnin, D.: Self-splitting of workload in parallel computation (May 2014)","DOI":"10.1007\/978-3-319-07046-9_28"},{"key":"48_CR14","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting: A new strategy for obtaining good bounds. In: 21st AAAI, Boston, MA, pp. 54\u201361 (July 2006)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Wintersteiger, C.M.: Seven challenges in parallel sat solving. In: 26th AAAI (2012)","DOI":"10.1609\/aimag.v34i2.2450"},{"key":"48_CR16","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: 14th IJCAI, Montreal, Canada, pp. 607\u2013615 (August 1995)"},{"key":"48_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-34188-5_8","volume-title":"Hardware and Software: Verification and Testing","author":"M. Heule","year":"2012","unstructured":"Heule, M., Kullmann, O., Wieringa, S., Biere, A.: Cube and conquer: Guiding cdcl sat solvers by lookaheads. In: Eder, K., Louren\u00e7o, J., Shehory, O. (eds.) HVC 2011. LNCS, vol.\u00a07261, pp. 50\u201365. Springer, Heidelberg (2012)"},{"key":"48_CR18","unstructured":"IBM ILOG. IBM ILOG CPLEX Optimization Studio 12.6 (2013)"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Sabharwal, A., Samulowitz, H., Simon, L.: Resolution and parallelizability: Barriers to the efficient parallelization of sat solvers. In: 27th AAAI (2013)","DOI":"10.1609\/aaai.v27i1.8660"},{"key":"48_CR20","doi-asserted-by":"crossref","unstructured":"Kumar, S., Mamidala, A.R., Faraj, D., Smith, B., Blocksome, M., Cernohous, B., Miller, D., Parker, J., Ratterman, J., Heidelberger, P., Chen, D., Steinmacher-Burrow, B.: PAMI: A parallel active message interface for the Blue Gene\/Q supercomputer. In: IPDPS-2012: 26th IEEE International Parallel & Distributed Processing Symposium, pp. 763\u2013773 (2012)","DOI":"10.1109\/IPDPS.2012.73"},{"issue":"3","key":"48_CR21","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/ijoc.1080.0313","volume":"21","author":"L. Michel","year":"2009","unstructured":"Michel, L., See, A., Hentenryck, P.V.: Transparent parallelization of constraint programming. INFORMS Journal on Computing\u00a021(3), 363\u2013382 (2009)","journal-title":"INFORMS Journal on Computing"},{"key":"48_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-40627-0_6","volume-title":"Principles and Practice of Constraint Programming","author":"T. Moisan","year":"2013","unstructured":"Moisan, T., Gaudreault, J., Quimper, C.-G.: Parallel discrepancy-based search. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 30\u201346. Springer, Heidelberg (2013)"},{"key":"48_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-319-07046-9_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"T. Moisan","year":"2014","unstructured":"Moisan, T., Quimper, C.-G., Gaudreault, J.: Parallel depth-bounded discrepancy search. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol.\u00a08451, pp. 377\u2013393. Springer, Heidelberg (2014)"},{"key":"48_CR24","unstructured":"Plaza, S.M., Markov, I.L., Bertacco, V.: Low-latency sat solving on multicore processors with priority scheduling and xor partitioning. In: International Workshop on Logic Synthesis (IWLS) (2008)"},{"key":"48_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-40627-0_45","volume-title":"Principles and Practice of Constraint Programming","author":"J.-C. R\u00e9gin","year":"2013","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 596\u2013610. Springer, Heidelberg (2013)"},{"key":"48_CR26","doi-asserted-by":"crossref","unstructured":"Rolf, C.C., Kuchcinski, K.: Load-balancing methods for parallel and distributed constraint solving. In: IEEE Conf. on Cluster Computing, pp. 304\u2013309 (September 2008)","DOI":"10.1109\/CLUSTR.2008.4663786"},{"key":"48_CR27","doi-asserted-by":"crossref","unstructured":"Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP \u2013 a parallel extension of SCIP. In: Competence in High Performance Computing 2010, pp. 135\u2013148. Springer (February 2012)","DOI":"10.1007\/978-3-642-24025-6_12"},{"key":"48_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-13520-0_3","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P.J. Stuckey","year":"2010","unstructured":"Stuckey, P.J.: Lazy clause generation: Combining the power of SAT and CP (and MIP?) solving. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 5\u20139. Springer, Heidelberg (2010)"},{"issue":"3","key":"48_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"L.G. Valiant","year":"1986","unstructured":"Valiant, L.G., Vazirani, V.V.: NP is as easy as detecting unique solutions. Theoretical Comput. Sci.\u00a047(3), 85\u201393 (1986)","journal-title":"Theoretical Comput. Sci."},{"key":"48_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-31612-8_42","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"P. Tak van der","year":"2012","unstructured":"van der Tak, P., Heule, M., Biere, A.: Concurrent cube-and-conquer - (poster presentation). In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol.\u00a07317, pp. 475\u2013476. Springer, Heidelberg (2012)"},{"issue":"4","key":"48_CR31","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.\u00a0Symb. Comput.\u00a021(4), 543\u2013560 (1996)","journal-title":"J.\u00a0Symb. Comput."},{"key":"48_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24605-3_22","volume-title":"Theory and Applications of Satisfiability Testing","author":"L. Zhang","year":"2004","unstructured":"Zhang, L., Malik, S.: Cache performance of SAT solvers: a case study for efficient implementation of algorithms. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 287\u2013298. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-10428-7_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T22:29:54Z","timestamp":1689460194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}