{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T01:10:22Z","timestamp":1737508222417,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540661313"},{"type":"electronic","value":"9783540487470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48747-6_3","type":"book-chapter","created":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T04:14:36Z","timestamp":1193717676000},"page":"22-31","source":"Crossref","is-referenced-by-count":8,"title":["A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas"],"prefix":"10.1007","author":[{"given":"Ram\u00f3n","family":"B\u00e9jar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felip","family":"Many\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,20]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"R. B\u00e9jar and F. Many\u00e0. Phase transitions in the regular random 3-SAT problem. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS\u201999, pages 292\u2013300. Springer LNAI 1609, 1999.","DOI":"10.1007\/BFb0095115"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"R. H\u00e4hnle. Uniform notation of tableaux rules for multiple-valued logics. In Proceedings International Symposium on Multiple-Valued Logic, Victoria, pages 238\u2013245. IEEE Press, 1991.","DOI":"10.1109\/ISMVL.1991.130736"},{"issue":"6","key":"3_CR3","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 infinitely-valued logics. Journal of Logic and Computation, 4(6):905\u2013927, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"3_CR4","doi-asserted-by":"crossref","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"},{"key":"3_CR5","unstructured":"R. H\u00e4hnle. Personal communication, 1998."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00881805","volume":"15","author":"J. N. Hooker","year":"1995","unstructured":"J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359\u2013383, 1995.","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"3_CR7","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/s005000050042","volume":"2","author":"F. Many\u00e0","year":"1998","unstructured":"F. Many\u00e0 R. B\u00e9jar, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3):116\u2013123, 1998.","journal-title":"Soft Computing: A Fusion of Foundations, Methodologies and Applications"},{"key":"3_CR8","unstructured":"D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI\u201997, Providence\/RI, USA, pages 321\u2013326, 1997."},{"key":"3_CR9","unstructured":"B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI\u201994, Seattle\/WA, USA, pages 337\u2013343, 1994."},{"key":"3_CR10","unstructured":"B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI\u201992, San Jose\/CA, USA, pages 440\u2013446, 1992."}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning and Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48747-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T00:40:12Z","timestamp":1737506412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48747-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540661313","9783540487470"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48747-6_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}