{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:16:33Z","timestamp":1743056193977,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408222"},{"type":"electronic","value":"9783540452348"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45234-8_46","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T06:12:05Z","timestamp":1294467125000},"page":"468-477","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Reconfigurable Hardware SAT Solvers: A Survey of Systems"],"prefix":"10.1007","author":[{"given":"Iouliia","family":"Skliarova","sequence":"first","affiliation":[]},{"given":"Ant\u00f3nio B.","family":"Ferrari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,9,30]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Estrin, G.: Reconfigurable Computer Origins: The UCLA Fixed-Plus-Variable (F+V) Structure Computer. IEEE Annals of the History of Computing, 3\u20139 (October-December 2002)","DOI":"10.1109\/MAHC.2002.1114865"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the Satisfiability (SAT) Problem: A Survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, pp. 19\u2013151 (1997)","DOI":"10.1090\/dimacs\/035\/02"},{"key":"46_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman and Company, San Francisco (1979)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Yokoo, M., Suyama, T., Sawada, H.: Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results. In: Proc. of 2nd Int. Conf. on Principles and Practice of Constraint Programming, pp. 497\u2013509 (1996)","DOI":"10.1007\/3-540-61551-2_96"},{"issue":"1","key":"46_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/92.920826","volume":"9","author":"T. Suyama","year":"2001","unstructured":"Suyama, T., Yokoo, M., Sawada, H., Nagoya, A.: Solving Satisfiability Problems Using Reconfigurable Computing. IEEE Trans. on VLSI Systems\u00a09(1), 109\u2013116 (2001)","journal-title":"IEEE Trans. on VLSI Systems"},{"key":"46_CR6","unstructured":"Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D. dissertation. Univ. Pennsylvania (1995)"},{"key":"46_CR7","unstructured":"DIMACS challenge benchmarks [online], Available: http:\/\/www.intellektik.informatik.tudarmstadt.de\/SATLIB\/bencm.html"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM\u00a0(5), 394\u2013397 (1962)","DOI":"10.1145\/368273.368557"},{"issue":"6","key":"46_CR9","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/43.766733","volume":"18","author":"P. Zhong","year":"1999","unstructured":"Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Using Configurable Computing to Accelerate Boolean Satisfiability. IEEE Trans. CAD of Integrated Circuits and Systems\u00a018(6), 861\u2013868 (1999)","journal-title":"IEEE Trans. CAD of Integrated Circuits and Systems"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Zhong, P., Ashar, P., Malik, S., Martonosi, M.: Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability. In: Proc. Design Automation Conf., pp. 194\u2013199 (1998)","DOI":"10.1145\/277044.277098"},{"key":"46_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/BFb0055260","volume-title":"Field-Programmable Logic and Applications. From FPGAs to Computing Paradigm","author":"P. Zhong","year":"1998","unstructured":"Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Solving Boolean satisfiability with dynamic hardware configurations. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol.\u00a01482, pp. 326\u2013335. Springer, Heidelberg (1998)"},{"key":"46_CR12","unstructured":"Zhong, P.: Using Configurable Computing to Accelerate Boolean Satisfiability. Ph.D. dissertation. Department of Electrical Engineering. Princeton University (1999)"},{"issue":"5","key":"46_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"L.M. Silva","year":"1999","unstructured":"Silva, L.M., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Computers, vol.\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Computers, vol."},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Abramovici, M., Saab, D.: Satisfiability on Reconfigurable Hardware. In: Proc. 7th Int. Workshop on Field-Programmable Logic and Applications, pp. 448\u2013456 (1997)","DOI":"10.1007\/3-540-63465-7_250"},{"issue":"1-2","key":"46_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1006310219368","volume":"24","author":"M. Abramovici","year":"2000","unstructured":"Abramovici, M., de Sousa, J.T.: A SAT solver using reconfigurable hardware and virtual logic. Journal of Automated Reasoning\u00a024(1-2), 5\u201336 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Platzner, M.: Reconfigurable accelerators for combinatorial problems. IEEE Computer, 58\u201360 (April 2000)","DOI":"10.1109\/2.839322"},{"key":"46_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BFb0055234","volume-title":"Field-Programmable Logic and Applications. From FPGAs to Computing Paradigm","author":"M. Platzner","year":"1998","unstructured":"Platzner, M., De Micheli, G.: Acceleration of satisfiability algorithms by reconfigurable hardware. In: Hartenstein, R.W., Keevallik, A. (eds.) FPL 1998. LNCS, vol.\u00a01482, pp. 69\u201378. Springer, Heidelberg (1998)"},{"key":"46_CR18","unstructured":"Boyd, M., Larrabee, T.: ELVIS \u2013 a scalable, loadable custom programmable logic device for solving Boolean satisfiability problems. In: Proc. 8th IEEE Int. Symp. on Field-Programmable Custom Computing Machines - FCCM (2000)"},{"key":"46_CR19","unstructured":"de Sousa, J., Marques-Silva, J.P., Abramovici, M.: A configware\/software approach to SAT solving. In: Proc. of 9th IEEE Int. Symp. on Field-Programmable Custom Computing Machines (2001)"},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Reis, N.A., de Sousa, J.T.: On Implementing a Configware\/Software SAT Solver. In: Proc. of 10th IEEE Int. Symp. Field-Programmable Custom Computing Machines, pp. 282\u2013283 (2002)","DOI":"10.1109\/FPGA.2002.1106685"},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Skliarova, I., Ferrari, A.B.: A SAT Solver Using Software and Reconfigurable Hardware. In: Proc. of the Design, Automation and Test in Europe Conference, p. 1094 (2002)","DOI":"10.1109\/DATE.2002.998450"},{"key":"46_CR22","unstructured":"Skliarova, I., Ferrari, A.B.: A hardware\/software approach to accelerate Boolean satisfiability. In: Proc. of IEEE Design and Diagnostics of Electronic Circuits and Systems Workshop, pp. 270\u2013277 (2002)"},{"key":"46_CR23","unstructured":"Simon, L., Le Berre, D., Hirsch, E.: The SAT 2002 Competition. Technical Report (2002) (preliminary draft) [Online]. Available: http:\/\/www.satlive.org\/SATCompetition\/onlinereport.pdf"},{"key":"46_CR24","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of the 38th Design Automation Conference, pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"46_CR25","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: BerkMin: a Fast and Robust SAT-solver. In: Proc. Design, Automation and Test in Europe Conference, pp.142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"}],"container-title":["Lecture Notes in Computer Science","Field Programmable Logic and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45234-8_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:56:45Z","timestamp":1740841005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45234-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408222","9783540452348"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45234-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"30 September 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}