{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:23:14Z","timestamp":1648578194808},"reference-count":31,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1080\/09528130600906365","type":"journal-article","created":{"date-parts":[[2006,9,12]],"date-time":"2006-09-12T14:41:52Z","timestamp":1158072112000},"page":"365-386","source":"Crossref","is-referenced-by-count":3,"title":["Exploring the fitness landscape and the run-time behaviour of an iterated local search algorithm for cost-based abduction"],"prefix":"10.1080","volume":"18","author":[{"given":"Ashraf M.","family":"Abdelbar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah H.","family":"Gheita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heba A.","family":"Amer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00074-5"},{"key":"CIT0003","unstructured":"Abdelbar, AM and Amer, H. 2003. Applying guided evolutionary simulated annealing to cost-based abduction. Proceedings ofthe IEEE International Joint Conference on Neural Networks. 2003. Vol. 3, pp.2428\u20132431."},{"key":"CIT0007","first-page":"2635","volume":"4","author":"Abdelbar AM","year":"2003","journal-title":"Proceedings of the IEEE Congress on Evolutionary Computation"},{"key":"CIT0008","unstructured":"Charniak, E and Husain, S. 1991. A new admissible heuristic for minimal-cost proofs. Proceedings of the AAAI National Conference on Artificial Intelligence. 1991. pp.446\u2013451."},{"key":"CIT0009","unstructured":"Charniak, E and Shimony, SE. 1990. Probabilistic semantics for cost-based abduction. Proceedings of the AAAI National Conference on Artificial Intelligence. 1990. pp.106\u2013110."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90030-2"},{"key":"CIT0012","doi-asserted-by":"crossref","unstructured":"Den, Y. 1994. Generalized chart algorithm: An efficient procedure for cost-based abduction. Proceedings of the Meeting of the Association for Computational Linguistics. 1994. pp.218\u2013224.","DOI":"10.3115\/981732.981762"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_7"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90015-4"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Hoos, HH and St\u00fctzle, T. 1998. Evaluating Las Vegas algorithms \u2013 pitfalls and remedies. Proceedings of Uncertainty in Artificial Intelligence. 1998. pp.238\u2013245.","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00048-X"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006350622830"},{"key":"CIT0019","volume-title":"Stochastic Local Search: Foundations and Applications","author":"Hoos HH","year":"2004"},{"key":"CIT0020","doi-asserted-by":"crossref","unstructured":"Ishizuka, M and Matsuo, Y. 1998. SL method for computing a near-optimal solution using linear and non-linear programming in cost-based hypothetical reasoning. Proceedings of the Pacific Rim International Conference on Artificial Intelligence. 1998. pp.611\u2013625.","DOI":"10.1007\/BFb0095305"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Kato, S, Oono, S, Seki, H and Itoh, H. 1999. Cost-based abduction using binary decision diagrams. Proceedings of Industrial and Engineering Applications of Artificial Intelligence. 1999. pp.215\u2013225.","DOI":"10.1007\/978-3-540-48765-4_25"},{"key":"CIT0022","unstructured":"Kato, S, Seki, H and Itoh, H. 1994. Cost-based horn abduction and its optimal search. Proceedings of the Third International Conference on Automation, Robotics and Computer Vision. 1994. pp.831\u2013835."},{"key":"CIT0023","doi-asserted-by":"crossref","unstructured":"Kato, S, Seki, H and Itoh, H. 1996. Parallel cost-based abductive reasoning for distributed memory systems. Proceedings of the Pacific Rim International Conference on Artificial Intelligence. 1996. pp.300\u2013311.","DOI":"10.1007\/3-540-61532-6_26"},{"key":"CIT0024","unstructured":"Kennedy, J and Eberhart, RC. 1995. Particle swarm optimization. Proceedings of the IEEE International Conference on Neural Networks. 1995. Vol. IV, pp.1942\u20131948."},{"key":"CIT0025","volume-title":"Swarm Intelligence","author":"Kennedy J","year":"2001"},{"key":"CIT0026","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"Lourenco HR","year":"2002"},{"key":"CIT0027","doi-asserted-by":"crossref","unstructured":"Matsuo, Y and Ishizuka, M. 2002. Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning. Proceedings of the Pacific Rim Conference on Artificial Intelligence. 2002. pp.118\u2013127.","DOI":"10.1007\/3-540-45683-X_15"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(96)00061-6"},{"key":"CIT0029","unstructured":"Ohsawa, Y and Yachida, M. 1997. An extended polynomial solvability of cost-based abduction. Proceedings of the International Joint Conference on Artificial Intelligence (poster session abstracts). 1997. pp.79"},{"key":"CIT0030","doi-asserted-by":"crossref","unstructured":"Santos, E Jr. 1991. On the generation of alternative explanations with implications for belief revision. Proceedings of the Seventh Conference on Uncertainty in AI. 1991. pp.339\u2013347.","DOI":"10.1016\/B978-1-55860-203-8.50048-6"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90036-1"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(96)00016-1"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36605-9_30"},{"key":"CIT0034","volume-title":"Theory of Linear and Integer Programming","author":"Schrijver A","year":"1986"},{"key":"CIT0035","doi-asserted-by":"crossref","unstructured":"Smyth, K, Holger, HH and St\u00fctzle, T. Iterated robust tabu search for MAX-SAT. Proceedings of the 16th Canadian Conference on Artificial Intelligence. pp.129\u2013144. Berlin: Springer Verlag. Lecture Notes in Computer Science 2671","DOI":"10.1007\/3-540-44886-1_12"},{"key":"CIT0036","volume-title":"Statistical Methods","author":"Snedecor GW","year":"1989","edition":"8"}],"container-title":["Journal of Experimental & Theoretical Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09528130600906365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T00:09:21Z","timestamp":1555805361000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/09528130600906365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["10.1080\/09528130600906365"],"URL":"https:\/\/doi.org\/10.1080\/09528130600906365","relation":{},"ISSN":["0952-813X","1362-3079"],"issn-type":[{"value":"0952-813X","type":"print"},{"value":"1362-3079","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9]]}}}