{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:03:56Z","timestamp":1725483836248},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441205"},{"type":"electronic","value":"9783540461357"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46135-3_47","type":"book-chapter","created":{"date-parts":[[2007,5,15]],"date-time":"2007-05-15T01:59:47Z","timestamp":1179194387000},"page":"691-695","source":"Crossref","is-referenced-by-count":3,"title":["Improving GSAT Using 2SAT"],"prefix":"10.1007","author":[{"given":"Peter J.","family":"Stuckey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"47_CR1","unstructured":"Ronen I. Brafman. A simplifier for propositional formulas with many binary clauses. In Procs. of IJCAI-2001, pages 515\u2013522, 2001."},{"key":"47_CR2","unstructured":"B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Procs. of IJCAI-93, pages 290\u2013295, 1993."},{"key":"47_CR3","unstructured":"B. Selman, H. Levesque, and D. G. Mitchell. A new method for solving hard satisfiability problems. In Procs. of AAAI-92, pages 440\u2013446. AAAI Press\/MIT Press, 1992."},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"P. J. Stuckey and L. Zheng. Improving GSAT using 2SAT. Technical report, Department of Computer Science and Software Engineering, The University of Melbourne, 2002. http:\/\/www.cs.mu.oz.au\/~pjs\/papers\/gsatb.ps.gz","DOI":"10.1007\/3-540-46135-3_47"},{"key":"47_CR5","unstructured":"Z. Wu and B.W. Wah. An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems. In Procs. of AAAI-2000, pages 310\u2013315, 2000."},{"key":"47_CR6","unstructured":"L. Zheng and P. J. Stuckey. Improving SAT using 2SAT. In Pros. of ACSC-2002, pages 331\u2013340, Melbourne, 2002."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46135-3_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:25:30Z","timestamp":1556396730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46135-3_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441205","9783540461357"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-46135-3_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2002]]}}}