{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:20Z","timestamp":1760170400568,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428633"},{"type":"electronic","value":"9783540455783"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45578-7_10","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T06:34:25Z","timestamp":1180334065000},"page":"137-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Capturing Structure with Satisfiability"],"prefix":"10.1007","author":[{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"first","affiliation":[]},{"given":"Alba","family":"Cabiscol","sequence":"additional","affiliation":[]},{"given":"C\u00e8sar","family":"Fern\u00e0ndez","sequence":"additional","affiliation":[]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[]},{"given":"Carla","family":"Gomes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"unstructured":"D. Achlioptas, C. P. Gomes, H. Kautz, and B. Selman. Generating satisfiable problem instances. In Proc. of AAAI-2000, pages 256\u2013261, 2000.","key":"10_CR1"},{"unstructured":"R. J. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve realworldSA T instances. In Proc. of AAAI\u201997, pages 203\u2013208, 1997.","key":"10_CR2"},{"doi-asserted-by":"crossref","unstructured":"B. Beckert, R. H\u00e4hnle and F. Many\u00e0. The SAT problem of signedCNF formulas. In Labelled Deduction, pages 61\u201382, Kluwer, 2000.","key":"10_CR3","DOI":"10.1007\/978-94-011-4040-9_3"},{"unstructured":"R. B\u00e9jar. Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Aut\u00f2noma de Barcelona, 2000.","key":"10_CR4"},{"doi-asserted-by":"crossref","unstructured":"R. B\u00e9jar and F. Many\u00e0. Phase transitions in the regular random 3-SAT problem. In Proc. of ISMIS\u201999, pages 292\u2013300. LNAI 1609, 1999.","key":"10_CR5","DOI":"10.1007\/BFb0095115"},{"doi-asserted-by":"crossref","unstructured":"R. B\u00e9jar and F. Many\u00e0. A comparison of systematic andlo cal search algorithms for regular CNF formulas. In Proc. of ECSQARU\u201999, pages 22\u201331. LNAI 1638, 1999.","key":"10_CR6","DOI":"10.1007\/3-540-48747-6_3"},{"doi-asserted-by":"crossref","unstructured":"R. B\u00e9jar and F. Many\u00e0. Solving combinatorial problems with regular local search algorithms. In Proc. of LPAR\u201999, pages 33\u201343. LNAI 1705, 1999.","key":"10_CR7","DOI":"10.1007\/3-540-48242-3_3"},{"doi-asserted-by":"crossref","unstructured":"J. C. Culberson and F. Luo. Exploring the k-colorable landscape with iterated greedy. In Cliques, Coloring and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1996.","key":"10_CR8","DOI":"10.1090\/dimacs\/026\/13"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394\u2013397, 1962.","journal-title":"Communications of the ACM"},{"unstructured":"A. M. Frisch and T. J. Peugniez. Solving non-Boolean satisfiability problems with stochastic local search. In Proc. of IJCAI\u201901, pages 282\u2013288, 2001.","key":"10_CR10"},{"unstructured":"C. Gomes, H. Kautz, and Y. Ruan. QWH-A structuredb enchmark domain for local search. Technical Report, Intelligent Information Systems Institute (IISI), Cornell University, 2001.","key":"10_CR11"},{"key":"10_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0017434","volume-title":"Heavy-tailedd istributions in combinatorial search","author":"C. Gomes","year":"1997","unstructured":"C. Gomes, B. Selman, and N. Crato. Heavy-tailedd istributions in combinatorial search. In Proc. of CP\u201997, pages 121\u2013135. Springer LNCS 1330, 1997."},{"unstructured":"C. P. Gomes and B. Selman. Problem structure in the presence of perturbations. In Proc. of AAAI\u201997, pages 221\u2013226, 1997.","key":"10_CR13"},{"issue":"6","key":"10_CR14","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1093\/logcom\/4.6.905","volume":"4","author":"R. H\u00e4hnle","year":"1994","unstructured":"R. H\u00e4hnle. Short conjunctive normal forms in finitely-valuedlogics. Journal of Logic and Computation, 4(6):905\u2013927, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1080\/11663081.1996.10510866","volume":"6","author":"R. H\u00e4hnle","year":"1996","unstructured":"R. H\u00e4hnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49\u201369, 1996.","journal-title":"Journal of Applied Non-Classical Logics"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H. Hoos","year":"2000","unstructured":"H. Hoos and T. St\u00fctzle. Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning, 24(4):421\u2013481, 2000.","journal-title":"Journal of Automated Reasoning"},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","first-page":"341","volume-title":"Look-aheadv ersus look-back for satisfiability problems","author":"C.M. Li","year":"1997","unstructured":"C. M. Li and Anbulagan. Look-aheadv ersus look-back for satisfiability problems. In Proc. of CP\u201997, pages 341\u2013355. LNCS 1330, 1997."},{"issue":"4","key":"10_CR18","first-page":"307","volume":"5","author":"F. Many\u00e0","year":"2000","unstructured":"F. Many\u00e0. The 2-SAT problem in signedCNF formulas. Multiple-Valued Logic. An International Journal, 5(4):307\u2013325, 2000.","journal-title":"Multiple-Valued Logic. An International Journal"},{"unstructured":"K. McAloon, C. Tretko., and G. Wetzel. Sports league scheduling. In Proc. of ILOG International Users Meeting, 1997.","key":"10_CR19"},{"doi-asserted-by":"crossref","unstructured":"R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic \u2018phase transitions\u2019. Nature, 400(8), 1999.","key":"10_CR20","DOI":"10.1038\/22055"},{"unstructured":"J.-C. R\u00e9gin. A filtering algorithm for constraints of difference in CSPs. In Proc. of AAAI\u201994, pages 362\u2013367, 1994.","key":"10_CR21"},{"unstructured":"B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. of AAAI\u201994, pages 337\u2013343, 1994.","key":"10_CR22"},{"unstructured":"K. Stergiou and T. Walsh. The difference all-difference makes. In Proc. of IJCAI\u2019 99, 1999.","key":"10_CR23"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP 2001"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45578-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:07:32Z","timestamp":1585602452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45578-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428633","9783540455783"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45578-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}