GNU/Linux AI & Alife HOWTO by John Eikenberry (easy books to read in english .txt) 📖

Toolkit (HTK) is a portable toolkit for

building and manipulating hidden Markov models. HTK consists of

a set of library modules and tools available in C source form.

The tools provide sophisticated facilities for speech analysis,

HMM training, testing and results analysis. The software

supports HMMs using both continuous density mixture Gaussians

and discrete distributions and can be used to build complex HMM

systems. The HTK release contains extensive documentation and

examples.

 

JCK

 

� Web site: www.pms.informatik.uni-muenchen.de/software/jack/

 

JCK is a new library providing constraint programming and search

for Java.

 

� JCK 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.

 

Source and documentation available from link above.

 

KANREN

 

� Web site: kanren.sourceforge.net

 

KANREN is a declarative logic programming system with first-class relations, embedded in a pure functional subset of Scheme.

The system has a set-theoretical semantics, true unions, fair

scheduling, first-class relations, lexically-scoped logical

variables, depth-first and iterative deepening strategies. The

system achieves high performance and expressivity without cuts.

 

LK

 

� Web site: www.cs.utoronto.ca/~neto/research/lk/

 

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.

 

maxent

 

� Python/C++ version:

homepages.inf.ed.ac.uk/s0450736/maxent_toolkit.html

 

� Java version: maxent.sourceforge.net

 

The Maximum Entropy Toolkit provides a set of tools and library

for constructing maximum entropy (maxent) models in either

Python or C++. It features conditional maximum entropy models,

L-BFGS and GIS parameter estimation, Gaussian Prior smoothing, a

C++ API, a Python extension module, a command line utility, and

good documentation. A Java version is also available.

 

Nyquist

 

� Web site: www-2.cs.cmu.edu/~music/nyquist/

 

The Computer Music Project at CMU is developing computer music

and interactive performance technology to enhance human musical

experience and creativity. This interdisciplinary effort draws

on Music Theory, Cognitive Science, Artificial Intelligence and

Machine Learning, Human Computer Interaction, RealTime Systems,

Computer Graphics and Animation, Multimedia, Programming

Languages, and Signal Processing. A paradigmatic example of

these interdisciplinary efforts is the creation of interactive

performances that couple human musical improvisation with

intelligent computer agents in realtime.

 

OpenCyc

 

� Web site: www.opencyc.org

 

� Alt Web site: sourceforge.net/projects/opencyc/

 

OpenCyc is the open source version of Cyc, the largest and most

complete general knowledge base and commonsense reasoning

engine. An ontology based on 6000 concepts and 60000 assertions

about them.

 

Python Fuzzy Logic Module

 

� FTP site: ftp://ftp.csh.rit.edu/pub/members/retrev/

 

A simple python module for fuzzy logic. The file is ‘fuz.tar.gz’

in this directory. The author plans to also write a simple

genetic algorithm and a neural net library as well. Check the

00_index file in this directory for release info.

 

Screamer

 

� Web site: www.cis.upenn.edu/~screamer-tools/home.html

 

� Latest version is part of CLOCC: clocc.sourceforge.net

 

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.

 

SPASS

 

� Web site: spass.mpi-sb.mpg.de

 

SPASS: An Automated Theorem Prover for First-Order Logic with

Equality

 

If you are interested in first-order logic theorem proving, the

formal analysis of software, systems, protocols, formal

approaches to AI planning, decision procedures, modal logic

theorem proving, SPASS may offer you the right functionality.

 

ThoughtTreasure

 

� Web site: www.signiform.com/tt/htm/tt.htm

 

ThoughtTreasure is a project to create a database of commonsense

rules for use in any application. It consists of a database of a

little over 100K rules and a C API to integrate it with your

applications. Python, Perl, Java and TCL wrappers are already

available.

 

Torch

 

� Web site: www.torch.ch

 

Torch is a machine-learning library, written in C++. Its aim is

to provide the state-of-the-art of the best algorithms. It is,

and it will be, in development forever.

 

� Many gradient-based methods, including multilayered

perceptrons, radial basis functions, and mixtures of experts.

Many small “modules” (Linear module, Tanh module, SoftMax

module, …) can be plugged together.

 

� Support Vector Machine, for classification and regression.

 

� Distribution package, includes Kmeans, Gaussian Mixture

Models, Hidden Markov Models, and Bayes Classifier, and

classes for speech recognition with embedded training.

 

� Ensemble models such as Bagging and Adaboost.

 

� Non-parametric models such as K-nearest-neighbors, Parzen

Regression and Parzen Density Estimator.

�

Torch is an open library whose authors encourage everybody to

develop new packages to be included in future versions on the

official website.

 

2.2. AI software kits, applications, etc.

 

These are various applications, software kits, etc. meant for research

in the field of artificial intelligence. Their ease of use will vary,

as they were designed to meet some particular research interest more

than as an easy to use commercial package.

 

ASA - Adaptive Simulated Annealing

 

� Web site: www.ingber.com/#ASA-CODE

 

� FTP site: ftp.ingber.com/

 

ASA (Adaptive Simulated Annealing) is a powerful global

optimization C-code algorithm especially useful for nonlinear

and/or stochastic systems.

 

ASA is developed to statistically find the best global fit of a

nonlinear non-convex cost-function over a D-dimensional space.

This algorithm permits an annealing schedule for ‘temperature’ T

decreasing exponentially in annealing-time k, T = T_0 exp(-c

k^1/D). The introduction of re-annealing also permits

adaptation to changing sensitivities in the multidimensional

parameter-space. This annealing schedule is faster than fast

Cauchy annealing, where T = T_0/k, and much faster than

Boltzmann annealing, where T = T_0/ln k.

 

Babylon

 

� FTP site: ftp.gmd.de/gmd/ai-research/Software/Babylon/

 

BABYLON is a modular, configurable, hybrid environment for

developing expert systems. Its features include objects, rules

with forward and backward chaining, logic (Prolog) and

constraints. BABYLON is implemented and embedded in Common Lisp.

 

cfengine

 

� Web site: www.iu.hio.no/cfengine/

 

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.

CLEARS

 

� Web site: ???? (anyone know where to find this anymore)

 

The CLEARS system is an interactive graphical environment for

computational semantics. The tool allows exploration and

comparison of different semantic formalisms, and their

interaction with syntax. This enables the user to get an idea of

the range of possibilities of semantic construction, and also

where there is real convergence between theories.

 

CLIPS

 

� Web site: www.ghg.net/clips/CLIPS.html

 

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 provides a cohesive tool for handling a wide variety of

knowledge with support for three different programming

paradigms: rulebased, object-oriented and procedural. Rulebased programming allows knowledge to be represented as

heuristics, or “rules of thumb,” which specify a set of actions

to be performed for a given situation. Object-oriented

programming allows complex systems to be modeled as modular

components (which can be easily reused to model other systems or

to create new components). The procedural programming

capabilities provided by CLIPS are similar to capabilities found

in languages such as C, Pascal, Ada, and LISP.

 

FOOL & FOX

 

� Web site: rhaug.de/fool/

 

� FTP site: ftp.informatik.uni-oldenburg.de/pub/fool/

 

FOOL stands for the Fuzzy Organizer OLdenburg. It is a result

from a project at the University of Oldenburg. FOOL is a

graphical user interface to develop fuzzy rulebases. FOOL will

help you to invent and maintain a database that specifies the

behavior of a fuzzy-controller or something like that.

 

FOX is a small but powerful fuzzy engine which reads this

database, reads some input values and calculates the new control

value.

 

FUF and SURGE

 

� Web site: www.cs.bgu.ac.il/research/projects/surge/index.htm

 

� FTP site: ftp.cs.bgu.ac.il/pub/fuf/

 

FUF is an extended implementation of the formalism of functional

unification grammars (FUGs) introduced by Martin Kay specialized

to the task of natural language generation. It adds the

following features to the base formalism:

� Types and inheritance.

 

� Extended control facilities (goal freezing, intelligent

backtracking).

 

� Modular syntax.

 

These extensions allow the development of large grammars which

can be processed efficiently and can be maintained and under-stood more easily. SURGE is a large syntactic realization grammar of English written in FUF. SURGE is developed to serve as a

black box syntactic generation component in a larger generation

system that encapsulates a rich knowledge of English syntax.

SURGE can also be used as a platform for exploration of grammar

writing with a generation perspective.

 

The Grammar Workbench

 

� Web site: ??? www.cs.kun.nl/agfl/

 

Seems to be obsolete??? Its gone from the site, though its

parent project is still ongoing.

 

The Grammar Workbench, or GWB for short, is an environment for

the comfortable development of Affix Grammars in the AGFL-formalism. Its purposes are:

 

� to allow the user to input, inspect and modify a grammar;

 

� to perform consistency checks on the grammar;

 

� to compute grammar properties;

 

� to generate example sentences;

 

� to assist in performing grammar transformations.

 

GSM Suite

 

� Alt site: www.ibiblio.org/pub/Linux/apps/graphics/draw/

 

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

suite is an editor program, gsmedit, a compiler, gsm2cc, that

produces a C++ implementation of a state machine, a PostScript

generator, gsm2ps, and two other minor programs. GSM is licensed

under the GNU Public License and so is free for your use under

the terms of that license.

 

Isabelle

 

� Web site: isabelle.in.tum.de

 

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).

 

Jess, the Java Expert System Shell

 

� Web site: herzberg.ca.sandia.gov/jess/

 

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.

 

learn

 

� Web site: www.ibiblio.org/pub/Linux/apps/cai/

 

Learn is a vocable learning program with memory model.

 

LISA

 

� Web site: lisa.sourceforge.net

 

LISA (Lisp-based Intelligent Software Agents) is a production-rule system heavily influenced by JESS (Java Expert System

Shell). It has at its core