Models for using stochastic constraint solvers in constraint logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1140, Issue , 1996, Pages 423-437

  Stuckey, Peter J ^a   Tam, Vincent ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; PROBLEM SOLVING; RECONFIGURABLE HARDWARE; SEMANTICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVERS; HARD CONSTRAINTS; MODIFIED NEURAL NETWORKS; SEMANTIC PROPERTIES; SOUNDNESS AND COMPLETENESS; STOCHASTIC CONSTRAINTS;

LOGIC PROGRAMMING;

EID: 84957639285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61756-6_101     Document Type: Conference Paper

References (15)

1. E.H.L. Aarts and J.H.M. Korst. Boltzmann machines for travelling salesman problems. European Journal of Operational Research, 39:79-95, 1989.
2. A. Davenport, E.P.K. Tsang, C.J. Wang, and K. Zhu. GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proceedings of AAAI'94, 325-330, 1994.
3. M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In Procs. of the European Conf. on Art. Int., 290-295, 1988.
4. M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving large combinatorial problems in logic programming. Journal of Logic Programming, 8:75-93, 1990.
5. J.J. Hopfield and D. Tank. "Neural" computation of decisions in optimization problems. Biological Cybernetics, 52:141-152, 1985.
6. A.R-A. Illera and J. Ortiz. Labelling in CLP(FD) with evolutionary programming. In Procs. of GULP-PRODE 95, 569-590, 1995.
7. Joxan Jaffar and Michael J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, Volume 19 / 20, May 1994.
8. J.H.M. Lee, H.F.Leung and H.W. Won. Extending GENET for Non-Binary CSP's. In Proceedings of the Seventh IEEE International Conference on Tools with Artificial Intelligence, 338-343, November 1995.
9. J.H.M. Lee and V.W.L. Tam. A Framework for Integrating Artificial Neural Networks and Logic Programming International Journal on Artificial Intelligence Tools 4(1&2), 3-32, June, 1995.
10. Ronald E. Prather Discrete Mathematical Structures for Computer Science. Houghton Mifflin,1976.
11. P. Stuckey and V. Tam, Extending GENET with lazy arc consistency. University of Melbourne, Department of Computer Science Tech. Report 96/8.
12. V.W.L. Tam. Integrating artificial neural networks and constraint logic programming. Master's thesis, Department of Computer Science, The Chinese University of Hong Kong, 1995.
13. E.P.K. Tsang and C.J. Wang. A generic neural network approach for constraint satisfaction problems. In G Taylor, editor, Neural Network Applications, 12-22. Springer-Verlag, 1992.
14. P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT Press, 1989.
15. L.C. Wu and C.Y. Tang. Solving the satisfiability problem by using randomized approach. In Information Processing Letters 41, 295-299, North-Holland, 1992.