Artificial Intelligence FAQ:6/6 AI Software [Monthly posting]
Section 1 of 3 - Prev - Next All sections - 1 - 2 - 3
Archive-name: ai-faq/general/part6
Posting-Frequency: monthly
Version: 2.1
Maintainer: Ric Crabbe and Amit Dubey
URL: http://www.faqs.org/faqs/ai-faq/general/part6/preamble.html
Size: 82158 bytes, 1700 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Amit Dubey, Ric Crabbe, and Mark Kantrowitz
;;; ai_6.faq
If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to the maintainers.
Part 6 (AI Open-Source and Other Software by Sub-field)
[6-1] Languages
[6-2] General AI Software
[6-3] Well-known Classics
the rest of the sections are an alphabetical listing by topic:
[6-4] Agent Modelling, Artificial Life
[6-5] Blackboard Architectures, Case Based Reasoning, Chatbots,
Chess, Constraint Programming
[6-6] Data Mining, Defeasible Reasoning, Expert Systems
[6-7] Frame Systems, Fuzzy Logic, Games, General, Genetic Algorithms, ICOT
[6-8] Knowledge Representation, Machine Learning, Medical
[6-9] Natural Language Processing
[6-9a] Speech
[6-10] Neural Networks
[6-11] Organizations, Pedegogy, Probability, Planning, Qualitative Reasoning
[6-12] Robotics
[6-13] Temporal Reasoning, Theorem Proving, Truth Maintenance
[6-14] Search, Simulated Annealing
the following are commercial AI software.
[6-15] Constraint Satisfaction
Search for [#] to get to question number # quickly.
--------------------------------------------------------------------
Subject: [6-1] Languages
Its assumed that you can find your way to common languages like
LISP, C++ or Prolog by doing a web search; what are listed here are
some other languages that AI researchers may find
interesting. [Because I had trouble finding a good prolog recently,
I've added some prolog listings here.]
XSB Prolog:
XSB is a Logic Programming and Deductive Database system for Unix
and Windows. It is being developed at The Computer Science
Department, Stony Brook University, in collaboration with
Katholieke Universiteit Leuven, Universidade Nova de Lisboa, and
Uppsala Universitet. http://xsb.sourceforge.net/
Amzi! Prolog + Logic Server:
"Embed Prolog rule-based components in C/C++, Java, Delphi, Visual
Basic, Web Servers and more. Develop Unicode and/or ASCII
logic-bases using the Windows interactive development environment
(IDE). Integrate them with ODBC databases. Deploy them with the
Logic Server Libraries. Extend Amzi! Prolog with your own
functions/libraries. For Windows, Linux, Solaris, HP/UX. Available
on any other platform with a custom port (see below). Royalty-free
runtime" http://www.amzi.com/products/prolog_products.htm
Free Academic, Personal & Evaluation License.
Mozart:
Mozart is an advanced development platform for intelligent,
distributed applications. The system is the result of a decade of
research in programming language design and implementation,
constraint-based inferencing, distributed computing, and
human-computer interfaces.
JEOPS - The Java Embedded Object Production System:
It's a project intended to give Java the power of production
systems. JEOPS adds forward chaining, first-order production rules
to Java through a set of classes designed to provide this language
with some kind of declarative programming. With that, the
development of intelligent applications, such as software agents or
expert systems is facilitated.
http://www.di.ufpe.br/~csff/jeops/
KIEV:
Kiev is a backwards-compatible extension of Java that includes support
for (amount other things) lambda-calculus closures (ie functional
programming) and Prolog-like logic programming. Please see
http://www.forestro.com/kiev/index.html
LAMBDA-CALCULUS-BASED LANGUAGES:
LISP's theoretical origins lie in Church's lambda calculus. A number of
new languages that fix some shortcomings of LISP's implementation of the
lambda calculus are Scheme (simpler and fully tail recursive), ML
(support for types using the typed lambda calculus;
cm.bell-labs.com/cm/cs/what/smlnj/sml97.html) and Hashell (like ML but
it implements lazy evaluation properly; www.haskell.org).
POPLOG:
POPLOG is a multi-language software development environment
providing incremental compilers for a number of interactive
programming languages, notably: Pop-11, Prolog, and Common Lisp.
http://www.cs.bham.ac.uk/research/poplog/poplog.info.html
CLIPS:
CLIPS is a productive development and delivery expert system tool
which provides a complete environment for the construction of rule
and/or object based expert systems. CLIPS is used throughout the
public and private community including: all NASA sites and branches
of the military, numerous federal bureaus, government contractors,
universities, and many companies. The CLIPS home page is:
http://www.ghgcorp.com/clips/CLIPS.html
SCREAMER:
Screamer is an extension of Common Lisp that adds support for
nondeterministic programming. Screamer consists of two levels. The
basic nondeterministic level adds support for backtracking and
undoable side effects. On top of this nondeterministic substrate,
Screamer provides a comprehensive constraint programming language in
which one can formulate and solve mixed systems of numeric and
symbolic constraints. Together, these two levels augment Common Lisp
with practically all of the functionality of both Prolog and
constraint logic programming languages such as CHiP and CLP(R).
Furthermore, Screamer is fully integrated with Common Lisp. Screamer
programs can coexist and interoperate with other extensions to Common
Lisp such as CLOS, CLIM and Iterate.
In several ways Screamer is more efficient than other implementations
of backtracking languages. First, Screamer code is transformed into
Common Lisp which can be compiled by the underlying Common Lisp
system. Many competing implementations of nondeterministic Lisp are
interpreters and thus are far less efficient than Screamer. Second,
the backtracking primitives require fairly low overhead in Screamer.
Finally, this overhead to support backtracking is only paid for those
portions of the program which use the backtracking primitives.
Deterministic portions of user programs pass through the Screamer to
Common Lisp transformation unchanged. Since in practise, only small
portions of typical programs utilize the backtracking primitives,
Screamer can produce more efficient code than compilers for languages
in which backtracking is more pervasive.
Screamer is fairly portable across most Common Lisp implementations.
It currently runs under Genera 8.1.1 and 8.3 on both Symbolics 36xx
and Ivory machines, under Lucid 4.0.2 and 4.1 on Sun SPARC machines,
under MCL 2.0 and 2.0p2 on Apple Macintosh machines, and under Poplog
Common Lisp on Sun SPARC machines. It should run under any
implementation of Common Lisp which is compliant with CLtL2 and with
minor revision could be made to run under implementations compliant
with CLtL1 or dpANS.
Screamer is available by anonymous FTP from
ftp.cis.upenn.edu:/pub/screamer.tar.Z
Contact Jeffrey Mark Siskind or David McAllester
for more information.
The Screamer Tool Repository, a collection of user-contributed
Screamer code, is available by anonymous ftp from
ftp.cis.upenn.edu:/pub/screamer-tools/
or by WWW from
http://www.cis.upenn.edu/~screamer-tools/home.html
Please direct all inquires about the repository to
screamer-repository@cis.upenn.edu.
--------------------------------------------------------------------
Subject: [6-2] General AI Software
"AGLETS"
IBM has created a software package for creating internet agents using
Java applets. It's an interesting concept, and worth a look. See
http://www.trl.ibm.co.jp/aglets/
--------------------------------------------------------------------
Subject: [6-3] Well-known Classics
For a large collection of Eliza programs, see
ftp.cs.cmu.edu:/user/ai/areas/classics/
The software from Peter Norvig's book "Paradigms of AI Programming" is
available by anonymous ftp from unix.sri.com:/pub/norvig/ and on disk in
Macintosh or DOS format from the publisher, Morgan Kaufmann. The
software includes Common Lisp implementations of: Eliza and pattern
matchers, Emycin, Othello, Parsers, Scheme interpreters and compilers,
Unification and a prolog interpreter and compiler, Waltz
line-labelling, implementation of GPS, macsyma, and random number
generators. For more information, write to Morgan Kaufmann, Dept. P1,
2929 Campus Drive, Suite 260, San Mateo CA 94403, call 800-745-7323,
or fax 415-578-0672. (Mac ISBN 1-55860-227-5; DOS 3.5" ISBN
1-55860-228-3; or DOS 5.25" ISBN 1-55860-229-1).
The doctor.el is an implementation of Eliza for GNU-Emacs
emacs-lisp. Invoke it with "Meta-X doctor".
The original Parry (in MLISP for a PDP-10) is available in
labrea.stanford.edu:/pub/parry.tar.Z.
RACTER is *not* public domain. It costs $50 for MS-DOS and Macintosh
versions, the Inrac compiler is $200 (MS-DOS only), and the Inrac
manual alone is $25. Racter is available from John Owens, INRAC
Corp./Nickers International Ltd., 12 Schubert Street, Staten Island,
NY 10305, Tel: 718-448-6283, or Fax: 718-448-6298. Racter was
published in 1984, and written in compiled BASIC. To read some of
RACTER's work, see "The Policeman's Beard is Half Constructed",
Computer Prose and Poetry by Racter, Warner Books, 1984. ISBN
0-446-38051-2 (paperback). Written by William Chamberlain and Thomas
Etter. Some discussion of RACTER appears in A.K. Dewdney's book, "The
Armchair Universe". The Macintosh version runs only on SEs and Pluses
(it comes on a single-sided 400k copy-protected disk, with an old
version of the system). Racter is also sold by the following
mail-order software retailer: Mindware, 1803 Mission Street, Suite
414, Santa Cruz, CA 95060-5292, phone 800-447-0477 (408-427-9455),
fax 408-429-5302. Mindware sells a variety of similar programs for
MS-DOS and Windows, including Joseph Weintraub's PC Therapist.
You can nab a copy of Terry Winograd's seminal SHRDLU from
ftp://ftp.cc.utexas.edu/pub/AI_ATTIC/Programs/Classic/Shrdlu
--------------------------------------------------------------------
Subject: [6-4] Agent Modelling - Artificial Life
In addition to programs available free by anonymous ftp, we've
included some programs which are available by contacting the authors,
and some programs which charge a nominal fee.
Agent Modelling:
ANIMALS is a simulation system written by Toby Tyrrell,
, for his PhD thesis. The thesis examines the
problem of action selection when dealing with realistic, animal-like
situations: how to choose, at each moment in time, the most
appropriate out of a repertoire of possible actions. It includes a
description is given of a simulated environment which is an extensive
and detailed simulation of the problem of action selection for
animals. This simulated environment is used to investigate the
adequacy of several theories of action selection (from both ethology
and artificial intelligence) such as the drive model, Lorenz's
psycho-hydraulic model and Maes' spreading activation network, and
outlines deficiencies in each mechanism. Finally, it proposes a new
approach to action selection is developed which determines the most
appropriate action in a principled way, and which does not suffer from
the inherent shortcomings found in other methods. The thesis includes
a review and bibliography of existing work on action selection. The
thesis is available by anonymous ftp from
ftp.ed.ac.uk:/pub/lrtt/ [129.215.146.5]
as the files as.1.ps.Z, as.2.ps.Z, ..., and as.7.ps.Z.
The simulation software is also available from the same site, as the
file se.tar.Z. The simulation software was written in Suntools rather
than Xtools. It can be run only from SunView or OpenWindows. The
action selection problem modelled by the simulated environment
comprises 15 different `sub-problems' (getting food, reproducing, not
getting lost, being vigilant for predators, etc), many internal and
external stimuli, and 35 different low-level actions to select
between.
***ViewGen SCHEDULED TO BE DELETED FROM THE FAQ***
ViewGen (Viewpoint Generator) is a Prolog program that implements a
"Belief Ascription Algorithm" as described in Ballim and Wilks (see the
bibliography section on User Modelling). This can be seen as a form of
agent modelling tool, which allows for the generation of arbitrarily deep
nested belief spaces based on the system's own beliefs, and on beliefs
that are typically held by groups of agents. ViewGen is available by
anonymous ftp from
crl.nmsu.edu:/pub/non-lexical/ViewFinder [128.123.1.18] (user anonymous)
ftp.ims.uni-stuttgart.de:/pub/ballim [141.58.127.8] (user ftp)
as the file ViewGen.tar.Z. The theory of belief ascription upon which
it is based is described in detail in Ballim and Wilks, and a general
framework for attributing and maintaining nested propositional
attitudes is described in Afzal Ballim's dissertation which is
archived with the Viewgen program (in the files
ViewFinder-{A4/A5/US}.tar.Z,
the variable part indicating the format of the PostScript file).
The inheritance reasoner is in the file vf-hetis.tar.Z.
Implemented in Sicstus prolog, and hence easily convertible to
any Edinburgh-style prolog. Contact Afzal Ballim
for more information.
http://www.cl.cam.ac.uk/users/rwab1/agents.html
Ralph.Becket@cl.cam.ac.uk
http://www.cs.bham.ac.uk/~amw/agents/index.html
[Interface Agents]
Andy Wood
http://www.cs.umbc.edu/agents/
[Tim Finin's Software Agents Page]
Artificial Life:
http://alife.santafe.edu/
One of the major institutions do Artificial Life research, The
Santa Fe Institute's web page has lots of information.
Swarm is a software package for multi-agent simulation of complex
systems, originally developed at the Santa Fe Institute. Swarm is
intended to be a useful tool for researchers in a variety of
disciplines. The basic architecture of Swarm is the simulation of
collections of concurrently interacting agents: with this
architecture, we can implement a large variety of agent based models.
See: http://www.swarm.org/
Tierra is an artificial life system for studying the evolution of
digital organisms. Tierra consists of a virtual computer and its
operating system, whose architecture has been designed in such a way
that the executable machine codes are evolvable. This means that the
machine code can be mutated (by flipping bits at random) or recombined
(by swapping segments of code between algorithms), and the resulting
code remains functional enough of the time for natural (or presumably
artificial) selection to be able to improve the code over time.
Tierra runs on Unix, Win32, the Amiga and MS-DOS. Tierra's homepage is at:
http://www.isd.atr.co.jp/~ray/tierra/
The software can be downloaded from
alife.santafe.edu:/pub/SOFTWARE/Tierra [192.12.12.130]
To be added to the tierra-announce mailing list, send an email to
Tom Ray (the author of Tierra as well as the list administrator) at
ray@santafe.edu. Send bug reports or questions about the code or
installation to tierra-bug@life.slhs.udel.edu.
For those without access to anonymous ftp, the Tierra software may be
obtained on disk for $50 ($20 for upgrades) from Virtual Life c/o Tom Ray,
ATR HIP Labs, 2-2 Hikaridai Seika-cho Soraku-gun Kyoto 619-02 Japan. The
software ships on PC formatted disks, but contains the source for all
versions.
------------------------------------------------------------------
Subject: [6-5] Blackboard Architectures - Constraint Programming
Blackboard Architectures:
***GBB SCHEDULED TO BE DELETED FROM THE FAQ***
GBB (PD Version) -- ftp.cs.umass.edu:/gbb/
Case-based Reasoning:
***CL-Protos SCHEDULED TO BE DELETED FROM THE FAQ***
CL-Protos -- ftp.cs.utexas.edu:/pub/porter/
(Get the README file for more information)
Contact: Bruce W. Porter
Ray Bareiss
Erik Eilerts
Dan Dvorak
***MICRO-xxx SCHEDULED TO BE DELETED FROM THE FAQ***
MICRO-xxx -- ftp.cs.umd.edu:/pub/schank/icbr/
Contact: waander@cs.umd.edu
The directory /pub/schank/icbr/ contains the complete
code for "Inside Case-Based Reasoning" by
Riesbeck and Schank, 1989. This includes code
for an instructional version of CHEF by Kristian Hammond.
Chatbots:
AI:
There is a much maligned chatbot at the Warner Brothers page on
the AI movie.
http://aimovie.warnerbros.com
Alice:
A.L.I.C.E. (Artificial Linguistic Internet Computer Entity) is an
award-winning open source natural language artificial intelligence
chat robot. The software used to create A.L.I.C.E. is available as
free open source Alicebot and AIML software. Winner of the 2000
Loebner Prize. See:
http://www.alicebot.org
Mind:
Free public-domain source code of a learning chat-bot based on
"Chomskyan linguistics and the neural feature extraction of Hubel
and Wiesel." The bot starts out knowing little, and tries to learn
to chat with the user. Theory, documentation and source code are
available from:
http://sourceforge.net/projects/mind/
and the JavaScript Mind runs immediately when one clicks on
http://mind.sourceforge.net
while using the Microsoft Internet Explorer browser.
Hippie:
A C-based version of Alice:
http://hippie.alicebot.com/
Chess:
***SAN Kit SCHEDULED TO BE DELETED FROM THE FAQ***
The SAN Kit chess programming C source toolkit provides common routines
for move notation I/O, move generation, move execution, etc. Only search
routines and an evaluation function need be added to obtain a working
chess program. It runs on Apple Macintosh (Think C 5.0),
Commodore Amiga (SAS C), MS-DOS, and Unix. It is available by
anonymous ftp from
raven.alaska.edu:/pub/coherent/sources32/ [137.229.10.39] in the
chess.lm.com:/pub/chess/Unix/
as the compressed tar file SAN.tar.Z or SAN.tar.gz.
Contact Steven J. Edwards for more information.
Constraint Programming and Non-determinism:
Dragonbreath http://www.ai-center.com/projects/dragonbreath/ is an
optimization engine based on constraint programming and local
search. The engine is built to solve search problems, i.e.,
problems for which you don't really know how to construct a
solution but can describe what potential parts a solution can
consist of and which restrictions must be satisfied by the parts /
the parts' constellation. Parts can be variables as well as
structural components. In addition, you can specify a preference
between different solutions, i.e., solve optimization problems.
JACK is a new library providing constraint programming and search for Java.
JACK consists of three components:
- JCHR: Java Constraint Handling Rules
A high-level language to write constraint solvers
- JASE: Java Abstract Search Engine
A generic search engine for JCHR to solve constraint problems
- VisualCHR:
An interactive tool to visualize JCHR computations
JACK and its documentation are available for browser use and for download at:
http://www.pms.informatik.uni-muenchen.de/software/jack/
---------------------------------------------
Subject: [6-6] Data Mining - Expert Systems
Data Mining and Knowledge Discovery in Databases:
***Explora SCHEDULED TO BE DELETED FROM THE FAQ***
Explora is a data mining package written in Lisp for the Macintosh. It
includes a natural language hypertext-type interface for presentation
of dicoveries. It is available at:
http://orgwis.gmd.de:80/explora/
Data Mine
http://www.cs.bham.ac.uk/~anp/TheDataMine.html
[Bibliographies, On-line papers, Software, and Other Resources]
Andy Pryke
Defeasible Reasoning:
An implementation of J. Paris and A. Vencovska's model of belief is
available by anonymous ftp from
ftp.cs.cmu.edu:/user/ai/areas/reasonng/defeasbl/belief/
Paris and Vencovska's paper (Artificial Intelligence, 64(2), December
1993) provides a mathematical model of an agent's belief in an event
by identifying it with his ability to imagine the event within the
context of his previous experience. This approach leads to beliefs
having properties different from those normally ascribed to it. The
implementation was written by Ian Pratt and Jens
Doerpmund and runs in Common Lisp.
Expert Systems:
Free ftpable expert system shells are listed in the Expert Systems
Shells FAQ, which is available by anonymous ftp from
ftp.cs.cmu.edu:/user/ai/pubs/faqs/ai/expert_1.faq
http://www-ksl.stanford.edu/knowledge-sharing/agents.html
[Interactive expert systems and "agents". Includes nice model of
space shuttle engines.]
------------------------------------
Subject: [6-7] Frame Systems - ICOT
Frame Systems:
FrameWork -- ftp.cs.cmu.edu:/user/ai/areas/kr/frames/framework/
Theo -- Contact: Tom.Mitchell@cs.cmu.edu
FrameKit -- Contact: Eric.Nyberg@cs.cmu.edu
KR -- Contact: Brad.Myers@cs.cmu.edu
PARKA -- Contact: spector@cs.umd.edu
Frames for the CM
PARMENIDES (Frulekit) -- Contact: Peter.Shell@cs.cmu.edu
FROBS -- cs.utah.edu:/pub/frobs.tar.Z
Contact: Robert Kessler
PFC -- linc.cis.upenn.edu: ??
YAK -- Contact: Enrico Franconi
Fuzzy Logic:
FLIE -- ural.ethz.ch:/robo/flie/ [129.132.104.194]
Contact: vestli@ifr.ethz.ch
Fuzzy Logic Inference Engine, Institute of Robotics, ETH.
RICE (Routines for Implementing C Expert systems) is a fuzzy/MV logic
inference engine written in C. A C++ front-end with classes is provided.
Tested with Borland C/C++ 3.1, Microsoft C/C++ 7.00 and GCC 2.4.5;
examples are included. Documentation is available in WP 5.1 format and
PostScript. Available by anonymous ftp from ntia.its.bldrdoc.gov and
ftp.cs.cmu.edu. For more info contact Rene' Jager, .
FuNeGen 1.0 is a fuzzy neural system capable of generating fuzzy
classification systems (as C-code) from sample data.
FuNeGen 1.0 and the papers/reports describing the application and the
theoretical background can be obtained by anonymous ftp from
obelix.microelectronic.e-technik.th-darmstadt.de:/pub/neurofuzzy/
Game Playing:
METAGAME is a game-playing workbench for developing and playing
metagame programs. It includes a generator for symmetric chess-like
games; definitions of chess, checkers, chinese chess, shogi, lose
chess, lose checkers, french checkers, and tic tac toe translated into
symmetric chess-like games; a legal move generator; and a variety of
player programs, from simple through sophisticated. The METAGAME
Workbench runs in Quintus or Sictus Prolog. Available by anonymous
ftp from
ftp.cl.cam.ac.uk:/users/bdp/metagame3a.tar.Z [128.232.0.56]
For more information, contact Barney Pell of the
University of Cambridge Computer Laboratory.
General AI:
Generation5: Artificial Intelligence Repository.
http://library.advanced.org/18242/index.shtml
A repository of AI information and code, plus interviews with
famous AI people.
National Research Council of Canada's complete reseource page:
http://ai.iit.nrc.ca/ai_top.html
Genetic Algorithms:
SCS (Simple Classifier System) is a C port of the system from
Appendix D of "Genetic Algorithms in Search, Optimization, and Machine
Learning" by David E. Goldberg. It was ported to C by Erik Mayer
. For more information, contact the author.
SCS-C is another port to C of Goldberg's Simple Classifier System.
It includes some extensions, and runs on Sun 10/30 and Atari ST. SCS-C
is available via anonymous ftp as scs-c-0.98j.tar.Z from
lumpi.informatik.uni-dortmund.de:/pub/LCS/src/ [129.217.36.140]. The
documentation alone is available as scs-c-doc.tar.Z in the directory
/pub/LCS/docs/. For more information, contact Joerg Heitkoetter
, c/o Systems Analysis Group,
LSXI, Department of Computer Science, University of Dortmund, D-44221
Dortmund, Germany.
GENITOR is available by anonymous ftp from the Colorado State
University Computer Science Department in
beethoven.cs.colostate.edu:/pub/GENITOR.tar [129.82.102.183]
For further information, contact starkwea@cs.colostate.edu or
mathiask@cs.colostate.edu. If these fail to work, contact
whitley@cs.colostate.edu.
Other packages are described in detail in Nici Schraudolph's survey
of free and commercial GA software (see the Genetic Algorithms
Repository in [5-1]). Some of the free ones from Nici's list are
summarized below. Many are available from the GA Repository.
GAucsd Genetic algorithms software
cs.ucsd.edu:/pub/GAucsd/GAucsd14.ps.Z [132.239.51.3]
Contact GAucsd-request@cs.ucsd.edu
To be put on a mailing list of GAucsd users, send
the message "add GAucsd" to listserv@cs.ucsd.edu.
GAbench Genetic algorithms benchmarks and test problems
cs.ucsd.edu:/pub/GAbench/
Thomas Kammeyer (tkammeye@cs.ucsd.edu)
EM Evolution Machine (EM)
ftp-bionik.fb10.tu-berlin.de:/pub/software/Evolution-Machine/
[130.149.192.50]
em_tc.exe (EM for Turbo C)
em_tcp.exe (EM for Turbo C++)
em_man.exe (the manual)
Joachim Born
Genie GA-based modeling/forecasting system
Lance Chambers
GENOCOP GEnetic algorithm for Numerical Optimization for
COnstrained Problems. Optimizes function with any
number of linear constraints (equalities and inequalities)
Genetic-2 Optimization package for the linear transportation problem.
Genetic-2N Optimization package for the nonlinear transportation problem.
All three were developed by Zbigniew Michalewicz and are
described in detail in his book "Genetic Algorithms + Data
Structures = Evolution Programs", Springer Verlag,
August 1992.
unccsun.uncc.edu:/coe/evol/ [152.15.10.88]
(also known as ftp.uncc.edu)
Zbigniew Michalewicz
WOLF Simulator for G/SPLINES algorithm (genetic spline models)
ftp://riacs.edu/pub/wolf-4.0.tar.Z
GAC, GAL GA written in C/Lisp. Similar to John Grefenstette's Genesis.
Bill Spears
ESCaPaDE Experiments with evolutionary algorithsm.
Frank Hoffmeister
(Send mail with subject line "help" or "get ESCaPaDE")
mGA1.0 Common Lisp implementation of a messy GA as described in
TCGA report 90004.
SGA-C C-language port and extension of the original Pascal
SGA code presented in Goldberg's book "Genetic
Algorithms in Search, Optimization & Machine
Learning", Addison Wesley, 1989. See TCGA report 91002.
SGA-Cube Goldberg's SGA code modified for nCUBE 2 hypercube
parallel computer.
All three are available by e-mail from
Robert Elliott Smith .
BUGS Demonstrates genetic algorithms.
santafe.edu:/pub/misc/BUGS/
Joshua Smith
SGPC Simple Genetic Programming in C
sfi.santafe.edu:/pub/Users/tackett/
Walter Alden Tackett and Aviram Carmi (gpc@ipld01.hac.com)
GENEsYs lumpi.informatik.uni-dortmund.de:/pub/GA/src/ [129.217.36.140]
Use "ftp" as user name, e-mail address as password.
Thomas Baeck
GAGA Jon Crowcroft . cs.ucl.ac.uk:darpa/gaga.shar
Splicer Steve Bayer
PARAGENESIS GA-Repository/e-mail Michael van Lent
GENESIS GA-Repository/e-mail John Grefenstette
OOGA GA-Repository/e-mail John Grefenstette
DGENESIS Erick Cantu or
.
PGA Parallel Genetic Algorithms testbed
ftp.dai.ed.ac.uk:/pub/pga-2.4/pga-2.4.tar.Z (192.41.104.152)
Peter Ross, peter@aisb.ed.ac.uk
ANT PC Version of 'John Muir Trail' experiment.
ftp.std.com:/pub/pbrennan
Patrick M Brennan
GPQUICK is a simple GP system implemented in C++. It features an
elegant object architecture with function (Function), program
(Chrome), GA (Pop) and problem (Problem) classes. The Problem class
is proposed as a portable representation for problems that would be
source compatible with a variety of other GP systems. GPQUICK uses a
steady state GA, tournament selection, one type of mutation, and
subtree crossover. It uses a fast, compact linear representation for
S-expressions. It includes documentation from the associated magazine
article (Byte, "Some Assembly Required", February 1994). GPQUICK is
available by anonymous ftp from
ftp.cc.utexas.edu:/pub/genetic-programming/code/
Section 1 of 3 - Prev - Next All sections - 1 - 2 - 3
![allanswers.org - Artificial Intelligence FAQ:6/6 AI Software [Monthly posting]](/logo.gif "allanswers.org - Artificial Intelligence FAQ:6/6 AI Software [Monthly posting]"){kind=logo}