{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T05:54:48Z","timestamp":1648878888247},"reference-count":69,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1874-5946(98)80074-6","type":"book-chapter","created":{"date-parts":[[2008,4,17]],"date-time":"2008-04-17T08:37:47Z","timestamp":1208421467000},"page":"293-361","source":"Crossref","is-referenced-by-count":0,"title":["Finite constraint satisfaction"],"prefix":"10.1016","author":[{"given":"Angelo","family":"Monfroglio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1874-5946(98)80074-6_bib1","author":"Rich","year":"1983"},{"key":"10.1016\/S1874-5946(98)80074-6_bib2","series-title":"Artificial Intelligence","article-title":"Planning and operation research","author":"Daniel","year":"1983"},{"key":"10.1016\/S1874-5946(98)80074-6_bib3","article-title":"Lessons for O.R. from A.I.: A scheduling case study","volume":"37","author":"Grant","year":"1986","journal-title":"J. Oper. Res."},{"key":"10.1016\/S1874-5946(98)80074-6_bib4","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(80)90032-6","article-title":"Constraints: A language for expressing almost-hierarchical descriptions","volume":"14","author":"Sussman","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1874-5946(98)80074-6_bib5","series-title":"Special volume: Constraint-based reasoning","volume":"58","year":"1992"},{"key":"10.1016\/S1874-5946(98)80074-6_bib6","author":"Parker","year":"1988"},{"key":"10.1016\/S1874-5946(98)80074-6_bib7","author":"Garey","year":"1979"},{"key":"10.1016\/S1874-5946(98)80074-6_bib8","article-title":"An empirical study of phase transitions in binary constraint satisfaction problems","volume":"Vol. 81","author":"Prosser","year":"1996"},{"key":"10.1016\/S1874-5946(98)80074-6_bib9","series-title":"Proceedings of the European Conference on Artificial Intelligence","article-title":"Why is scheduling difficult? A CSP perspective. Invited talk","author":"Fox","year":"1990"},{"key":"10.1016\/S1874-5946(98)80074-6_bib10","series-title":"Proceedings of the First AIIA Conference","article-title":"General heuristics for logic constraint satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib11","article-title":"Algorithms for testing the satisfiability of propositional formulae","volume":"6","author":"Gallo","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/S1874-5946(98)80074-6_bib12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S1874-5946(98)80074-6_bib13","doi-asserted-by":"crossref","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\/S1874-5946(98)80074-6_bib14","series-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","first-page":"459","article-title":"Hard and easy distributions for SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S1874-5946(98)80074-6_bib15","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis-Putman procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S1874-5946(98)80074-6_bib16","article-title":"The cascade correlation learning architecture","author":"Fahlman","year":"1990"},{"key":"10.1016\/S1874-5946(98)80074-6_bib17","article-title":"Logic decisions under constraints","volume":"11","author":"Monfroglio","year":"1993","journal-title":"Decision Support Syst."},{"key":"10.1016\/S1874-5946(98)80074-6_bib18","author":"Pao","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib19","article-title":"Back-propagation extensions","author":"Samad","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib20","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\/S1874-5946(98)80074-6_bib21","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\/S1874-5946(98)80074-6_bib22","article-title":"A digital neural network architecture for VLSI","volume":"Vol. II","author":"Tomlinson","year":"1990"},{"key":"10.1016\/S1874-5946(98)80074-6_bib23","first-page":"246","article-title":"Random optimization","volume":"26","author":"Matyas","year":"1965","journal-title":"Automat. Remote Control"},{"key":"10.1016\/S1874-5946(98)80074-6_bib24","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0893-6080(89)90021-X","article-title":"A new approach for finding the global minimum of error function of neural networks","volume":"2","author":"Baba","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/S1874-5946(98)80074-6_bib25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","article-title":"Minimization by random search techniques","volume":"6","author":"Solis","year":"1981","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S1874-5946(98)80074-6_bib26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1207\/s15516709cog0901_7","article-title":"A learning algorithm for Boltzmann machines","volume":"9","author":"Ackley","year":"1985","journal-title":"Cognitive Sci."},{"key":"10.1016\/S1874-5946(98)80074-6_bib27","author":"Aarts","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib28","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S1874-5946(98)80074-6_bib29","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/72.143377","article-title":"Using radial basis functions to approximate a function and its error bounds","volume":"3","author":"Leonard","year":"1992","journal-title":"IEEEE Trans. Neural Networks"},{"key":"10.1016\/S1874-5946(98)80074-6_bib30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1162\/neco.1989.1.2.281","article-title":"Fast learning in networks of locally tuned processing units","volume":"1","author":"Moody","year":"1989","journal-title":"Neural Comput."},{"key":"10.1016\/S1874-5946(98)80074-6_bib31","author":"Kohonen","year":"1988"},{"key":"10.1016\/S1874-5946(98)80074-6_bib32","article-title":"How patterned neural connections can be set up by self-organization","volume":"194","author":"Willshaw","year":"1976","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S1874-5946(98)80074-6_bib33","article-title":"Adding a conscience to competitive learning","volume":"Vol. I","author":"DeSieno","year":"1988"},{"key":"10.1016\/S1874-5946(98)80074-6_bib34","author":"Batchelor","year":"1974"},{"key":"10.1016\/S1874-5946(98)80074-6_bib35","doi-asserted-by":"crossref","DOI":"10.1016\/0893-6080(90)90049-Q","article-title":"Probabilistic neural networks","volume":"3","author":"Specht","year":"1990","journal-title":"Neural Networks"},{"key":"10.1016\/S1874-5946(98)80074-6_bib36","author":"Klimasauskas","year":"1991"},{"key":"10.1016\/S1874-5946(98)80074-6_bib37","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF01421960","article-title":"Neural networks for finite constraint satisfaction","volume":"3","author":"Monfroglio","year":"1995","journal-title":"Neural Comput. Appl."},{"key":"10.1016\/S1874-5946(98)80074-6_bib38","series-title":"Proceedings of the First Artificial Intelligence Italian Association Conference","first-page":"306","article-title":"General heuristics for logic constraint satisfaction","author":"Monfroglio","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib39","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\/S1874-5946(98)80074-6_bib40","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1006\/jpdc.1994.1009","article-title":"Neural logic constraint solving","volume":"20","author":"Monfroglio","year":"1994","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S1874-5946(98)80074-6_bib41","series-title":"Third Congress of Advances in Artificial Intelligence","first-page":"102","article-title":"Neural networks for constraint satisfaction","volume":"Vol. 728","author":"Monfroglio","year":"1993"},{"issue":"1","key":"10.1016\/S1874-5946(98)80074-6_bib42","doi-asserted-by":"crossref","DOI":"10.1016\/S0377-2217(96)00071-9","article-title":"Linear programs for constraint satisfaction problems","volume":"97","author":"Zimmermann","year":"1997","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S1874-5946(98)80074-6_bib43","article-title":"A polynomial algorithm for linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Sov. Math. Dokl."},{"key":"10.1016\/S1874-5946(98)80074-6_bib44","series-title":"Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing","first-page":"1093","article-title":"A new polynomial time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/S1874-5946(98)80074-6_bib45","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF01585727","article-title":"A \u201cBuild-down\u201d scheme for linear programming","volume":"46","author":"Ye","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/S1874-5946(98)80074-6_bib46","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S1874-5946(98)80074-6_bib47","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0925-2312(94)90035-3","article-title":"Backpropagation networks for logic constraint solving","volume":"6","author":"Monfroglio","year":"1994","journal-title":"Neurocomputing"},{"key":"10.1016\/S1874-5946(98)80074-6_bib48","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-2312(94)00005-0","article-title":"Connectionist networks for pivot selection in linear programming","volume":"8","author":"Monfroglio","year":"1995","journal-title":"Neurocomputing"},{"key":"10.1016\/S1874-5946(98)80074-6_bib49","author":"Takefuji","year":"1992"},{"key":"10.1016\/S1874-5946(98)80074-6_bib50","article-title":"Neural networks for satisfiability problems","volume":"1","author":"Monfroglio","year":"1996","journal-title":"Constraints J."},{"key":"10.1016\/S1874-5946(98)80074-6_bib51","author":"Holland","year":"1975"},{"key":"10.1016\/S1874-5946(98)80074-6_bib52","author":"Goldberg","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib53","series-title":"Handbook of Genetic Algorithms","year":"1991"},{"key":"10.1016\/S1874-5946(98)80074-6_bib54","series-title":"GENESIS and OOGA: Two genetic algorithm systems","author":"Grefenstette","year":"1991"},{"key":"10.1016\/S1874-5946(98)80074-6_bib55","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0004-3702(94)90109-0","article-title":"Easy problems are sometimes hard","volume":"70","author":"I.P.","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1874-5946(98)80074-6_bib56","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"8","author":"Davis","year":"1960","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S1874-5946(98)80074-6_bib57","doi-asserted-by":"crossref","DOI":"10.1007\/BF01531077","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S1874-5946(98)80074-6_bib58","series-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","first-page":"440","article-title":"GSAT: A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S1874-5946(98)80074-6_bib59","series-title":"Special volume on frontiers in problem solving: Phase transitions and complexity","first-page":"81","year":"1996"},{"key":"10.1016\/S1874-5946(98)80074-6_bib60","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02430364","article-title":"Testing heuristics: We have it all wrong","volume":"1","author":"Hooker","year":"1995","journal-title":"J. Heuristics"},{"key":"10.1016\/S1874-5946(98)80074-6_bib61","series-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","first-page":"459","article-title":"Hard and easy distributions for SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S1874-5946(98)80074-6_bib62","article-title":"Using neural networks and genetic algorithms as heuristics for NP-complete problems","author":"Spears","year":"1989"},{"key":"10.1016\/S1874-5946(98)80074-6_bib63","article-title":"A NN algorithm for hard satisfiability problems","author":"Spears","year":"1993"},{"key":"10.1016\/S1874-5946(98)80074-6_bib64","article-title":"Simulated annealing for hard satisfiability problems","author":"Spears","year":"1993"},{"key":"10.1016\/S1874-5946(98)80074-6_bib65","doi-asserted-by":"crossref","DOI":"10.1016\/0925-2312(95)00023-Y","article-title":"Design of neurocomputer architectures for large-scale constraint satisfaction problems","volume":"8","author":"Schaller","year":"1995","journal-title":"Neurocomputing"},{"key":"10.1016\/S1874-5946(98)80074-6_bib66","author":"Ziegler","year":"1995"},{"key":"10.1016\/S1874-5946(98)80074-6_bib67","author":"Karloff","year":"1991"},{"key":"10.1016\/S1874-5946(98)80074-6_bib68","author":"Sierksma","year":"1996"},{"key":"10.1016\/S1874-5946(98)80074-6_bib69","series-title":"Algebraic and Logic Programming. Second International Conference","first-page":"189","article-title":"Propositional calculus problems in CHIP","author":"Simonis","year":"1990"}],"container-title":["Neural Network Systems Techniques and Applications","Algorithms and Architectures"],"original-title":[],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T07:59:03Z","timestamp":1557475143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1874594698800746"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":69,"URL":"https:\/\/doi.org\/10.1016\/s1874-5946(98)80074-6","relation":{},"ISSN":["1874-5946"],"issn-type":[{"value":"1874-5946","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}