{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:02:41Z","timestamp":1725667361579},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_26","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T10:13:04Z","timestamp":1331028784000},"page":"335-342","source":"Crossref","is-referenced-by-count":1,"title":["iSat: Structure Visualization for SAT Problems"],"prefix":"10.1007","author":[{"given":"Ezequiel","family":"Orbe","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Areces","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Infante-L\u00f3pez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"7","key":"26_CR1","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Comm. of the ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Comm. of the ACM"},{"issue":"3","key":"26_CR2","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. J. of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"J. of the ACM"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"26_CR4","unstructured":"Heule, M.: SmArT solving: Tools and techniques for satisfiability solvers. PhD thesis, TU Delft (2008)"},{"key":"26_CR5","first-page":"47","volume":"2","author":"M. Heule","year":"2006","unstructured":"Heule, M., van Maaren, H.: March_dl: Adding adaptive heuristics and a new branching strategy. J. on Sat., Boolean Modeling and Comp.\u00a02, 47\u201359 (2006)","journal-title":"J. on Sat., Boolean Modeling and Comp."},{"key":"26_CR6","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. of ECAI 1992. John Wiley and Sons, Inc. (1992)"},{"key":"26_CR7","unstructured":"Marques-Silva, J., Sakallah, K.: Robust search algorithms for test pattern generation. In: Proc. of the Fault-Tolerant Computing Symp. IEEE (1997)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conf. (2001)","DOI":"10.1145\/378239.379017"},{"key":"26_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H., Devkar, A., Shoham, Y.: Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11499107_19","volume-title":"Theory and Applications of Satisfiability Testing","author":"C. Sinz","year":"2005","unstructured":"Sinz, C., Dieringer, E.-M.: DPvis \u2013 A Tool to Visualize the Structure of SAT Instances. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 257\u2013268. Springer, Heidelberg (2005)"},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Soos, M.: CryptoMiniSat \u2014 a SAT solver for cryptographic problems (2009), \n                  \n                    http:\/\/www.msoos.org\/cryptominisat2","DOI":"10.1007\/978-3-642-02777-2_24"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28717-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:07:16Z","timestamp":1620112036000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}