{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:37:35Z","timestamp":1737178655579,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734437"},{"type":"electronic","value":"9783540734451"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73445-1_26","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T06:32:08Z","timestamp":1183444328000},"page":"352-361","source":"Crossref","is-referenced-by-count":6,"title":["Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Villagra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjam\u00edn","family":"Bar\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem proving procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, Shaker Heights, Ohio, pp. 151\u2013156 (1971)","DOI":"10.1145\/800157.805047"},{"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. Journal of the ACM\u00a07(3), 201\u2013215 (1960)","journal-title":"Journal of the ACM"},{"key":"26_CR3","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. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"issue":"2","key":"26_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"M. Prasad","year":"2005","unstructured":"Prasad, M., Biere, A., Gupta, A.: A survey of recent advances in SAT-based formal verification. Software Tools for Technology Transfer\u00a07(2), 156\u2013173 (2005)","journal-title":"Software Tools for Technology Transfer"},{"key":"26_CR5","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI\u201994. vol. 1, pp. 337\u2013343 (1994)"},{"issue":"1","key":"26_CR6","first-page":"1","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics\u00a026(1), 1\u201313 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"issue":"8","key":"26_CR7","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: $\\mathcal{MAX-MIN}$ ant system. Future Generation Computer Systems\u00a016(8), 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"26_CR8","unstructured":"St\u00fctzle, T., Hoos, H., Roli, A.: A review of the literature on local search algorithms for MAX-SAT. Technical Report AIDA-01-02, Technische Universit\u00e4t Darmstadt (2006)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Schoofs, L., Naudts, B.: Ant colonies are good at solving constraint satisfaction problems. In: Proceedings of the 2000 Congress on Evolutionary Computation. vol.\u00a02, pp. 1190\u20131195 (2000)","DOI":"10.1109\/CEC.2000.870784"},{"key":"26_CR10","unstructured":"Pimont, S., Solnon, C.: A generic ant algorithm for solving constraint satisfaction problems. In: Proceedings of ANTS 2000 (2000)"},{"issue":"4","key":"26_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TEVC.2002.802449","volume":"6","author":"C. Solnon","year":"2002","unstructured":"Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation\u00a06(4), 347\u2013357 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"26_CR12","unstructured":"Roli, A.: Metaheuristics and Structure in Satisfiability Problems. PhD thesis, Facolt\u00e0 de Ingegneria, Universit\u00e0 degli Studi di Bologna (2003)"},{"issue":"1","key":"26_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evolutionary Computation"},{"issue":"1","key":"26_CR14","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1162\/106365602317301763","volume":"10","author":"J. Gottlieb","year":"2002","unstructured":"Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary algorithms for the satisfiability problem. Evolutionary Computation\u00a010(1), 35\u201350 (2002)","journal-title":"Evolutionary Computation"},{"key":"26_CR15","first-page":"785","volume-title":"PPSN V","author":"S. Rana","year":"1998","unstructured":"Rana, S., Whitley, D.: Genetic algorithm behavior in the maxsat domain. In: PPSN V. Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, pp. 785\u2013794. Springer, Heidelberg (1998)"},{"key":"26_CR16","first-page":"115","volume":"2","author":"G. Tseitin","year":"1968","unstructured":"Tseitin, G.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic\u00a02, 115\u2013125 (1968)","journal-title":"Studies in Constructive Mathematics and Mathematical Logic"},{"key":"26_CR17","volume-title":"Computers and Intractability: a Guide to the Theory of $\\mathcal{NP}$ -completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: a Guide to the Theory of $\\mathcal{NP}$ -completeness. W.H. Freeman & Company, San Francisco, California (1979)"},{"key":"26_CR18","first-page":"331","volume-title":"Proceedings of IJCAI\u201991","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman, P., Kanelfy, B., Taylor, W.: Where the really hard problems are. In: Proceedings of IJCAI\u201991, San Mateo, California, pp. 331\u2013337. Morgan Kaufmann, San Francisco (1991)"},{"key":"26_CR19","unstructured":"Crawford, J., Auton, L.: Experimental results on the crossover point in satisfiability problems. In: Proceedings of the 11th National Conference on Artificial Intelligence (1993)"},{"key":"26_CR20","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (2003)","edition":"2"},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/ICEC.1997.592273","volume-title":"Proceedings of the 4th IEEE Conference on Evolutionary Computation","author":"A. Eiben","year":"1997","unstructured":"Eiben, A., van der Hauw, J.: Solving 3-SAT with adaptive genetic algorithms. In: Eiben, A. (ed.) Proceedings of the 4th IEEE Conference on Evolutionary Computation, Piscataway, pp. 81\u201386. IEEE Press, New Jersey, USA (1997)"},{"key":"26_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0026590","volume-title":"Artificial Evolution","author":"J. Gottlieb","year":"1998","unstructured":"Gottlieb, J., Voss, N.: Representations, fitness functions and genetic operators for the satisfiability problem. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol.\u00a01363, pp. 53\u201368. Springer, Heidelberg (1998)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1007\/3-540-45356-3_61","volume-title":"Parallel Problem Solving from Nature-PPSN VI","author":"J. Gottlieb","year":"2000","unstructured":"Gottlieb, J., Voss, N.: Adaptive fitness functions for the satisfiability problem. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) Parallel Problem Solving from Nature-PPSN VI. LNCS, vol.\u00a01917, pp. 621\u2013630. Springer, Heidelberg (2000)"},{"key":"26_CR24","volume-title":"Proceedings of the SAT 2000","author":"H. Hoos","year":"2000","unstructured":"Hoos, H., St\u00fctzle, T.: An online resource for research on SAT. In: Gent, P., Maaren, H., Walsh, T. (eds.) Proceedings of the SAT 2000, IOS Press, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73445-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T03:40:14Z","timestamp":1737171614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73445-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540734437","9783540734451"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73445-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}