{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T20:10:25Z","timestamp":1682539825483},"reference-count":47,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":[[1991,8]]},"DOI":"10.1016\/0925-2312(91)90018-7","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:56:11Z","timestamp":1060318571000},"page":"29-49","source":"Crossref","is-referenced-by-count":8,"title":["Connectionist networks for constraint satisfaction"],"prefix":"10.1016","volume":"3","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-2312(91)90018-7_BIB1","doi-asserted-by":"crossref","DOI":"10.1016\/0893-6080(88)90002-0","article-title":"Self-organizing feature maps and the traveling salesman problem","author":"Angeniol","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/0925-2312(91)90018-7_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(91)90018-7_BIB3","series-title":"Proc. 3rd Ann. ACM Symp. Theory Comput.","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0925-2312(91)90018-7_BIB4","series-title":"Artificial Intelligence","article-title":"Planning and operation research","author":"Daniel","year":"1983"},{"issue":"1","key":"10.1016\/0925-2312(91)90018-7_BIB5","doi-asserted-by":"crossref","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(91)90018-7_BIB6","doi-asserted-by":"crossref","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"},{"issue":"69","key":"10.1016\/0925-2312(91)90018-7_BIB7","article-title":"Maximum matching and polyhedron with 0,1-vertices","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bureau Standards(B)"},{"key":"10.1016\/0925-2312(91)90018-7_BIB8","series-title":"Proc. ECAI'90","article-title":"Why is scheduling difficult? A CSP perspective","author":"Fox","year":"1990"},{"issue":"5","key":"10.1016\/0925-2312(91)90018-7_BIB9","article-title":"Probabilistic analysis of the Davis Putman procedire for solving the satisfiability problem","author":"Franco","year":"1983","journal-title":"Discrete Appl. Mathemat."},{"issue":"1","key":"10.1016\/0925-2312(91)90018-7_BIB10","doi-asserted-by":"crossref","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(91)90018-7_BIB11","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","journal-title":"J. Logic Programming"},{"key":"10.1016\/0925-2312(91)90018-7_BIB12","series-title":"Computer and Intractability","author":"Garey","year":"1979"},{"issue":"1","key":"10.1016\/0925-2312(91)90018-7_BIB13","article-title":"Lessons for O.R. from A.I.: A scheduling case study","volume":"37","author":"Grant","year":"1986","journal-title":"J. Operant Res. Soc."},{"issue":"1\u20133","key":"10.1016\/0925-2312(91)90018-7_BIB14","article-title":"Connectionist learning procedures","volume":"40","author":"Hinton","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0925-2312(91)90018-7_BIB15","series-title":"Connectionist Symbol Processing","volume":"46","year":"1990"},{"key":"10.1016\/0925-2312(91)90018-7_BIB16","article-title":"The matching problem for bipartite graphs","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-2312(91)90018-7_BIB17","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(91)90018-7_BIB18","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0925-2312(91)90018-7_BIB19","series-title":"Proc. Japan-US Joint Seminar","article-title":"Complementary approaches to CNF Boolean equations","author":"Iwama","year":"1987"},{"key":"10.1016\/0925-2312(91)90018-7_BIB20","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(91)90018-7_BIB21","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problem","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"issue":"12","key":"10.1016\/0925-2312(91)90018-7_BIB22","doi-asserted-by":"crossref","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(91)90018-7_BIB23","series-title":"Proc. 21st Ann. Symp. on the Foundation of Computer Science","article-title":"An algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0925-2312(91)90018-7_BIB24","article-title":"School time table scheduling in Prolog","volume":"96","author":"Monfroglio","year":"1986","journal-title":"SIGART Newsl."},{"issue":"4","key":"10.1016\/0925-2312(91)90018-7_BIB25","article-title":"Soddisfacimento di vincoli e programmazione logica parallela","volume":"XVI","author":"Monfroglio","year":"1986","journal-title":"Riv. Inform."},{"issue":"4","key":"10.1016\/0925-2312(91)90018-7_BIB26","article-title":"Soddisfacimento di vincoli e allocazione di risorse condivise: un algoritmo polinomiale deterministico","volume":"XVII","author":"Monfroglio","year":"1987","journal-title":"Riv. Inform. A.I.C.A."},{"key":"10.1016\/0925-2312(91)90018-7_BIB27","article-title":"A graphical interface to logic programming","volume":"101","author":"Monfroglio","year":"1987","journal-title":"SIGART Newsl."},{"key":"10.1016\/0925-2312(91)90018-7_BIB28","series-title":"Operat. Res. Artificial Intelligence","article-title":"A general logic constraint solver","author":"Monfroglio","year":"1988"},{"issue":"3","key":"10.1016\/0925-2312(91)90018-7_BIB29","article-title":"Timetabling through a deductive data base, a case study","author":"Monfroglio","year":"1988","journal-title":"Data Knowledge Engineering"},{"key":"10.1016\/0925-2312(91)90018-7_BIB30","series-title":"Proc. First AIIA Conf.","article-title":"General heuristics for logic constraint satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/0925-2312(91)90018-7_BIB31","doi-asserted-by":"crossref","unstructured":"A. Monfroglio, Integer programs for logic constraint satisfaction, Theoret. Comput. Sci. (to appear).","DOI":"10.1016\/0304-3975(92)90389-W"},{"key":"10.1016\/0925-2312(91)90018-7_BIB32","doi-asserted-by":"crossref","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(91)90018-7_BIB33","series-title":"Discrete Optimization","author":"Parker","year":"1988"},{"issue":"1","key":"10.1016\/0925-2312(91)90018-7_BIB34","article-title":"Artificial intelligence \u2014 an overview of similarities with O.R.","volume":"37","author":"Phelps","year":"1986","journal-title":"J. Operat. Res. Soc."},{"key":"10.1016\/0925-2312(91)90018-7_BIB35","doi-asserted-by":"crossref","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(91)90018-7_BIB36","series-title":"Artificial Intelligence","author":"Rich","year":"1983"},{"key":"10.1016\/0925-2312(91)90018-7_BIB37","article-title":"Constraint satisfaction problems in logic programming","volume":"106","author":"Rossi","year":"1988","journal-title":"SIGART Newsl."},{"key":"10.1016\/0925-2312(91)90018-7_BIB38","series-title":"Parallel Distributed Processing: Explorations in the Microstructure of Cognition","year":"1986"},{"issue":"2","key":"10.1016\/0925-2312(91)90018-7_BIB39","doi-asserted-by":"crossref","DOI":"10.1145\/42282.46160","article-title":"The time complexity of maximum matching by simulated annealing","volume":"35","author":"Sasaki","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/0925-2312(91)90018-7_BIB40","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(80)90075-1","article-title":"Decomposition of regular matroids","author":"Seymour","year":"1980","journal-title":"J. Combinat. Theory"},{"key":"10.1016\/0925-2312(91)90018-7_BIB41","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(80)90032-6","article-title":"Constraints: a language for expressing most-hierarchical descriptions","volume":"14","author":"Sussman","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/0925-2312(91)90018-7_BIB42","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(89)90017-9","article-title":"A parallel network that learns to play backgammon","author":"Tesauro","year":"1989","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0925-2312(91)90018-7_BIB43","article-title":"Heuristic methods applied to orienteering","volume":"9","author":"Tsiligirides","year":"1984","journal-title":"J. Operat. Res. Soc."},{"key":"10.1016\/0925-2312(91)90018-7_BIB44","series-title":"Proc. Fourth Internat. Conf. on Logic Programming","article-title":"Forward checking in logic programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0925-2312(91)90018-7_BIB45","series-title":"Proc. IJCAI","article-title":"A framework for consistency techniques in logic programming","author":"Van Hentenryck","year":"1987"},{"key":"10.1016\/0925-2312(91)90018-7_BIB46","article-title":"A constraint approach to mastermind in logic programming","volume":"103","author":"Van Hentenryck","year":"1988","journal-title":"SIGART Newsl."},{"key":"10.1016\/0925-2312(91)90018-7_BIB47","doi-asserted-by":"crossref","DOI":"10.1007\/BF00363956","article-title":"On the stability of the Traveling Salesman Problem algorithm of Hopfield and Tank","volume":"58","author":"Wilson","year":"1988","journal-title":"Biol. Cybernet."}],"container-title":["Neurocomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231291900187?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925231291900187?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:43:04Z","timestamp":1682538184000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925231291900187"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0925231291900187"],"URL":"https:\/\/doi.org\/10.1016\/0925-2312(91)90018-7","relation":{},"ISSN":["0925-2312"],"issn-type":[{"value":"0925-2312","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}