Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!fas-news.harvard.edu!newspump.wustl.edu!news.ecn.bgu.edu!psuvax1!uwm.edu!vixen.cso.uiuc.edu!howland.reston.ans.net!Germany.EU.net!Munich.Germany.EU.net!ecrc!acrab60!thom
From: thom@ecrc.de (Thom Fruehwirth)
Subject: Re: Solving a conjunction of X <= Y clauses
Message-ID: <D2Ar31.Dzo@ecrc.de>
Sender: news@ecrc.de
Reply-To: thom@ecrc.de
Organization: European Computer-Industry Research Centre GmbH.
References: <D2Anqx.BEK@ecrc.de>
Date: Thu, 12 Jan 1995 14:33:01 GMT
Lines: 11

I wrote:

>The library includes about 20 constraint solvers, one of it solves your problems
>of type 1 and type 2 over the reals and rationals.

Uups, I forgot to mention that the finite domain library solves for all the other
cases (integers and finite numerical domains).

thom


