{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:24:34Z","timestamp":1743265474909},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666264"},{"type":"electronic","value":"9783540480853"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48085-3_31","type":"book-chapter","created":{"date-parts":[[2010,12,16]],"date-time":"2010-12-16T22:25:21Z","timestamp":1292538321000},"page":"434-445","source":"Crossref","is-referenced-by-count":4,"title":["Solving Satisfiability Problems on FPGAs Using Experimental Unit Propagation"],"prefix":"10.1007","author":[{"given":"Takayuki","family":"Suyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Nagoya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Abramovici, M., Saab, D.: Satisfiablilty on Reconfigurable Hardware. In: International Workshop on Field Programmable Logic and Applications, pp. 448\u2013456 (1997)","DOI":"10.1007\/3-540-63465-7_250"},{"key":"31_CR2","unstructured":"Asahiro, Y., Iwama, K., Miyano, E.: Random generation of test instances with controlled attributes. In: Proceedings of the DIMACS Challenge II Workshop (1993)"},{"key":"31_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3572-0","volume-title":"Field-Programmable Gate Arrays","author":"S.D. Brown","year":"1992","unstructured":"Brown, S.D., Francis, R.J., Rose, J., Vranesic, Z.G.: Field-Programmable Gate Arrays. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"31_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3966-7","volume-title":"High-level VLSI synthesis","author":"R. Camposano","year":"1991","unstructured":"Camposano, R., Wolf, W.: High-level VLSI synthesis. Kluwer Academic, Dordrecht (1991)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM\u00a07, 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"31_CR6","unstructured":"Dubois, O., Andre, P., Boufkhad, Y., Carlier, J.: Can a very simple algorithm be efficient for solving the SAT problem? In: Proc. of the DIMACS Challenge II Workshop (1993)"},{"key":"31_CR7","unstructured":"Freeman, J.W.: Improvements to propositional satisfiability search algorithms, PhD thesis, the University of Pennsylvania (1995)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Merceron, D.: Reconfigurable Architectures: A New Vision for Optimizing Problem. In: Proc. of Third International Conference on Principles and Practice on Constraint Programming (CP 1997), pp. 209\u2013221 (1997)","DOI":"10.1007\/BFb0017441"},{"key":"31_CR9","unstructured":"Li, C.M., Anbulagan: Heuristics Based on Unit propagation for Satisfiability Problems. In: Proc. of 15th International Joint Conference on Artificial Intelligence, pp. 366\u2013371 (1997)"},{"key":"31_CR10","volume-title":"Encyclopedia of Artificial Intelligence","author":"A.K. Mackworth","year":"1992","unstructured":"Mackworth, A.K.: Encyclopedia of Artificial Intelligence. Wiley-Interscience Publication, Hoboken (1992)"},{"key":"31_CR11","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problem. In: Proc. of the Tenth National Conference on Artificial Intelligence, pp. 459\u2013465 (1992)"},{"key":"31_CR12","unstructured":"Nakamura, Y., Oguri, K., Nagoya, A., Yukishita, M., Nomura, R.: High-level synthesis design at NTT systems labs. In: IEICE Trans. Inf & Syst., E76-D(9), pp. 1047\u20131054 (1993)"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Rashid, A., Leonard, J., Mangione-Smith, W.H.: Dynamic Circuit Generation for Solving Specific Problem Instances of Boolean Satisfiability. In: Proc. of IEEE Symposium on Field-Programmable Custom Computing Machines, pp. 196\u2013204 (1998)","DOI":"10.1109\/FPGA.1998.707897"},{"issue":"1","key":"31_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence\u00a032(1), 57\u201395 (1987)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"31_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0004-3702(89)90008-8","volume":"41","author":"R. Reiter","year":"1989","unstructured":"Reiter, R., Mackworth, A.: A logical framework for depiction and image interpretation. Artificial Intelligence\u00a041(2), 125\u2013155 (1989)","journal-title":"Artificial Intelligence"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Suyama, T., Yokoo, M., Sawada, H.: Solving Satisfiability Problems Using Logic Synthesis and Reconfigurable Hardware. In: Proc. of the 31st Annual Hawaii International Conference on System Sciences, vol.\u00a0VII, pp. 179\u2013186 (1998)","DOI":"10.1109\/HICSS.1998.649212"},{"key":"31_CR17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/3-540-61551-2_96","volume-title":"Proc. of the Second International Conference on Principles and Practice of Constraint Programming","author":"M. Yokoo","year":"1996","unstructured":"Yokoo, M., Suyama, T., Sawada, H.: Solving satisfiability problems using field programmable gate arrays: First results. In: Proc. of the Second International Conference on Principles and Practice of Constraint Programming, pp. 497\u2013509. Springer, Heidelberg (1996)"},{"key":"31_CR18","unstructured":"Zhong, P., Martonosi, M., Ashar, P., Malik, S.: Accelerating Boolean Satisfiability with Configurable Hardware. In: Proc. of Symposium on Field-Programmable Custom Computing Machines, pp. 186\u2013195 (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48085-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T20:15:47Z","timestamp":1553285747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48085-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666264","9783540480853"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48085-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}