{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:05:48Z","timestamp":1742918748982,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642018176"},{"type":"electronic","value":"9783642018183"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","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-01818-3_5","type":"book-chapter","created":{"date-parts":[[2009,5,14]],"date-time":"2009-05-14T15:40:43Z","timestamp":1242315643000},"page":"16-26","source":"Crossref","is-referenced-by-count":4,"title":["Generating Satisfiable SAT Instances Using Random Subgraph Isomorphism"],"prefix":"10.1007","author":[{"given":"C\u01celin","family":"Anton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lane","family":"Olson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of AAAI 2000, pp. 256\u2013261 (2000)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Clark, D.A., Frank, J., Gent, I.P., MacIntyre, E., Tomov, N., Walsh, T.: Local search and the number of solutions. In: Proceedings of CP 1996, pp. 119\u2013133 (1996)","DOI":"10.1007\/3-540-61551-2_70"},{"key":"5_CR3","unstructured":"Achlioptas, D., Jia, H., Moore, C.: Hiding satisfying assignments: Two are better than one. In: Proceedings of AAAI 2004, pp. 131\u2013136 (2004)"},{"key":"5_CR4","unstructured":"Xu, K., Boussemart, F., Hemery, F., Lecoutre, C.: A simple model to generate hard satisfiable instances. In: Proceedings of IJCAI 2005, pp. 337\u2013342 (2005)"},{"key":"5_CR5","unstructured":"The international sat competitions web page, http:\/\/www.satcompetition.org"},{"key":"5_CR6","unstructured":"Chieu, H.: Finite energy survey propagation for constraint satisfaction problems (2007); Singapore MIT Alliance Symposium 2007"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, E., Novikov, Y.: Berkmin: A fast and robust SAT-solver. In: Proceedings of DATE 2002, pp. 142\u2013149 (2002)","DOI":"10.1109\/DATE.2002.998262"},{"key":"5_CR8","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Minisat a sat solver with conflict-clause minimization. In: Proceedings of SAT 2005 (2005), http:\/\/minisat.se\/Papers.html"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/SAT190039","volume":"4","author":"A. Biere","year":"2008","unstructured":"Biere, A.: Picosat essentials. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 75\u201397 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"5_CR10","unstructured":"Pipatsrisawat, K., Darwiche, A.: Rsat 2.0: Sat solver description. Technical Report D\u2013153, Automated Reasoning Group, Computer Science Department, UCLA (2007)"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/SAT190016","volume":"2","author":"M.J.H. Heule","year":"2006","unstructured":"Heule, M.J.H., van Maaren, H.: March-dl: Adding adaptive heuristics and a new branching strategy. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 47\u201359 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-85958-1_21","volume-title":"Principles and Practice of Constraint Programming","author":"W. Wei","year":"2008","unstructured":"Wei, W., Li, C.M., Zhang, H.: Switching among non-weighting, clause weighting, and variable weighting in local search for sat. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 313\u2013326. Springer, Heidelberg (2008)"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/SAT190042","volume":"4","author":"D.N. Pham","year":"2008","unstructured":"Pham, D.N., Thornton, J., Gretton, C., Sattar, A.: Combining adaptive and dynamic local search for satisfiability. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 149\u2013172 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01818-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T12:17:06Z","timestamp":1739103426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01818-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642018176","9783642018183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01818-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}