{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T05:23:51Z","timestamp":1722921831605},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ijcnn.2005.1555959","type":"proceedings-article","created":{"date-parts":[[2006,1,5]],"date-time":"2006-01-05T14:52:38Z","timestamp":1136472758000},"page":"827-832","source":"Crossref","is-referenced-by-count":1,"title":["Negative reinforcement and backtrack-points for recurrent neural networks for cost-based abduction"],"prefix":"10.1109","volume":"2","author":[{"given":"A.M.","family":"Abdelbar","sequence":"first","affiliation":[]},{"given":"M.A.","family":"El-Hemaly","sequence":"additional","affiliation":[]},{"given":"E.A.M.","family":"Andrews","sequence":"additional","affiliation":[]},{"given":"D.C.","family":"Wunsch","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","first-page":"118","article-title":"Two transformations of clauses into constraints and their properties for cost-based hypothetical reasoning","author":"matsuo","year":"2002","journal-title":"Proc Pacific Rim Int Conf Artificial Intelligence"},{"key":"17","first-page":"831","article-title":"Cost-based horn abduction and its optimal search","author":"kato","year":"1994","journal-title":"Proc Third Int Conf Automation Robotics and Computer Vision"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1007\/3-540-61532-6_26"},{"key":"15","first-page":"611","article-title":"SL method for computing a near-optimal solution using linear and non-linear programming in cost-based hypothetical reasoning","author":"ishizuka","year":"1998","journal-title":"Proc Pacific Rim Int Conf on Artificial Intelligence 90"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1007\/978-3-540-48765-4_25"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1016\/0004-3702(93)90015-4"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1073\/pnas.79.8.2554"},{"key":"11","first-page":"218","article-title":"Generalized chart algorithm: An efficient procedure for cost-based abduction","author":"den","year":"1994","journal-title":"Proc Meeting Association for Computational Linguistics"},{"key":"12","first-page":"282","article-title":"Learning and re-learning in Boltzmann machines","author":"hinton","year":"1986","journal-title":"Parallel Distributed Processing I"},{"key":"21","first-page":"79","article-title":"An extended polynomial solvability of cost-based abduction","author":"ohsawa","year":"1997","journal-title":"Proceedings International Joint Conference on Artificial Intelligence (poster session abstracts)"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/S0004-3702(96)00061-6"},{"doi-asserted-by":"publisher","key":"22","DOI":"10.1016\/0893-6080(89)90045-2"},{"doi-asserted-by":"publisher","key":"23","DOI":"10.1016\/0004-3702(94)00032-V"},{"doi-asserted-by":"publisher","key":"24","DOI":"10.1016\/B978-1-55860-203-8.50048-6"},{"doi-asserted-by":"publisher","key":"25","DOI":"10.1016\/0004-3702(94)90036-1"},{"doi-asserted-by":"publisher","key":"26","DOI":"10.1016\/0004-3702(96)00016-1"},{"key":"27","first-page":"398","article-title":"Higher-order Boltzmann machines","author":"sejnowski","year":"1986","journal-title":"Neural Networks for Computing"},{"doi-asserted-by":"publisher","key":"3","DOI":"10.1016\/j.artint.2004.06.001"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1201\/9781420049176.ch4"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1016\/0004-3702(94)90030-2"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1016\/S0004-3702(98)00074-5"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1080\/09528130500283642"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/CEC.2003.1299420"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1016\/S0893-6080(03)00114-X"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/IJCNN.2003.1223793"},{"key":"9","first-page":"106","article-title":"Probabilistic semantics for cost-based abduction","author":"charniak","year":"1990","journal-title":"Proceedings AAAI National Conference on Artificial Intelligence"},{"key":"8","first-page":"446","article-title":"A new admissible heuristic for minimal-cost proofs","author":"charniak","year":"1991","journal-title":"Proceedings AAAI National Conference on Artificial Intelligence"}],"event":{"acronym":"IJCNN-05","name":"International Joint Conference on Neural Networks 2005","location":"Montreal, Que., Canada"},"container-title":["Proceedings. 2005 IEEE International Joint Conference on Neural Networks, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10421\/33090\/01555959.pdf?arnumber=1555959","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T01:10:11Z","timestamp":1489540211000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1555959\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/ijcnn.2005.1555959","relation":{},"subject":[]}}