Re: AdaGames

[dennison@telepath.com (Ted Dennison)]

"Bobby D. Bryant" <bdbryant@mail.utexas.edu> wrote in message news:<a814md$i93$1@geraldo.cc.utexas.edu>...
> On Thu, 28 Mar 2002 13:21:09 -0600, Ted Dennison wrote:
> > I'd think for an AI client application you'd want to use an AI
> > language; something that can syntacticly handle rule definitions more
> > easily than a procedural language like Ada, and has a nice built-in
> > inference engine. Of course, you can always use Ada for the system
> > software part that AI's aren't as good with. I'm not just whistling
> > dixie here; I have actually done this exact thing myself. See
> > http://www.telepath.com/dennison/Ted/Fodderbot/Fodderbot.html .
> 
> If you want to try writing your AI in Scheme rather than Lisp, I have

Actually, it wasn't written in Lisp. I used CLIPS, which is a
public-domain (forward?-chaining) rule-based expert system language
and inference engine. At one point, I think there was even an Ada(83)
implementation of CLIPS. Unfortunately, the C version has been the one
that people have been maintaining, so I think the Ada version is a bit
of a dead letter at this point.

> Ada bindings for GUILE at
> http://www.cs.utexas.edu/users/bdbryant/guile-for-ada/index.html,
> licensed as GPL + standard exeption for instantiations.

Cool. I did something quite similar for CLIPS, which is available at
http://www.telepath.com/dennison/Ted/AdaClips/AdaClips.html .

> Also, for non-traditional "AI" such as neural networks and genetic

I don't know about "non-traditional". Those have been topics in every
AI course I've ever seen. I'm told that load balancing used to be
considered "AI" too, several decades ago. My CS1&2 instructor at
Tulane used to half-jokingly define AI as "anything that's hard". :-)

-- 
T.E.D.
Home     -  mailto:dennison@telepath.com (Yahoo: Ted_Dennison)
Homepage -  http://www.telepath.com/dennison/Ted/TED.html