{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:46:21Z","timestamp":1725511581468},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540795605"},{"type":"electronic","value":"9783540795612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-79561-2_13","type":"book-chapter","created":{"date-parts":[[2008,4,30]],"date-time":"2008-04-30T12:31:41Z","timestamp":1209558701000},"page":"146-157","source":"Crossref","is-referenced-by-count":3,"title":["On Multi-threaded Satisfiability Solving with OpenMP"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Vander-Swalmen","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Dequen","sequence":"additional","affiliation":[]},{"given":"Micha\u00ebl","family":"Krajecki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem Proving Procedures. In: 3rd ACM Symp. on Theory of Computing, Ohio, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A. Braunstein","year":"2005","unstructured":"Braunstein, A., M\u00e9zard, M., Zecchina, R.: Survey propagation: An algorithm for satisfiability. Random Struct. Algorithms\u00a027(2), 201\u2013226 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"13_CR3","unstructured":"Kautz, H., Selman, B.: Pushing the Envelope: Planning, Propositional Logic and Stochastic Search. In: Proc. of the 30th National Conf. on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conf., Menlo Park, August 4\u20138, 1996, pp. 1194\u20131201. AAAI Press \/ MIT Press (1996)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear encodings of bounded LTL model checking. Logical Methods in Computer Science\u00a02 (2006)","DOI":"10.2168\/LMCS-2(5:5)2006"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/TVLSI.2007.893665","volume":"15","author":"N.R. Potlapally","year":"2007","unstructured":"Potlapally, N.R., Raghunathan, A., Ravi, S., Jha, N.K., Lee, R.B.: Aiding side-channel attacks on cryptographic software with satisfiability-based analysis. IEEE Trans. VLSI Syst.\u00a015(4), 465\u2013470 (2007)","journal-title":"IEEE Trans. VLSI Syst."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A Machine Program for Theorem-Proving. Journal Association for Computing Machine\u00a0(5), 394\u2013397 (1962)","DOI":"10.1145\/368273.368557"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Winter, J.: Effective preprocessing with hyper-resolution and equality reduction (2003)","DOI":"10.1007\/978-3-540-24605-3_26"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In: Proc. of ICCAD, San Jose (November 2001) (to appear)","DOI":"10.1145\/774572.774637"},{"issue":"2\/3\/4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1504\/IJCSE.2005.009703","volume":"1","author":"Z. Habbas","year":"2005","unstructured":"Habbas, Z., Krajecki, M., Singer, D.: Decomposition techniques for parallel resolution of constraint satisfaction problems in shared memory: a comparative study. Intern. Journal of Computational Science and Engineering (IJCSE)\u00a01(2\/3\/4), 192\u2013206 (2005)","journal-title":"Intern. Journal of Computational Science and Engineering (IJCSE)"},{"key":"13_CR10","volume-title":"Stochastic Local Search : Foundations & Applications (The Morgan Kaufmann Series in Artificial Intelligence)","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations & Applications (The Morgan Kaufmann Series in Artificial Intelligence). Morgan Kaufmann, San Francisco (2004)"},{"issue":"4","key":"13_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10817-006-9025-2","volume":"37","author":"G. Dequen","year":"2006","unstructured":"Dequen, G., Dubois, O.: An efficient approach to solving random -satproblems. J. Autom. Reasoning\u00a037(4), 261\u2013276 (2006)","journal-title":"J. Autom. Reasoning"},{"issue":"4-6","key":"13_CR12","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-6), 543\u2013560 (1996)","journal-title":"J. Symb. Comput."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Jurkowiak, B., Li, C.M., Utard, G.: Parallelizing Satz Using Dynamic Workload Balancing. In: Proc. of Workshop on Theory and Application of Satisfiability Testing (Sat 2001), Boston, June 2001, pp. 205\u2013211 (2001)","DOI":"10.1016\/S1571-0653(04)00321-X"},{"key":"13_CR14","first-page":"459","volume-title":"Proc. 10th Nat. Conf. on Artificial Intelligence","author":"D. Mitchell","year":"1992","unstructured":"Mitchell, D., Selman, B., Levesque, H.J.: Hard and easy distribution of SAT problems. In: Proc. 10th Nat. Conf. on Artificial Intelligence, pp. 459\u2013465. AAAI, Menlo Park (1992)"},{"key":"13_CR15","first-page":"926","volume-title":"ASP-DAC 2007: Proceedings of the 2007 conference on Asia South Pacific design automation","author":"M. Lewis","year":"2007","unstructured":"Lewis, M., Schubert, T., Becker, B.: Multithreaded sat solving. In: ASP-DAC 2007: Proceedings of the 2007 conference on Asia South Pacific design automation, Washington, DC, USA, pp. 926\u2013931. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Feldman, Y., Dershowitz, N., Hanna, Z.: Parallel multithreaded satisfiability solver: Design and implementation (2004)","DOI":"10.1016\/j.entcs.2004.10.020"},{"key":"13_CR17","first-page":"220","volume-title":"ICCAD 1996: Proc. of the 1996 IEEE\/ACM Intern. Conf. on Computer-aided design","author":"J.P.M. Silva","year":"1996","unstructured":"Silva, J.P.M., Sakallah, K.A.: Grasp a new search algorithm for satisfiability. In: ICCAD 1996: Proc. of the 1996 IEEE\/ACM Intern. Conf. on Computer-aided design, Washington, DC, USA, pp. 220\u2013227. IEEE Computer Society, Los Alamitos (1996)"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10723-006-9042-8","volume":"4","author":"W. Chrabakh","year":"2006","unstructured":"Chrabakh, W., Wolski, R.: Gridsat: Design and implementation of a computational grid application. J. Grid Comput.\u00a04(2), 177\u2013193 (2006)","journal-title":"J. Grid Comput."},{"key":"13_CR19","unstructured":"Singer, D., Monnet, A.: JaCk-SAT: A New Parallel Scheme to Solve the Satisfiability Problem (SAT) based on Join-and-Check. In: Proc of Parallel Processing and Applied Mathematics, Gdansk (2007)"},{"key":"13_CR20","unstructured":"Jaillet, C., Krajecki, M.: Parallel programming with openmp: a new memory allocation model avoiding cache faults. In: Intern. Workshop on OpenMP 2007 (IWOMP2007). Tsinghua University, Beijing, China (June 2007)"}],"container-title":["Lecture Notes in Computer Science","OpenMP in a New Era of Parallelism"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79561-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:35:31Z","timestamp":1684370131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79561-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540795605","9783540795612"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79561-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}