{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:13:43Z","timestamp":1760170423941},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664925"},{"type":"electronic","value":"9783540482420"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48242-3_3","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:28:09Z","timestamp":1184588889000},"page":"33-43","source":"Crossref","is-referenced-by-count":6,"title":["Solving Combinatorial Problems with Regular Local Search Algorithms"],"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","reference":[{"key":"3_CR1","first-page":"248","volume-title":"Proc. International Symposium on Multiple-Valued Logics, ISMVL\u201999, Freiburg, Germany","author":"B. Beckert","year":"1999","unstructured":"B. Beckert, R. H\u00e4hnle, and F. Many\u00e0. Transformations between signed and classical clause logic. In Proc. International Symposium on Multiple-Valued Logics, ISMVL\u201999, Freiburg, Germany, pages 248\u2013255. IEEE Press, Los Alamitos, 1999."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"R. B\u00e9jar and F. Many\u00e0. A comparison of systematic and local search algorithms for regular CNF formulas. In Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU\u201999, London, England, pages 22\u201331. Springer LNAI 1638, 1999.","DOI":"10.1007\/3-540-48747-6_3"},{"key":"3_CR3","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, Warsaw, Poland, pages 292\u2013300. Springer LNAI 1609, 1999.","DOI":"10.1007\/BFb0095115"},{"key":"3_CR4","unstructured":"J. M. Crawford and A. B. Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI\u201994, Seattle, WA, USA, pages 1092\u20131097, 1994."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/ISMVL.1994.302194","volume-title":"Proceedings of the International Symposium on Multiple-Valued Logics, ISMVL\u201994, Boston, MA, USA","author":"G. Escalada-Imaz","year":"1994","unstructured":"G. Escalada-Imaz and F. Many\u00e0. The satisfiability problem for multiple-valued Horn formulae. In Proceedings of the International Symposium on Multiple-Valued Logics, ISMVL\u201994, Boston, MA, USA, pages 250\u2013256. IEEE Press, Los Alamitos, 1994."},{"key":"3_CR6","unstructured":"C. P. Gomes, B. Selman, K. McAloon, and C. Tretkoff. Randomization in backtrack search: Exploiting heavy-tailed profiles for solving hard scheduling problems. In Proceedings AIPS\u201998, Pittsburg, PA, USA, 1998."},{"issue":"6","key":"3_CR7","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-valued logics. Journal of Logic and Computation, 4(6):905\u2013927, 1994.","journal-title":"Journal of Logic and Computation"},{"key":"3_CR8","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"},{"issue":"2","key":"3_CR9","first-page":"69","volume":"4","author":"R. H\u00e4hnle","year":"1997","unstructured":"R. H\u00e4hnle and G. Escalada-Imaz. Deduction in many-valued logics: A survey. Mathware and Soft Computing, 4(2):69\u201397, 1997.","journal-title":"Mathware and Soft Computing"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D. S. Johnson","year":"1991","unstructured":"D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378\u2013406, 1991.","journal-title":"Operations Research"},{"key":"3_CR11","unstructured":"H. A. Kautz and B. Selman. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI\u201996, Portland, OR, USA, pages 1194\u20131201, 1996."},{"key":"3_CR12","unstructured":"F. Many\u00e0. The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic, An International Journal, 1999. In press."},{"issue":"3","key":"3_CR13","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_CR14","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_CR15","unstructured":"B. Selman and H. A. Kautz. Domain-independent extensions of GSAT: Solving large structured satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI\u201993, Chambery, France, pages 290\u2013295, 1993."},{"key":"3_CR16","unstructured":"B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI\u201994, Seattle, WA, USA, pages 337\u2013343, 1994."},{"key":"3_CR17","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","Logic for Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48242-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T20:12:28Z","timestamp":1550434348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48242-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664925","9783540482420"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48242-3_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}