Newsgroups: comp.constraints,comp.lang.prolog,sci.math,sci.logic
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!solaris.cc.vt.edu!uunet!psinntp!hk.super.net!news.ust.hk!hpg30a.csc.cuhk.hk!eng_ser1!jlee
From: jlee@cs.cuhk.hk (Jimmy Ho Man Lee)
Subject: Re: Constraint Satisfaction Problems (CSP) w/ non-finite domains?
Message-ID: <CvG1ts.G5w@eng_ser1.ie.cuhk.hk>
Lines:  35
Sender: news@eng_ser1.ie.cuhk.hk
Organization: Engineering Faculty, The Chinese U. of Hong Kong
References: <341tff$58t@babbage.ece.uc.edu>
Date: Thu, 1 Sep 1994 09:17:52 GMT
Xref: glinda.oz.cs.cmu.edu comp.constraints:259 comp.lang.prolog:11180 sci.math:79437 sci.logic:8090

wbradley@pumpkin.ece.uc.edu (William Bradley) writes:


>Is anyone out there doing work in general or binary CSP with non-finite
>domains?  Most CSP techniques I'm familiar with are search-based, and
>this won't work if you can't enumerate a variable's domain.

>I'm using Tsang's book (very nice, IMHO) as an overview, but he doesn't
>discuss infinite-domain CSPs beyond the use of constraint propagation
>in real-valued linear systems.  This doesn't help me much...
The following two publications might help:

@article{lee93b,
  author = {Lee, J.H.M. and van Emden, M.H.},
  title = {Interval Computation as Deduction in {CHIP}},
  journal = {Journal of Logic Programming},
  year = 1993,
  volume = 16,
  number = {3 \& 4},
  pages = {255--276}
  }

@inproceedings{chi94,
  author = {Chiu, C.K. and Lee, J.H.M.},
  title = {Towards Practical Interval Constraint Solving in Logic Programming},
  booktitle = {Logic Programming: Proceedings of the 1994 International Symposiu
m},
  year = 1994
  }

The CIAL system described in the second paper is available for FTP.

Cheers,
jim
