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!kean
From: kean@cs.ust.hk (Alex Kean)
Subject: Re: Constraint Satisfaction Problems (CSP) w/ non-finite domains?
Message-ID: <1994Sep1.014107.9350@uxmail.ust.hk>
Sender: usenet@uxmail.ust.hk (usenet account)
Organization: The Hong Kong University of Science and Technology
References: <341tff$58t@babbage.ece.uc.edu>
Date: Thu, 1 Sep 1994 01:41:07 GMT
Lines: 35
Xref: glinda.oz.cs.cmu.edu comp.constraints:258 comp.lang.prolog:11170 sci.math:79418 sci.logic:8088

In article <341tff$58t@babbage.ece.uc.edu> 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...
>
>Help, anyone?
>
>Thanks in advance,
>Bill
>
>P.S.  Has there been any work done on feedback-free searches over
>	non-finite domains (via domain restriction, perhaps)?
>

How about looking at Operation Research?

Alex Kean
-------------------------------------------------------------------------
Department of Computer Science                       Email:kean@cs.ust.hk
The Hong Kong University of Science & Technology     Tel: (852) 358-6992
Clear Water Bay, Kowloon, HONG KONG                  Fax: (852) 358-1477
-------------------------------------------------------------------------








