Newsgroups: comp.ai.shells
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!agate!ihnp4.ucsd.edu!pacbell.com!amdahl!netcomsv!ix.netcom.com!netcom.com!ludemann
From: ludemann@netcom.com (Peter Ludemann)
Subject: Re: Expert System Shells in Constraint Resolution
Message-ID: <ludemannCxBFxC.21M@netcom.com>
Organization: NETCOM On-line Communication Services (408 261-4700 guest)
References: <ARIFI.94Oct4143710@grover.dmi.stevens-tech.edu>
Date: Fri, 7 Oct 1994 18:41:36 GMT
X-Original-Newsgroups: comp.ai.shells
Lines: 21

In article <ARIFI.94Oct4143710@grover.dmi.stevens-tech.edu>,
M.Arifi Koseoglu <arifi@grover.dmi.stevens-tech.edu> wrote:
>Has any one here used an expert system shell
>for solving constraint resolution problems ?
>Especially CLIPS ?

I would suggest constraint logic programming; a CLIPS-style
shell will probably be a lot of grief for this kind of problem.

Take a look in comp.constraints.

For books, you might try:

   Van Hentenryck, Pascal, "Constraint Satisfaction in Logic Programming",
   MIT Press, Cambridge, MA, 1989, ISBN 0-262-08181-4.

There are quite a few others in the Prolog FAQ (you can get it from
rtfm.mit.edu).  The FAQ also mentions sources (some are even free).

-- 
Peter Ludemann                      ludemann@netcom.com
