{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T20:10:28Z","timestamp":1682539828376},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neurocomputing"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0925-2312(94)90035-3","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:56:11Z","timestamp":1060318571000},"page":"67-98","source":"Crossref","is-referenced-by-count":1,"title":["Backpropagation networks for logic constraint solving"],"prefix":"10.1016","volume":"6","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-2312(94)90035-3_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0893-6080(88)90002-0","article-title":"Self-organizing feature maps and the Travelling Salesman Problem","author":"Angeniol","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(94)90035-3_BIB2","doi-asserted-by":"crossref","DOI":"10.1137\/0210043","article-title":"An average time analysis of backtracking","volume":"10","author":"Brown","year":"1981","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0925-2312(94)90035-3_BIB3","series-title":"Proc. 3rd Ann. ACM Symp. Theory Comput.","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"issue":"1","key":"10.1016\/0925-2312(94)90035-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/0925-2312(94)90035-3_BIB5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","article-title":"Tree clustering for constraint networks","volume":"38","author":"Dechter","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0925-2312(94)90035-3_BIB6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and polyhedron with 0,1-vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bureau Standards (B)"},{"key":"10.1016\/0925-2312(94)90035-3_BIB7","article-title":"An empirical study of learning speed in backpropagation networks","author":"Fahlman","year":"1988","journal-title":"CMU Tech. Rep. CMU-CS-88\u2013162"},{"key":"10.1016\/0925-2312(94)90035-3_BIB8","article-title":"The Cascade-Correlation Learning Architecture, School on Computer Science","author":"Fahlmin","year":"1990"},{"key":"10.1016\/0925-2312(94)90035-3_BIB9","series-title":"ECAI'90 Proc.","article-title":"Why is scheduling difficult? A CSP Perspective","author":"Fox","year":"1990"},{"issue":"5","key":"10.1016\/0925-2312(94)90035-3_BIB10","article-title":"Probabilistic analysis of the Davis Putman procedure for solving the satisfiability problem","author":"Franco","year":"1983","journal-title":"Discrete Applied Math."},{"issue":"1","key":"10.1016\/0925-2312(94)90035-3_BIB11","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0925-2312(94)90035-3_BIB12","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(89)90009-5","article-title":"Algorithms for testing the satisfiability of propositional formulae","author":"Gallio","year":"1989"},{"key":"10.1016\/0925-2312(94)90035-3_BIB13","series-title":"Computer and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0925-2312(94)90035-3_BIB14","series-title":"Neural Networks, Advances and Applications","author":"Gelembe","year":"1991"},{"key":"10.1016\/0925-2312(94)90035-3_BIB15","first-page":"75","article-title":"Neural Networks and heuristic search","volume":"Vol. 1","author":"Greenberg","year":"1990"},{"key":"10.1016\/0925-2312(94)90035-3_BIB16","article-title":"Connectionist learning procedures","volume":"40","author":"Hinton","year":"1989"},{"key":"10.1016\/0925-2312(94)90035-3_BIB17","article-title":"Connectionist symbol processing","volume":"46","author":"Hinton","year":"1990"},{"key":"10.1016\/0925-2312(94)90035-3_BIB18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"The matching problem for bipartile graphs","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-2312(94)90035-3_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biol. Cybernet."},{"key":"10.1016\/0925-2312(94)90035-3_BIB20","series-title":"Discrete Algorithms and Complexity","first-page":"223","article-title":"Complementary approaches to CNF boolean equations","author":"Iwama","year":"1987"},{"key":"10.1016\/0925-2312(94)90035-3_BIB21","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0893-6080(88)90003-2","article-title":"Increased rates of convergence through learning rate adaptation","volume":"1","author":"Jacobs","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(94)90035-3_BIB22","series-title":"Proc. Conf. on Principles of Programming Languages","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"issue":"1","key":"10.1016\/0925-2312(94)90035-3_BIB23","first-page":"65","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problem","volume":"25","author":"Mackworth","year":"1985","journal-title":"A.I."},{"issue":"12","key":"10.1016\/0925-2312(94)90035-3_BIB24","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1145\/359657.359664","article-title":"Optimization decision trees through heuristically guided search","volume":"21","author":"Martelli","year":"1978","journal-title":"CACM"},{"key":"10.1016\/0925-2312(94)90035-3_BIB25","series-title":"Proc. 21st Annual Symp. on the Foundation of Computer Science","first-page":"17","article-title":"An algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0925-2312(94)90035-3_BIB26","first-page":"676","article-title":"Acceleration of back-propagation through learning rate and momentum adaptation","volume":"Vol. 1","author":"Minia","year":"1990"},{"key":"10.1016\/0925-2312(94)90035-3_BIB27","first-page":"29","article-title":"A general logic constraint solver, operations research and artificial intelligence","author":"Monfroglio","year":"1988","journal-title":"A.I.R.O."},{"key":"10.1016\/0925-2312(94)90035-3_BIB28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0169-023X(88)90002-X","article-title":"Timetabling through a deductive data base, a case study","volume":"3","author":"Monfroglio","year":"1988","journal-title":"Data & Knowledge Engineering"},{"key":"10.1016\/0925-2312(94)90035-3_BIB29","series-title":"Proc. First AIIA Conf.","first-page":"306","article-title":"General heuristics for logic constraint satisfaction","author":"Monfroglio","year":"1989"},{"issue":"1","key":"10.1016\/0925-2312(94)90035-3_BIB30","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-2312(91)90018-7","article-title":"Connectionist networks for constraint satisfaction","volume":"3","author":"Monfroglio","year":"1991","journal-title":"Neurocomputing"},{"key":"10.1016\/0925-2312(94)90035-3_BIB31","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(92)90389-W","article-title":"Integer programs for logic constraint satisfaction","volume":"97","author":"Monfroglio","year":"1992","journal-title":"Theoretical Comput. Sci."},{"key":"10.1016\/0925-2312(94)90035-3_BIB32","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications in picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/0925-2312(94)90035-3_BIB33","series-title":"Adaptive Pattern Recognition and Neural Networks","author":"Pao","year":"1989"},{"key":"10.1016\/0925-2312(94)90035-3_BIB34","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1137\/0212049","article-title":"An analysis of backtracking with search rearrangement","volume":"12","author":"Purdom","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-2312(94)90035-3_BIB35","article-title":"Backpropagation extensions","author":"Samad","year":"1989","journal-title":"Honeywell SSDC Tech. Rep."},{"key":"10.1016\/0925-2312(94)90035-3_BIB36","series-title":"Algebraic and Logic Programming, 2nd Internat. Conf.","first-page":"189","article-title":"Propositional calculus problems in CHIP","volume":"463","author":"Simonis","year":"1990"},{"issue":"3","key":"10.1016\/0925-2312(94)90035-3_BIB37","article-title":"A parallel network that learns to play backgammon","volume":"39","author":"Tesauro","year":"1989","journal-title":"AI J."},{"key":"10.1016\/0925-2312(94)90035-3_BIB38","article-title":"A digital neural network architecture for VLSI","volume":"Vol. II","author":"Tomlinson","year":"1990"},{"key":"10.1016\/0925-2312(94)90035-3_BIB39","series-title":"IJCAI Proc.","first-page":"2","article-title":"A framework for consistency techniques in logic programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0925-2312(94)90035-3_BIB40","article-title":"A constraint approach to mastermind in logic programming","volume":"103","author":"Van Hentenryck","year":"1988","journal-title":"SIGART Newsletter"}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231294900353?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231294900353?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T19:42:40Z","timestamp":1682538160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925231294900353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0925231294900353"],"URL":"https:\/\/doi.org\/10.1016\/0925-2312(94)90035-3","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}