Appendix A: ECLiPSe code to deal with Partially defined domain variables

To develop our applications, we used the  ECLiPSe  programming language. All the code is based on a module which allows the use of partially defined domain variables. This module defines partially defined domain variables, handles unification and defines methods for accessing and handling partially defined domains. It is based on the fd.pl standard library of   ECLiPSe.
The module can be downloaded here:  dom_pd.pl , also in  gzipped form .
 

Bibliography

[CGLMMP99] R. Cucchiara, M. Gavanelli, E. Lamma, P. Mello, M. Milano, and M. Piccardi. Constraint propagation and value acquisition: why we should do it interactively. In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 468-477, Stockholm, Sweden, July 31 - August 6 1999. Morgan Kaufmann. PDF

[DM94] M.J. Dent and R.E. Mercer. Minimal Forward Checking. Proceedings of ICTAI94, 1994.   PS

[DS96] M. Dyer, B.M. Smith Locating the Phase Transition in Binary Constraint Satisfaction Problems. Artificial Intelligence, 81, pp. 155-181, 1996.
Also in Barbara Smith, Research Report 94.16, University of Leeds - School of Computer Studies. May 1994.

[FS94]  E. C. Freuder, D. Sabin Contradicting Conventional Wisdom in Constraint Satisfaction
Proceedings of the 2nd International Workshop on Principles and Practice of Constraint Programming (PPCP'94 ), Rosario, Orcas Island, Washington, USA, May 1994, Lecture Notes in Computer Science, vol. 874, Springer-Verlag.  Also in ECAI'94 Proceedings.

[vHent89] Pascal van Hentenryck Constraint Satisfaction in Logic Programming MIT Press, 1989.

[DARPA] C. Wheems, E. Riesman, A.Hanson, A.Rosenfeld The Darpa Image Understanding Benchmark for Parallel Computers, Journal of Parallel and Distributed Computing, Vol. 11, pp. 1-24, 1991.  DARPA site
 


  Previous  Main Page