@@ -61,14 +62,14 @@ name="links section"> of the Master Site (given above).
If you find any mistakes, know of updates to one of the items below,
-or have problems compiling and of the applications, please mail me at:
- and I'll see what I
-can do.
+or have problems compiling any of the applications, please mail me at:
+
+and I'll see what I can do.
If you know of any AI/Alife applications, class libraries,
-etc. Please about
-them. Include your name, ftp and/or http sites where they can be
+etc. Please
+about them. Include your name, ftp and/or http sites where they can be
found, plus a brief overview/commentary on the software (this info
would make things a lot easier on me... but don't feel obligated ;).
@@ -221,10 +222,11 @@ LICENSE
- - Web site:
+
+ - Web site:
-
A library for the Python programming language that provides an
object oriented interface to the CLIPS expert system tool. It
@@ -237,6 +239,25 @@ LICENSE
+
+
+ - Web site:
+
+
+ LK is an implementation of the Lin-Kernighan heuristic for the
+ Traveling Salesman Problem and for the minimum weight perfect matching
+ problem. It is tuned for 2-d geometric instances, and has been applied
+ to certain instances with up to a million cities. Also included are
+ instance generators and Perl scripts for munging TSPLIB instances.
+
+ This implementation introduces ``efficient cluster compensation'', an
+ experimental algorithmic technique intended to make the Lin-Kernighan
+ heuristic more robust in the face of clustered data.
+
+
@@ -264,8 +285,8 @@ LICENSE
url="http://lynx.eaze.net/~pdkb/web/"
name="lynx.eaze.net/~pdkb/web/">
- SourceForge site:
+ url="http://sourceforge.net/project/pdkb/"
+ name="sourceforge.net/project/pdkb">
Public Domain Knowledge Bank (PDKB) is an Artificial Intelligence
@@ -288,13 +309,40 @@ LICENSE
this directory for release info.
+
+
+ - Web site:
+
+
+ QUANT/1 stands for type QUANTifier. It aims to be an alternative to
+ Prolog-like (Resulutional-like) systems. Main features include a lack
+ of necessity for eliminating Quantifiers, scolemisation, ease of
+ comprehension, large scale formulae operation, acceptance of nonHorn
+ formulaes, and Iterative deeping. The actual library implemented in
+ this project is called ATPPCF (Automatic Theorem Prover in calculus of
+ Positively Constructed Formulae).
+
+ ATPPCF will be a library (inference engine) and an extension of the
+ Predicate Calculus Language as a new logical language. The library will
+ be incorporable in another software such as TCL, Python, Perl. The
+ engine's primary inference method will be the "search of inference in
+ language of Positively Constructed Formulas (PCFs)" (a subset of
+ Predicate Calculus well translated in both directions). The language
+ will be used as scripting language to the engine. But there will be
+ possibility to replace it with extensions languages of main software.
+
+
- - Web site:
-
-
+
+ - Web site:
+
Screamer is an extension of Common Lisp that adds support for
nondeterministic programming. Screamer consists of two
@@ -366,13 +414,13 @@ LICENSE
and much faster than Boltzmann annealing, where T = T_0/ln k.
-
- - FTP site:
-
-
+
+ - FTP site:
+
BABYLON is a modular, configurable, hybrid environment for
developing expert systems. Its features include objects, rules with
@@ -380,16 +428,30 @@ LICENSE
is implemented and embedded in Common Lisp.
+
+
+ - Web site:
+
+
+ Cfengine, or the configuration engine is a very high level language for
+ building expert systems which administrate and configure large computer
+ networks. Cfengine uses the idea of classes and a primitive form of
+ intelligence to define and automate the configuration of large systems
+ in the most economical way possible. Cfengine is design to be a part of
+ computer immune systems.
- - Web site:
-
+
+ - Web site:
+
-
The CLEARS system is an interactive graphical environment for
computational semantics. The tool allows exploration and
comparison of different semantic formalisms, and their
@@ -399,11 +461,12 @@ LICENSE
-
- - Web site:
-
-
+
+ - Web site:
+
CLIG is an interactive, extendible grapher for visualizing linguistic
data structures like trees, feature structures, Discourse
@@ -416,13 +479,15 @@ LICENSE
- - Web site:
- - FTP site:
-
-
-
-
+
+ - Web site:
+ - FTP site:
+
+
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.
@@ -454,8 +519,6 @@ LICENSE
rules - collectible into sets, horn clauses, and constraint networks)
a graphic interface based on the X11 Window System and the OSF/Motif
Widget Library has been provided.
-
-
@@ -522,11 +585,12 @@ LICENSE
- - Web site:
-
-
-
+
+ - Web site:
+
+
The GSM Suite is a set of programs for using Finite State
Machines in a graphical fashion. The suite consists of programs
that edit, compile, and print state machines. Included in the
@@ -539,11 +603,12 @@ LICENSE
- - Web site:
-
-
-
+
+ - Web site:
+
+
Illuminator is a toolset for developing OCR and Image
Understanding applications. Illuminator has two major parts: a
library for representing, storing and retrieving OCR
@@ -557,48 +622,91 @@ LICENSE
- 5 magnification levels for images
- flagged characters and words
- - unicode support -- American, British, French, German, Greek, Italian, MICR, Norwegian, Russian, Spanish, Swedish, keyboards
+ - unicode support -- American, British, French, German,
+ Greek, Italian, MICR, Norwegian, Russian, Spanish, Swedish,
+ keyboards
- reads DAFS, TIFF's, PDA's (image only)
- save to DAFS, ASCII/UTF or Unicode
- - Entity Viewer - shows properties, character choices, bounding boxes image fragment for a selected entity, change type, change content, hierarchy mode
+ - Entity Viewer - shows properties, character choices,
+ bounding boxes image fragment for a selected entity, change
+ type, change content, hierarchy mode
+
+
+ - Web site:
+
+
+ Isabelle is a popular generic theorem prover developed at Cambridge
+ University and TU Munich. Existing logics like Isabelle/HOL provide a
+ theorem proving environment ready to use for sizable applications.
+ Isabelle may also serve as framework for rapid prototyping of deductive
+ systems. It comes with a large library including Isabelle/HOL
+ (classical higher-order logic), Isabelle/HOLCF (Scott's Logic for
+ Computable Functions with HOL), Isabelle/FOL (classical and
+ intuitionistic first-order logic), and Isabelle/ZF (Zermelo-Fraenkel
+ set theory on top of FOL).
+
- - Web site:
-
-
-
+
+ - Web site:
+
+
Jess is a clone of the popular CLIPS expert system shell written
entirely in Java. With Jess, you can conveniently give your
applets the ability to 'reason'. Jess is compatible with all
versions of Java starting with version 1.0.2. Jess implements
the following constructs from CLIPS: defrules, deffunctions,
defglobals, deffacts, and deftemplates.
-
- - FTP site:
+ - FTP site:
-
Learn is a vocable learning program with memory model.
+
+
+ - Web site:
+
+
+ NICOLE (Nearly Intelligent Computer Operated Language Examiner) is a
+ theory or experiment that if a computer is given enough combinations of
+ how words, phrases and sentences are related to one another, it could
+ talk back to you. It is an attempt to simulate a conversation by
+ learning how words are related to other words. A human communicates
+ with NICOLE via the keyboard and NICOLE responds back with its own
+ sentences which are automatically generated, based on what NICOLE has
+ stored in it's database. Each new sentence that has been typed in, and
+ NICOLE doesn't know about, is included into NICOLE's database, thus
+ extending the knowledge base of NICOLE.
+
+
- - Web site:
-
-
+
+ - Web site:
+
Our current automated deduction system Otter is designed to prove
theorems stated in first-order logic with equality. Otter's
@@ -846,18 +954,17 @@ LICENSE
- - Web site:
-
-
-
+
+ - Web site:
+
IDEAL is a test bed for work in influence diagrams and
Bayesian networks. It contains various inference algorithms
for belief networks and evaluation algorithms for influence
diagrams. It contains facilities for creating and editing
influence diagrams and belief networks.
-
IDEAL is written in pure Common Lisp and so it will run in
Common Lisp on any platform. The emphasis in writing IDEAL has
@@ -865,28 +972,42 @@ LICENSE
abstractions. It thus is very suitable for experimental
implementations which need or extend belief network
technology.
-
At the highest level, IDEAL can be used as a subroutine
library which provides belief network inference and influence
diagram evaluation as a package. The code is documented in a
detailed manual and so it is also possible to work at a lower
level on extensions of belief network methods.
-
IDEAL comes with an optional graphic interface written in
CLIM. If your Common Lisp also has CLIM, you can run the
graphic interface.
+
+
+ - Web site:
+
+
+ Jet's Neural Architecture is a C++ framework for doing neural net
+ projects. The goals of this project were to make a fast, flexible
+ neural architecture that isn't stuck to one kind of net and to make
+ sure that end users could easily write useful applications. All the
+ documentation is also easily readable.
+
+
- - FTP site:
-
+
+ - FTP site:
+
-
A simple, fast, efficient C++ Matrix class designed for
scientists and engineers. The Matrix class is well suited for
applications with complex math algorithms. As an demonstration
@@ -897,10 +1018,11 @@ LICENSE
- - Web site:
-
-
+
+ - Web site:
+
nunu is a multi-layered, scriptable, back-propagation neural network.
It is build to be used for intensive computation problems scripted
@@ -1138,10 +1260,11 @@ LICENSE
- - Web site:
+ - Web site:
-
Jbpe is a back-propagation neural network editor/simulator.
Features
@@ -1157,14 +1280,34 @@ LICENSE
+
+
+ - Web site:
+
+
+ neuralnets is a text-based program that allows someone to build,
+ configure, train and run a Neural Network application. The code is
+ written in Java and is easily extended or included within other code.
+ The application comes ready to go with a Back Prop algorithm included.
+ Well known applications...stock market, weather prediction, scheduling,
+ image recognition, expert systems, research...basically anywhere you
+ may need to make a complicated decision.
+
+
- - Web site:
- - FTP site:
-
-
+
+ - Web site:
+ - FTP site:
+
The Neural Network Generator is a genetic algorithm for the
topological optimization of feedforward neural networks. It
@@ -1438,6 +1581,25 @@ LICENSE
environments.
+
+
+ - Web site:
+
+
+ XNBC v8 is a simulation tool for the neuroscientists interested in
+ simulating biological neural networks using a user friendly tool.
+
+ XNBC is a software package for simulating biological neural networks.
+
+ Four neuron models are available, three phenomenologic models (xnbc,
+ leaky integrator and conditional burster) and an ion-conductance based
+ model. Inputs to the simulated neurons can be provided by experimental
+ data stored in files, allowing the creation of `hybrid'' networks.
+
+
@@ -1483,6 +1645,20 @@ LICENSE
problem-solving strategies to spread to the whole population of GAs.
+
+
+ - Web site:
+
+
+ Ease - Evolutionary Algorithms Scripting Evironment - is an extension
+ to the Tcl scripting language, providing commands to create, modify,
+ and evaluate populations of individuals represented by real number
+ vectors and/or bit strings.
+
+
- - (optional) A new Graphical User Interface, based on TCL/TK, for
- Unix users, allowing easy running of GALOPPS 3.2 (single or multiple
- subpopulations) on one or more processors. GUI writes/reads
- "standard" GALOPPS input and master files, and displays graphical
- output (during or after run) of user-selected variables.
+
- (optional) A new Graphical User Interface, based on TCL/TK,
+ for Unix users, allowing easy running of GALOPPS 3.2 (single
+ or multiple subpopulations) on one or more processors. GUI
+ writes/reads "standard" GALOPPS input and master files, and
+ displays graphical output (during or after run) of
+ user-selected variables.
- 5 selection methods: roulette wheel, stochastic remainder
sampling, tournament selection, stochastic universal sampling,
linear-ranking-then-SUS.
- Random or superuniform initialization of "ordinary"
(non-permutation) binary or non-binary chromosomes; random
- initialization of permutation-based chromosomes; or user-supplied
- initialization of arbitrary types of chromosomes.
+ initialization of permutation-based chromosomes; or
+ user-supplied initialization of arbitrary types of chromosomes.
- Binary or non-binary alphabetic fields on value-based
chromosomes, including different user-definable field sizes.
- 3 crossovers for value-based representations: 1-pt, 2-pt, and
- uniform, all of which operate at field boundaries if a non-binary
- alphabet is used.
+ uniform, all of which operate at field boundaries if a
+ non-binary alphabet is used.
- 4 crossovers for order-based reps: PMX, order-based, uniform
order-based, and cycle.
- 4 mutations: fast bitwise, multiple-field, swap and random
@@ -1672,7 +1849,6 @@ LICENSE
given function and terminal set.
-
@@ -1680,7 +1856,6 @@ LICENSE
http://www.turbopower.com/˜kimk/gpjpp.asp
- Anyone who knows where to find gpjpp, please let me know.
-
gpjpp is a Java package I wrote for doing research in genetic
programming. It is a port of the gpc++ kernel written by Adam
@@ -1694,11 +1869,11 @@ LICENSE
- Koza's greedy over-selection option for large populations
- extensible GPRun class that encapsulates most details of a
genetic programming test
-
- more robust and efficient streaming code, with automatic checkpoint
- and restart built into the GPRun class
+
- more robust and efficient streaming code, with automatic
+ checkpoint and restart built into the GPRun class
- an explicit complexity limit that can be set on each GP
-
- additional configuration variables to allow more testing without
- recompilation
+
- additional configuration variables to allow more testing
+ without recompilation
- support for automatically defined functions (ADFs)
- tournament and fitness proportionate selection
- demetic grouping
@@ -1732,13 +1907,26 @@ LICENSE
random number generator, internal parameter checks.
+
+
+ - Web site:
+
+
+ Simple genetic algorithm package written in Java.
+
- Web site:
- - FTP site:
+ url="http://GARAGe.cps.msu.edu/software/software-index.html#lilgp"
+ name="GARAGe.cps.msu.edu/software/software-index.html#lilgp">
+ - FTP site:
-
lil-gp is a generic 'C' genetic programming tool. It was written
with a number of goals in mind: speed, ease of use and support for a
number of options including:
- Generic 'C' program that runs on UNIX workstations
-
- Support for multiple population experiments, using arbitrary and
- user settable topologies for exchange, for a single processor (i.e.,
- you can do multiple population gp experiments on your PC).
-
- lil-gp manipulates trees of function pointers which are allocated
- in single, large memory blocks for speed and to avoid swapping.
+
- Support for multiple population experiments, using
+ arbitrary and user settable topologies for exchange, for
+ a single processor (i.e., you can do multiple population gp
+ experiments on your PC).
+
- lil-gp manipulates trees of function pointers which are
+ allocated in single, large memory blocks for speed and to
+ avoid swapping.
* The patched lil-gp kernel is strongly-typed, with modifications on
multithreading, coevolution, and other tweaks and features.
+
+
+ - Web site:
+
+
+ Lithos is a stack based evolutionary computation system. Unlike most EC
+ systems, its representation language is computationally complete, while
+ also being faster and more compact than the S-expressions used in
+ genetic programming. The version presented here applies the system to
+ the game of Go, but can be changed to other problems by simply plugging
+ in a different evaluation function. ANSI C source code is provided.
+
+
- - Web site:
- - FTP site:
+ - Web site:
+ - FTP site:
-
PGAPack is a general-purpose, data-structure-neutral, parallel
genetic algorithm library. It is intended to provide most capabilities
desired in a genetic algorithm library, in an integrated, seamless,
@@ -1854,13 +2062,15 @@ LICENSE
- - Web site:
+ - Web site:
-
- ADATE (Automatic Design of Algorithms Through Evolution) is a system for
- automatic programming i.e., inductive inference of algorithms, which
- may be the best way to develop artificial and general intelligence.
+ ADATE (Automatic Design of Algorithms Through Evolution) is a system
+ for automatic programming i.e., inductive inference of algorithms,
+ which may be the best way to develop artificial and general
+ intelligence.
The ADATE system can automatically generate non-trivial and novel
@@ -1906,8 +2116,8 @@ LICENSE
url="http://corewars.sourceforge.net/"
name="corewars.sourceforge.net/">
- SourceForge site:
+ url="http://sourceforge.net/project/corewars/"
+ name="sourceforge.net/project/corewars/">
Corewars is a game which simulates a virtual machine with a number of
@@ -1986,6 +2196,19 @@ LICENSE
+
+
+ - Web site:
+
+
+ Grany-3 is a full-featured cellular automaton simulator, made in C++
+ with Gtk--, flex++/bison++, doxygen and gettext, useful to granular
+ media physicists.
+
+
- - Web site:
- - FTP site:
-
+
+ - Web site:
+ - FTP site:
+
CASE (Cellular Automaton Simulation Environment) is a C++
toolkit for visualizing discrete models in two dimensions:
@@ -2048,14 +2275,40 @@ LICENSE
automata using the best, standardized technology of the day.
-
+
+
+ - Web site:
+
+
+ The Integrating Modelling Toolkit (IMT) is a generic, comprehensive,
+ and extensible set of abstractions allowing definition and use of
+ interoperable model components. Modellers create an IMT "world" made
+ of IMT "agents" that will perform each a particular phase of a
+ modelling task. The core set of IMT agents can describe generic,
+ modular, distributed model components, either native to the IMT or
+ integrating existing simulation toolkits, specialized for tasks that
+ range from simple calculation of functions in an interpreted language
+ to spatially explicit simulation, model optimization, GIS analysis,
+ visualization and advanced statistical analysis. IMT agents are
+ designed to easily "glue" together in higher-level simulations
+ integrating different modelling paradigms and toolkits. The IMT can be
+ easily extended by users and developers through a convenient plug-in
+ mechanism
+
+
- - Web site:
- - FTP site:
-
-
+
+ - Web site:
+ - FTP site:
+
The universal constructor of John von Neumann is an extension of
the logical concept of universal computing machine. In the cellular
@@ -2068,12 +2321,31 @@ LICENSE
containing its own description, this is capable of self-reproducing.
+
+
+ - Web site:
+
+
+ The current version of MAML is basically an extension to Objective-C
+ (using the Swarm libraries). It consists of a couple of
+ 'macro-keywords' that define the general structure of a simulation. The
+ remaining must be filled with pure swarm-code. A MAML-to-Swarm (named
+ xmc) compiler is also being developed which compiles the source code
+ into a swarm application.
+
- - Web site:
- - FTP site:
+ - Web site:
+ - FTP site:
@@ -2086,10 +2358,6 @@ LICENSE
demos and good documentation.
- Swarm 1.0 is out. It requires libtclobjc and BLT 2.1
- (both available at the swarm site).
-
-
@@ -2105,6 +2373,19 @@ LICENSE
+
+
+ - Web site:
+
+
+ Achilles is an evolution simulation based on Larry Yaeger's PolyWorld.
+ It uses Hebbian neural networks, and an extremely simplified physical
+ model that allows virtual organisms to interact freely in a simulated
+ environment.
+
+
+ - Web site:
+
+
+ This project is an ANSI C++ implementation of the Generalized Langton
+ Ant, which lives on a torus.
+
+
- SourceForge site:
+ url="http://sourceforge.net/project/glife/"
+ name="sourceforge.net/project/glife/">
This program is similiar to "Conway's Game of Life" but yet it is very
@@ -2503,7 +2796,7 @@ name="theory.org/software/ant/">
- Autonomous Agents
+ Agents
Also known as intelligent software agents or just agents, this
area of AI research deals with simple applications of small
@@ -2555,26 +2848,21 @@ name="theory.org/software/ant/">
current state.
+
+
+ - Web site:
+ - Download site:
+
-
-
- - Web site:
- - FTP site:
-
-
-
- A transportable agent is a program that can migrate from machine
- to machine in a heterogeneous network. The program chooses when and
- where to migrate. It can suspend its execution at an arbitrary point,
- transport to another machine and resume execution on the new machine.
- For example, an agent carrying a mail message migrates first to a
- router and then to the recipient's mailbox. The agent can perform
- arbitrarily complex processing at each machine in order to ensure that
- the message reaches the intended recipient.
-
+ Another Java based agent development framework. Fairly unique in that
+ it emphasizes the use of a GUI for designing the system which will
+ "semi-automatically synthesize multiagent systems to meet those
+ requirements". You need a java enabled browser to download. :P
@@ -2653,6 +2941,64 @@ name="theory.org/software/ant/">
developers to build flexible open distributed systems that make optimal
use of existing applications.
+
+
+
+ - Web site: