LPAR 1992: Logic Programming and Automated Reasoning pp 507-509 | Cite as
CHIP and Propia
System Descriptions
First Online:
Keywords
Logic Program Logic Programming Generalise Propagation Finite Domain Constraint Solver
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.A. Aggoun and N. Beldiceanu. Overview of the CHIP Compiler System. In K. Furukuwa and P. Deransart, editors, Proceedings of the 8th International Conference on Logic Programming, pages 775–789, June 1991.Google Scholar
- 2.M. Dincbas, H. Simonis, and P. Van Hentenryck. Solving large combinatorial problems in logic programming. Journal of Logic Programming, 8:74–94, 1990.Google Scholar
- 3.J. Jaffar and J-L. Lassez. Constraint logic programming. In Proceedings of the 14th ACM POPL Symposium, Munich, West Germany, January 1987.Google Scholar
- 4.T. Le Provost and M. Wallace. Domain independent propagation. In Proc. FGCS'92, Tokyo, Japan, June 1992.Google Scholar
- 5.P. Van Hentenryck. Constraint Satisfaction in Logic Programming. Logic Programming Series. The MIT Press, 1989.Google Scholar
- 6.P. Van Hentenryck and M. Dincbas. Domains in logic programming. In Proceedings of the National Conference on Artificial Intelligence (AAAI-86), pages 759–765, Philadelphia, USA, August 1986.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1992