Subject: Artificial Intelligence FAQ: Questions & Answers 1/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: Frequently asked questions about AI
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part1
Posting-Frequency: monthly
Last-Modified: Sat May 29 14:33:13 PST 1999 by Amit Dubey
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_1.faq
Size: 51188 bytes, 1343 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Maintained by: Amit Dubey
;;; Ric Crabbe
;;; Written by Ric Crabbe, Amit Dubey, and Mark Kantrowitz
;;; ai_1.faq
If you think of questions that are appropriate for this FAQ, or would
like to improve an answer, please send email to the maintianers.
*** Copyright:
Some portions of this FAQ are Copyright (c) 1992-94 by Mark
Kantrowitz. The rest are Copyright (c) 1999 by Ric Crabbe and Amit
Dubey
*** Disclaimer:
This article is provided as is without any express or implied
warranties. While every effort has been taken to ensure the
accuracy of the information contained in this article, the
author/maintainer/contributors assume(s) no responsibility for
errors or omissions, or for damages resulting from the use of
the information contained herein.
*** Recent changes:
;;; 29-MAY-99 ad modernizing references; heavily updating web/ftp links
;;; 27-MAY-99 rc mention of moderation and moderator
;;; 26-APR-99 rc 2 Questions added.
;;; 20-MAR-99 rc+ad Revived. Many changes
*** Topics Covered:
Part 1:
[1-0] What is the purpose of this newsgroup?
[1-1] What is AI?
[1-2] What's the difference between strong AI and weak AI?
[1-3] I'm a programmer interested in AI. Where do I start?
[1-4] History of AI.
[1-5] What has AI accomplished?
[1-6] What are the branches of AI?
[1-7] What are good programming languages for AI?
[1-8] Glossary of AI terms.
[1-9] What are the top schools in AI?
[1-10] How can I get the email address for Joe or Jill Researcher?
[1-11] What are the rules for the game of "Life"?
[1-12] What AI competitions exist?
[1-13] Commercial AI products.
[1-14] AI Job Postings
[1-15] Future Directions of AI
[1-16] Why is this FAQ so short?
[1-17] Where are the FAQs for...neural nets? natural language?
artificial life? fuzzy logic? genetic algorithms?
philosophy? Lisp? Prolog? robotics?
Part 2 (AI-related Newsgroups and Mailing Lists):
- List of all known AI-related newsgroups, newsgroup archives, mailing
lists, and electronic bulletin board systems.
Part 3 (AI-related Associations and Journals):
- List of AI-related associations and journals, organized by subfield.
Part 4 (Bibliography):
- Bibliography of introductory texts, overviews and references
- Addresses and phone numbers for major AI publishers
- Finding conference proceedings
- Finding PhD dissertations
Part 5 (FTP Resources):
[5-0] General Information about FTP Resources for AI
[5-1] FTP Repositories
[5-2a] FTP and Other Resources: Agents -- Planning
Note: Question [5-2] (FTP and Other Resources) is split across parts 5 and 6.
Part 6 (FTP Resources):
[5-2b] FTP and Other Resources: Qualitative Reasoning -- Theorem Proving
Part 7 (FTP Resources):
[7-1] AI Bibliographies available by FTP
[7-2] AI Technical Reports available by FTP
[7-3] Where can I get a machine readable dictionary, thesaurus, and
other text corpora?
[7-4] List of Smalltalk implementations.
[7-5] AI-related CD-ROMs
[7-6] World-Wide Web (WWW) Resources
Search for [#] to get to question number # quickly.
*** Introduction:
Certain questions and topics come up frequently in the various network
discussion groups devoted to and related to Artificial Intelligence
(AI). This file/article is an attempt to gather these questions and
their answers into a convenient reference for AI researchers. It is
posted on a monthly basis. The hope is that this will cut down on the
user time and network bandwidth used to post, read and respond to the
same questions over and over, as well as providing education by
answering questions some readers may not even have thought to ask.
The latest version of this FAQ is available via anonymous FTP from
ftp://ftp.cs.ucla.edu/pub/AI/
as the files ai_[1-7].faq.
The FAQ postings are also archived in the periodic posting archive on
rtfm.mit.edu:/pub/usenet/news.answers/ai-faq/general/ [18.181.0.24]
If you do not have anonymous ftp access, you can access the archive by
mail server as well. Send an E-mail message to mail-server@rtfm.mit.edu
with "help" and "index" in the body on separate lines for more
information.
----------------------------------------------------------------
Subject: [1-0] What is the purpose of the newsgroup comp.ai?
Comp.ai is a moderated newsgroup whose topic is Artificial Intelligence.
It has existed since the early days of USENET (at least 10 years) and
has been a moderated newsgroup since 5th May 1999. An introduction for
new readers including the official charter, moderation policies and
posting guidelines may be found at
The current moderator is David Kinny, but the actual moderation is done
largely automatically by an intelligent :-) agent (the AI-mod-bot).
The group is meant for general discussion of AI topics (but not about
those for which specialized subgroups already exist), including:
o announcements of AI conferences, reports, books, products and jobs.
o questions and discussion about AI theory and practice, algorithms,
systems and applications, problems, history and future trends.
o distribution of AI source code (preferably indirectly by weblinks)
All contributions should be of potential interest to the general AI
community, and in English plain text without attachments. See part 2
of this FAQ for a list of other more specialized newsgroups and lists.
Every so often, somebody posts an inflammatory message, such as
Will computers every really think?
AI hasn't done anything worthwhile.
These "religious" issues serve no real purpose other than to waste
bandwidth. If you feel the urge to respond to such a post, please do
so through a private e-mail message, or post redirecting follow-ups to
comp.ai.philosophy. We suspect this will be less of a problem now
that the group is moderated.
We've tried to minimize the overlap with the FAQ postings to the
comp.lang.lisp, comp.lang.prolog, comp.ai.neural-nets, and
comp.ai.shells newsgroups, so if you don't find what you're looking
for here, we suggest you try the FAQs for those newsgroups. These FAQs
should be available by anonymous ftp in subdirectories of
rtfm.mit.edu:/pub/usenet/
or by sending a mail message to mail-server@rtfm.mit.edu with subject "help".
----------------------------------------------------------------
Subject: [1-1] What is AI?
Artificial intelligence ("AI") can mean many things to many people.
Much confusion arises that the word 'intelligence' is ill-defined.
The phrase is so broad that people have found it useful to divide AI
into two classes: strong AI and weak AI.
----------------------------------------------------------------
Subject: [1-2] What's the difference between strong AI and weak AI?
Strong AI makes the bold claim that computers can be made to think on
a level (at least) equal to humans. Weak AI simply states that some
"thinking-like" features can be added to computers to make them more
useful tools... and this has already started to happen (witness expert
systems, drive-by-wire cars and speech recognition software). What
does 'think' and 'thinking-like' mean? That's a matter of much
debate.
----------------------------------------------------------------
Subject: [1-3] I'm a programmer interested in AI. Where do I start?
There's a list of introductory AI texts in the bibliography section
of the FAQ [4-0].
[1-3a] I'm writing a game that needs AI.
It depends what the game does. If it's a two-player board game,
look into the "Mini-max" search algorithm for games (see [4-1]). In
most commercial games, the AI is is a combination of high-level
scripts and low-level efficiently-coded, real-time, rule-bsed
systems.
----------------------------------------------------------------
Subject: [1-4] History of AI.
For an online timeline of artificial intelligence milestones, see
ftp://ftp.cs.ucla.edu/AI/timeline.txt
The appendix to Ray Kurzweil's book "Intelligent Machines" (MIT Press,
1990, ISBN 0-262-11121-7, $39.95) gives a timeline of the history of AI.
Pamela McCorduck, "Machines Who Think", Freeman, San Francisco, CA, 1979.
Allen Newell, "Intellectual Issues in the History of Artificial
Intelligence", Technical Report CMU-CS-82-142, Carnegie Mellon
University Computer Science Department, October 28, 1982.
See also:
Charniak and McDermott's book "Introduction to Artificial Intelligence",
Addison-Wesley, 1985 contains a number of historical pointers.
Daniel Crevier, "AI: The Tumultuous History of the Search for
Artificial Intelligence", Basic Books, New York, 1993.
Henry C. Mishkoff, "Understanding Artificial Intelligence", 1st edition,
Howard W. Sams & Co., Indianapolis, IN, 1985, 258 pages,
ISBN 0-67227-021-8 $14.95.
Margaret A. Boden, "Artificial Intelligence and Natural Man", 2nd edition,
Basic Books, New York, 1987, 576 pages.
----------------------------------------------------------------
Subject: [1-5] What has AI accomplished?
Quite a bit, actually. In 'Computing machinery and intelligence.',
Alan Turing, one of the founders of computer science, made the claim
that by the year 2000, computers would be able to pass the Turing test
at a reasonably sophisticated level, in particular, that the average
interrogator would not be able to identify the computer correctly more
than 70 per cent of the time after a five minute conversation. AI
hasn't quite lived upto Turing's claims, but quite a bit of progress
has been made, including:
- Deployed speech dialog systems by firms like IBM, Dragon and Lernout&Hauspie
- Applications of expert systems/case-based reasoning: a computerized Lukemia
diagnosis system did a better job checking for blood disorders than human
experts!
- Machine translation for Environment Canada: software developed in the 1970s
translated natural language weather forcasts between English and French.
Purportedly stil in use.
- Deep Blue, the first computer to beat the human chess Grandmaster
- Fuzzy controllers in dishwashers, etc.
One persistent 'problem' is that as soon as an AI technique trully
succeeds, in the minds of many it ceases to be AI, becoming something
else entirely. For example, when Deep Blue defeated Kasparov, there
were many who said Deep Blue wasn't AI, since after all it was just a
brute force parallel minimax search (!)
ref:
Alan M. Turing. Computing machinery and intelligence. Mind,
LIX(236):433-460, October 1950.
Sheiber, S, "Lessons from a Restricted Turing Test". Communications of
the Association for Computing Machinery, volume 37, number 6, pages
70-78, 1994
----------------------------------------------------------------
Subject: [1-6] What are the branches of AI?
There are many, some are 'problems' and some are 'techniques'.
Automatic Programming - The task of describing what a program
should do and having the AI system 'write' the program.
Bayesian Networks - A technique of structuring and inferencing
with probabilistic information.
Natural Language Processing(NLP) - Processing and (perhaps)
understanding human ("natural") language
Knowledge Engineering/Representation - turning what we know about
a particular domain into a form in which a computer can
understand it.
Planning - given a set of actions, a goal state, and a present state,
decide which actions must be taken so that the present state
is turned into the goal state
Constraint Statisfaction - solving NP-complete problems, using a
variety of techniques.
Machine Learning - Programs that learn from experience.
Visual Pattern Recognition - The ability to reproduce the
human sense of sight on a machine.
Speech Recogntion - Conversion of speech into text.
Search - The finding of a path from a start state to a goal
state. Similar to planning, yet different...
Neural Networks(NN) - The study of programs that function in a
manner similar to how animal brains do.
AI problems (speech recognition, NLP, vision, automatic programming,
knowledge representation, etc.) can be paired with techniques (NN,
search, Bayesian nets, production systems, etc.) to make distinctions
such as search-based NLP vs. NN NLP vs. Statistical/Probabilistic NLP.
Then you can combine techniques, such as using neural networks to
guide search. And you can combine problems, such as posing that
knowledge representation and language are equivalent. (Or you can
combine AI with problems from other domains.)
----------------------------------------------------------------
Subject: [1-7] What are good programming languages for AI?
This topic can be somewhat sensitive, so I'll probably tread of a few
toes, please forgive me. There is no authoritative answer for this
question, as it really depends on what languages you like programming
in. AI programs have been written in just about every language ever
created. The most common seem to be Lisp, Prolog, C, and recently
Java.
LISP- For many years, AI was done as research in universities and
laboratories, thus fast prototyping was favored over fast execution.
This is one reason why AI has favored high-level langauges such as
Lisp. This tradition means that current AI Lisp programmers can draw
on many resources from the community. Features of the language that
are good for AI programming include: garbage collection, dynamic
typing, functions as data, uniform syntax, interactive environment,
and extensibility.
PROLOG- This language wins 'cool idea' competition. It wasn't until
the 70s that people began to realize that a set of logical statements
plus a general theorem prover could make up a program. Prolog
combines the high-level and tradition advantages of Lisp with a
built-in unifier, which is particularly useful in AI. Prolog seems to
be good for problems in which logic is intimately involved, or whose
solutions have a succinct logical characterization. Its major
drawback (IMHO) is it is hard to learn.
C- The speed demon of the bunch, C is mostly used when the program is
simple, and excecution speed is the most important. Neural Networks
are a common example of this. Backpropagation is only a couple of
pages of C code, and needs every ounce of speed that the programmer
can muster.
Java- The newcomer, Java uses several ideas from Lisp, most notably
garbage collection. Its portability makes it desirable for just about
any application, and it has a decent set of built in types. Java is
still not as high-level as Lisp or Prolog, and not as fast as C,
making it best when portability is paramount.
(some of the above material is due to the comp.lang.prolog FAQ, and
Norvig's "Paradigms of Artificial Intelligence Programming: Case
Studies in Common Lisp")
----------------------------------------------------------------
Subject: [1-8] Glossary of AI terms.
This is the start of a simple glossary of short definitions for AI
terminology. The purpose is not to present the gorey details, but
give ageneral idea.
A*:
A search algorithm to find the shortest path through a search
space to a goal state using a heuristic. See 'search',
'problem space', 'Admissibility', and 'heuristic'.
Admissibility:
An admissible search algorithm is one that is guaranteed to
find an optimal path from the start node to a goal node, if
one exists. In A* search, an admissible heuristic is one that never
overestimates the distance remaining from the current node to
the goal.
Agent:
"Anything that can can be viewed a perceiving its environment
through sensors and acting upon that environment through
effectors." [Russel, Norvig 1995]
ai:
A three-toed sloth of genus Bradypus. This forest-dwelling
animal eats the leaves of the trumpet-tree and sounds a
high-pitched squeal when disturbed. (Based on the Random House
dictionary definition.)
Alpha-Beta Pruning:
A method of limiting search in the MiniMax algorithm. The
coolest thing you learn in an undergraduate course.
Backward Chaining:
In a logic system, reasoning from a query to the data. See
Forward chaining.
Belief Network (also Bayesian Network):
A mechanism for representing probabilistic knowledge.
Inference algorithms in belief networks use the structure of
the network to generate inferences effeciently (compared to
joint probability distributions over all the variables).
Breadth-first Search:
An uninformed search algorithm where the shallowest node in
the search tree is expanded first.
Case-based Reasoning:
Technique whereby "cases" similar to the current problem are
retrieved and their "solutions" modified to work on the current
problem.
Closed World Assumption:
The assumption that if a system has no knowledge about a
query, it is false.
Data Mining:
Also known as Knowledge Discovery in Databases (KDD) was been defined
as "The nontrivial extraction of implicit, previously unknown, and
potentially useful information from data" in Frawley and
Piatetsky-Shapiro's overview. It uses machine learning, statistical
and visualization techniques to discover and present knowledge in a
form which is easily comprehensible to humans.
Depth-first Search
An uninformed search algorithm, where the deepest non-terminal
node is expanded first.
Evaluation Function:
A function applied to a game state to generate a guess as to
who is winning. Used by Minimax when the game tree is too
large to be searched exhaustively.
Forward Chaining:
In a logic system, reasoning from facts to conclusions. See
Backward Chaining
Fuzzy Logic:
In Fuzzy Logic, truth values are real values in the closed
interval [0..1]. The definitions of the boolean operators are
extended to fit this continuous domain. By avoiding discrete
truth-values, Fuzzy Logic avoids some of the problems inherent in
either-or judgments and yields natural interpretations of utterances
like "very hot". Fuzzy Logic has applications in control theory.
Iterative Deepening:
An uninformed search that combines good properties of
Depth-fisrt and Breadth-first search.
Iterative Deepening A*:
The ideas of iterative deepening applied to A*.
Machine Learning:
A field of AI concerned with programs that learn. It includes
Reinforcement Learning and Neural Networks among many other
fields.
MiniMax:
An algorithm for game playing in games with perfect
information. See alpha-beta pruning.
Modus Ponens:
An inference rule that says: if you know x and you know that
'If x is true then y is true' then you can conclude y.
Nonlinear Planning:
A planning paradigm which does not enforce a total (linear)
ordering on the components of a plan.
Partial Order Planner:
A planner that only orders steps that need to be ordered, and
leaves unordered any steps that can be done in any order.
Planning:
A field of AI concerned with systems that constuct sequences
of actions to acheive goals in real-world-like environments.
Problem Space (also State Space):
The formulation of an AI problem into states and operators.
There is usually a start state and a goal state. The problem
space is searched to find a solution.
Search:
The finding of a path from a start state to a goal state. See
'Admissibility', 'Problem Space', and 'Heuristic'.
Strong AI:
Claim that computers can be made to actually think, just like human
beings do. More precisely, the claim that there exists a class of
computer programs, such that any implementation of such a program is
really thinking.
Unification:
The process of finding a substitution (an assignment of
constants and variables to variables) that makes two logical
statements look the same.
Validation:
The process of confirming that one's model uses measureable inputs
and produces output that can be used to make decisions about the
real world.
Verification:
The process of confirming that an implemented model works as intended.
Weak AI:
Claim that computers are important tools in the modeling and
simulation of human activity.
----------------------------------------------------------------
Subject: [1-9] What are the top schools in AI?
note: The answer to this question is clearly out of date. Any help
would be appreciated.
The answer to this question is not intended to be a ranking and should
not be interpreted as such. There are several major problems with
ratings like the Gourman Report and the US News and World Report. Such
rankings are often unsubstantiated and anecdotal, their accuracy is
questionable, and they do not focus on the subfields of an area. When
selecting a graduate school, students should look for schools which
not only have excellent programs in their general area of research
but also at least one faculty member whose research interests mesh
well with the student's. Accordingly, we've broken down this list
according to topic, and sorted the schools within each topic in
ALPHABETICAL ORDER.
For a school to be added to a topic area, there should at least two
faculty actively conducting research in that area and the school
should have a "good" reputation in that area. Exceptions are made for
schools which only have one faculty member in the area, but that
professor is a "leader" of the area, or for fields where the total
number of people working in the area is small in the first place. The
general idea behind these criteria is to ensure that a school has
enough activity in the area that a student who considers one of these
schools won't be disappointed if one of the faculty in that area is on
sabbatical or isn't taking students. Note that the research need not
be conducted in the school's computer science department for the
school to be listed -- in some cases we've included schools where the
research is being conducted in a different department or special laboratory.
The best way for students to discover which schools are good in a
field is to ask professors (and graduate students) in their
undergraduate school for suggestions on where to apply. Reading the
research journals in the field is another good method (see part 3 of
the FAQ).
A genealogy of AI thesis-advising relationships is available by
anonymous ftp as
cs.ucsd.edu:/pub/rik/aigen.rpt
[Maintainers' note: this seems to be no longer available]
Although intended to complement citation analysis and free-text
information retrieval as tools for understanding the AI community and
their connections to other disciplines, it may be useful to
prospective graduate students. For example, it may help you understand
the historical context of a given professor's perspective. 2,600 MS
and PhD theses have been tabulated so far. If you'd like to
contribute additional listings (including year, title, abstract,
school, advisor, committee members, and subsequent employment), write
to Rik Belew
questionnaire. A copy of the questionaire and more information is
available in
cs.ucsd.edu:/pub/rik/announce.t
[Maintainers' note: this seems to be no longer available]
A list of email addresses for CS departments is posted once a month to
the newsgroup soc.college.gradinfo.
The Association for Computational Linguistics publishes a directory of
graduate programs in Computational Linguistics ($15 for members, $30
for others). It includes several useful indices (e.g., index of
faculty and a list of references). Contact Association for
Computational Linguistics, Walker, C. N. 925, Bernardsville, NJ
07924-0925, phone/fax 908-204-1337, or send email to acl@bellcore.com.
NOTE THAT THIS LIST IS PRELIMINARY AND BY NO MEANS COMPLETE.
Please feel free to suggest schools that are particularly strong in
any of these areas, or to suggest new areas to be listed.
Schools with excellent programs in most fields:
Carnegie Mellon University (CMU)
MIT
Stanford
Georgia Tech
Imperial College
Indiana
Institute for the Learning Sciences, Northwestern University (ILS)
Johns Hopkins University
Maryland
Rutgers
SUNY/Buffalo
Toronto
UC/Berkeley
UCLA
Univ. of Edinburgh
Univ. of Illinois/Urbana-Champaign (UIUC)
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Michigan
Univ. of Pennsylvania
Univ. of Pittsburgh
Univ. of Rochester
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Sussex, School of Cognitive and Computing Sciences
Univ. of Texas/Austin
Yale
Universities with 2 or more AAAI Fellows:
Note: Some Fellows have changed their affiliation since being named,
so this list isn't completely accurate.
12 MIT
12 Stanford University
10 Carnegie Mellon University (CMU)
7 Univ. of Massachusetts
7 Univ. of Southern California (USC) + Information Sciences Institute
5 Univ. of Toronto
5 Univ. of Pennsylvania
5 Rutgers
4 Univ. of Maryland
4 Univ. of Texas at Austin
3 Northwestern
3 Univ. of California, Berkeley
3 Univ. of Edinburgh
3 Univ. of Illinois
3 Univ. of Pittsburgh
2 Brown University
2 Duke University
2 Harvard
2 UCLA
2 Univ. of Rochester
2 Univ. of Sydney
Universities with one AAAI Fellow include: Columbia University,
George Mason, Georgia Tech, Imperial College, New Mexico State,
Ohio State, Oregon State University, Oxford, P. and M. Curie
University, SUNY/Binghamton, SUNY/Buffalo, Saint Joseph, San Jose
State, Syracuse, Tufts, UC Irvine, UC/Santa Cruz, UCSD, Univ. of
Birmingham, Univ. of British Columbia, Univ. of Cambridge, Univ. of
Linkoeping, Univ. of Marseille, Univ. of Minnesota, Univ. of
Sussex, Wellesley, Yale
The full list of AAAI Fellows and their affiliations is available
from AAAI at: http://www.aaai.org/Fellows/fellows-list.html
Specialties and Universities:
AI and Manufacturing:
Carnegie Mellon University (CMU) -- CIMDS
Univ. of Maryland/College Park
Univ. of Toronto
AI and Medicine:
MIT
Stanford
Univ. of Pittsburgh
Univ. of Birmingham England (School of Computer Science)
AI and Legal Reasoning:
Imperial College
Univ. of Massachusetts/Amherst
Artificial Life:
MIT (Brooks' mobots)
NYU
Santa Fe Institute (SFI)
Stanford
UC Santa Cruz
UCLA
UCSD
Univ. of Birmingham England (School of Computer Science)
Univ. of Delaware
Univ. of Sussex, School of Cognitive and Computing Sciences
Automated Deduction/Theorem Proving:
Imperial College
Stanford
Univ. of Edinburgh
Univ. of Oregon
Univ. of Texas/Austin
Case-Based Reasoning/Analogical Reasoning:
Chicago
Georgia Tech
Institute for the Learning Sciences, Northwestern University (ILS)
Univ. of Massachusetts/Amherst
Univ. of Pittsburgh
Cognitive Modelling:
Carnegie Mellon University (CMU)
Georgia Tech
Indiana
SUNY Buffalo
Univ. of Birmingham England (School of Computer Science)
Univ. of Maryland/College Park
Univ. of Michigan
Cognitive Science:
Brown University
Carnegie Mellon University (CMU)
Georgia Tech
Indiana University/Bloomington
Johns Hopkins
MIT
Princeton
Rutgers
SUNY/Buffalo
Stanford
UC/Berkeley
UC/San Diego
Univ. of Birmingham England (School of Computer Science)
Univ. of Colorado/Boulder
Univ. of Edinburgh
Univ. of Minnesota
Univ. of Pennsylvania
Univ. of Rochester
Univ. of Sussex, School of Cognitive and Computing Sciences
Computational Biology:
Carnegie Mellon University
Johns Hopkins University
Rutgers
UC/Berkeley
Univ. of Birmingham England (School of Computer Science)
Univ. of Pennsylvania
Univ. of Wisconsin/Madison
Computer Vision: See Machine Vision
Connectionism/Neural Networks:
Boston University, Cognitive and Neural Systems Department (ART networks)
Brown University
CalTech
Carnegie Mellon University (CMU)
Helsinki University of Technology, Finland
Indiana
Johns Hopkins University
MIT
Ohio State Univ.
Stanford
Syracuse University
Texas A&M
Toronto
UC/Berkeley
UC/Irvine
UC/San Diego
UCLA
UNC/Chapel Hill
Univ. of Birmingham England (School of Computer Science)
Univ. of Colorado/Boulder
Univ. of Edinburgh
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Pennsylvania
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Sussex, School of Cognitive and Computing Sciences
Univ. of Wisconsin
Decision Theory and AI:
Berkeley
MIT
Stanford
Univ. of Michigan
Univ. of Washington
Distributed AI:
Georgia Institute Of Technology
MIT
Nova Southeastern University
Stanford University
Univ. of Maryland
Univ. of Massachusetts/Amherst
Univ. of Michigan
Emotion:
Carnegie Mellon University
Institute for the Learning Sciences, Northwestern University (ILS)
Univ. of Birmingham England (School of Computer Science)
Fuzzy Logic:
Berkeley
Univ. of Birmingham England (School of Computer Science)
Genetic Algorithms:
George Mason Univ.
Indiana
Stanford (Koza)
UC San Diego
UCLA
Univ. of Birmingham England (School of Computer Science)
Univ. of Illinois/Urbana-Champaign (UIUC)
Univ. of Michigan
Univ. of Sussex, School of Cognitive and Computing Sciences
Integrated AI Architectures/Software Agents:
Carnegie Mellon University (CMU)
Stanford
Univ. of Birmingham England (School of Computer Science)
Univ. of Michigan
Univ. of Sussex, School of Cognitive and Computing Sciences
Intelligent Tutoring, AI & Education:
Carnegie Mellon University (Cognitive Science Department)
Illinois Institute of Technology (IIT)
Institute for the Learning Sciences, Northwestern University (ILS)
Univ. of Birmingham England (School of Computer Science)
Univ. of Pittsburgh
Univ. of Sussex, School of Cognitive and Computing Sciences
Knowledge Representation:
Institute for the Learning Sciences, Northwestern University (ILS)
Stanford
SUNY/Buffalo
Univ. of Birmingham England (School of Computer Science)
Univ. of Maryland/College Park
Univ. of Oregon
Logic Programming and Logic-based AI:
Carnegie Mellon University (CMU)
Imperial College
Stanford
UCLA
Univ. of Edinburgh
Univ. of Maryland/College Park
Univ. of Melbourne
Univ. of Illinois/Urbana-Champaign (UIUC)
Univ. of Oregon
Univ. of Pennsylvania
Machine Discovery:
Carnegie Mellon University (CMU)
Univ. of Birmingham England (School of Computer Science)
Machine Learning:
Brown University
Carnegie Mellon University (CMU)
George Mason
Georgia Tech
Johns Hopkins University
MIT
UCI
Univ. of Massachusetts/Amherst
Univ. of Michigan
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Texas/Austin
Univ. of Wisconsin
Waterloo
Machine Vision:
Carnegie Mellon University (CMU)
Columbia
Johns Hopkins
MIT
Oxford
SUNY/Buffalo
UCLA
UNC/Chapel Hill
Univ. of Birmingham England (School of Computer Science)
Univ. of Edinburgh
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Rochester
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Sussex, School of Cognitive and Computing Sciences
Univ. of Wisconsin
Natural Language Processing (NLU, NLG, Parsing, NLI, Speech):
Brown
Carnegie Mellon University (CMU)
Columbia
Georgia Tech
Illinois Institute of Technology (IIT)
Institute for the Learning Sciences, Northwestern University (ILS)
ISI
Indiana
Johns Hopkins University
MIT
Oregon Graduate Institute of Science and Engineering
Penn
Rutgers
Stanford
SUNY/Buffalo
Toronto
UCLA
Univ. of Birmingham England (School of Computer Science)
Univ. of Edinburgh
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Pittsburgh
Univ. of Rochester
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Sussex, School of Cognitive and Computing Sciences
Waterloo (stylistics, MT, discourse)
Nonmonotonic Reasoning:
Imperial College
Stanford
UCLA
Univ. of Birmingham England (School of Computer Science)
Univ. of Maryland/College Park
Univ. of Oregon
Toronto
Philosophy of AI:
Berkeley
MIT
SUNY Buffalo
Univ. of Birmingham England (School of Computer Science)
Univ. of Maryland/College Park
Univ. of Sussex, School of Cognitive and Computing Sciences
Planning:
Brown University
Carnegie Mellon University (CMU)
Imperial College
MIT
Stanford
SUNY Buffalo
Univ. of Birmingham England (School of Computer Science)
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Oregon
Univ. of Pittsburgh
Univ. of Rochester
Univ. of Washington/Seattle
Waterloo
Production Systems/Expert Systems:
Carnegie Mellon University (CMU)
Illinois Institute of Technology (IIT)
Stanford
Univ. of Birmingham England (School of Computer Science)
Qualitative Physics and Model Based Reasoning:
Northwestern ILS (Forbus)
Univ. of Oregon
Univ. of Texas/Austin
Univ. of Washington
Reasoning Under Uncertainty (Probabilistic Reasoning, Approximate
Reasoning, etc.):
Brown University
George Mason
Oregon State University
Stanford
UCLA
Univ. of Maryland/College Park
Univ. of Rochester
University of South Carolina
Robotics:
Bristol Polytechnic, UK
Brown
California Institute of Technology (Caltech)
Carnegie Mellon University (CMU)
Georgia Tech
Harvard
Hull University, UK
Johns Hopkins University
MIT
Naval Postgraduate School
New York University (NYU) Courant Institute of Mathematical Sciences
North Carolina State Univerisity/Raleigh (NCSU)
Oxford
Purdue
Reading University, UK
Rennsalear Polytechnic Institute (RPI)
Salford University, UK
Stanford
Swiss Federal Institute of Technology
UC/Berkeley
Univ. of Alberta
Univ. of Edinburgh
Univ. of Kansas
Univ. of Kentucky
Univ. of Maryland/College Park
Univ. of Massachusetts/Amherst
Univ. of Michigan
Univ. of Paris INRIA
Univ. of Pennsylvania
Univ. of Southern California & USC/Information Sciences Institute
Univ. of Utah
Univ. of Wisconsin
Yale
Search:
UCLA
Univ. of Maryland/College Park
Univ. of Oregon
Temporal Reasoning:
Imperial College
----------------------------------------------------------------
Subject: [1-10] How can I get the email address for Joe or Jill Researcher?
The AAAI membership directory is updated annually and contains
addresses, phone numbers, and email addresses for many members of AAAI
and other AI societies. Contact info@aaai.org for information on
getting a copy of the directory (you should get a free copy if you are
a member of one of the listed societies).
See also the Email Address FAQ posting to the newsgroups soc.college
and soc.net-people.
The Artificial Intelligence and Molecular Biology Researchers database
contains names, institutions, addresses, phone, fax, email,
research interests and other related information about more than 200
researchers worldwide. The database is available via anonymous ftp from the
lhc.nlm.nih.gov:/pub/aimb-db/
There are computer- and human-readable versions available. Get the
README file for more information or send email to Larry Hunter,
E-mail addresses for members of the Linguistics Society of America
(LSA) are available by anonymous ftp as
linguistics.archive.umich.edu:/linguistics/LSA.email.list
or by sending a message to listserv@tamvm1.tamu.edu with
"get lsa lst linguist" in the message body.
A list of "Who's Who in Fuzzy Logic" may be obtained by sending a
message to listserver@vexpert.dbai.tuwien.ac.at with
GET LISTSERVER WHOISWHOINFUZZY
in the message body. New entries and corrections should be sent to
Robert Fuller
WHO's On-Line is a WWW biographical database of folks on the internet.
http://www.ictp.trieste.it/Canessa/ENTRIES/entries.html
For more information, contact E. Canessa
The Association for Logic Program (ALP) membership list was published
in the February 1994 issue of the newsletter (Volume 7/1). It will be
made available by anonymous ftp from Imperial College in October 1994.
----------------------------------------------------------------
Subject: [1-11] What are the rules for the game of "Life"?
Cellular Automata, of which Life is an example, were suggested by
Stanislaw Ulam in the 1940s, and first formalized by von Neumann.
Conway's "Game of Life" was popularized in Martin Gardner's
mathematical games column in the October 1970 and February 1971 issues
of Scientific American. (Shorter notes on life are alse given in the
column in each month from October 1970 to April 1971, and well as
November 1971, January 1972, and December 1972.) There's also quite a
bit on the game in "The Recursive Universe", by William Poundstone,
Oxford University Press, 1987, 252 pages.
The rules for the game of life are quite simple. The game board is a
rectangular cell array, with each cell either empty or filled. At each
tick of the clock, we generate the next generation by the following rules:
if a cell is empty, fill it if 3 of its neighbors are filled
(otherwise leave it empty)
if a cell is filled, it
dies of loneliness if it has 1 or fewer neighbors
continues to live if it has 2 or 3 neighbors
dies of overcrowding if it has more than 3 neighbors
Neighbors include the cells on the diagonals. Some implementations use
a torus-based array (edges joined top-to-bottom and left-to-right) for
computing neighbors.
For example, a row of 3 filled cells will become a column of 3 filled
cells in the next generation. The R pentomino is an interesting
pattern:
xx
xx
x
Try it with other patterns of 5 cells initially occupied. If you
record the ages of cells, and map the ages to colors, you can get a
variety of beautiful images.
When implementing Life, be sure to maintain separate arrays for the
old and new generation. Updating the array in place will not work
correctly. Another optimization to to maintain a list of the cells
that changed.
Conway has demonstrated that it is possible to construct the basic
building blocks of a computer from Life using modified glider guns.
See the last chapter of
Elwyn R. Berlekamp, John H. Conway, and Richard K. Guy, "Winning
Ways", Academic Press, New York, 1982, ISBN 0-120911-507.
for details.
Some interesting patterns to use include:
*
* * ** * *
** * ** * * * *
** *** * * ****
* **** *** *** * *
* ** *
Clock Glider Block Spaceship * * *
* ****
*
Traffic Light Cheshire Cat
----------------------------------------------------------------
Subject: [1-12] What AI competitions exist?
The Loebner Prize, based on a fund of over $100,000 established by New
York businessman Hugh G. Loebner, is awarded annually for the computer
program that best emulates natural human behavior. During the
contest, a panel of independent judges attempts to determine whether
the responses on a computer terminal are being produced by a computer
or a person, along the lines of the Turing Test. The designers of the
best program each year win a cash award and a medal. If a program
passes the test in all its particulars, then the entire fund will be
paid to the program's designer and the fund abolished. For further
information about the Loebner Prize, see the URL
http://www.loebner.net/Prizef/loebner-prize.html
or write to Cambridge Center for Behavioral Studies, 11
Waterhouse Street, Cambridge, MA 02138, or call 617-491-9020.
Also look at:
http://www.eecs.harvard.edu/~shieber/papers/loebner-rev-html/loebner-rev-html.html
for a published criticism of the Loebner.
The Robot World Cup Initiative (RoboCup) is an attempt to foster AI
and intelligent robotics research by providing a standard problem
where wide range of technologies can be integrated and examined. For
this purpose, RoboCup chose to use soccer game, and organize RoboCup:
The Robot World Cup Soccer Games and Conferences. In order for a robot
team to actually performa soccer game, various technologies must be
incorporated including: design principles of autonomous agents,
multi-agent collaboration, strategy acquisition, real-time reasoning,
robotics, and sensor-fusion. RoboCup is a task for a team of multiple
fast-moving robots under a dynamic environment. RoboCup also offers a
software platform for research on the software aspects of RoboCup.
Information can be found at: http://www.robocup.org/02.html
The BEAM Robot Olympics is a robot exhibition/competition started in
1991. For more information about the competition, write to BEAM Robot
Olympics, c/o: Mark W. Tilden, MFCF, University of Waterloo, Ontario,
Canada, N2L-3G1, 519-885-1211 x2454, mwtilden@watmath.uwaterloo.ca.
The Gordon Bell Prize competition recognizes outstanding achievements
in the application of parallel processing to practical scientific and
engineering problems. Entries are considered in performance,
price/performance, compiler parallelization and speedup categories,
and a total of $3,000 will be awarded. The prizes are sponsored by
Gordon Bell, a former National Science Foundation division director
who is now an independent consultant. Contestants should send a
three- or four-page executive summary to 1993 Gordon Bell Prize,
c/o Marilyn Potes, IEEE Computer Society, 10662 Los Vaqueros Cir.,
PO Box 3014, Los Alamitos, CA 90720-1264, before May 31, 1993.
AAAI has an annual robot building competition. The anonymous FTP site
for the contest is/was
aeneas.mit.edu:/pub/ACS/6.270/AAAI/
This site has the manual and the rules. To be added to the
rbl-94@ai.mit.edu mailing list for discussing the AAAI robot building
contest, send mail to rbl-94-request@ai.mit.edu. See also the 6.270
robot building guide in part 4 of this FAQ.
The International Computer Chess Association presents an annual prize
for the best computer-generated annotation of a chess game. The output
should be reminiscent of that appearing in newspaper chess columns,
and will be judged on both the correctness and depth of the variations
and also on the quality of the program's written output. The deadline
is December 31, 1994. For more information, write to Tony Marsland
University of Alberta, Edmonton, Canada T6G 2H1, call 403-492-3971, or
fax 403-492-1071.
----------------------------------------------------------------
Subject: [1-13] Commercial AI products.
[this too must be out of date, given the life cycle of most AI
software...]
Commercial Expert System Shells are listed in the Expert System Shells FAQ.
See the Robotics FAQ for information on Robotics manufacturers.
Stiquito is a small (3cm H x 7cm W x 6cm L), simple (32 parts) and
inexpensive (< $30) nitinol-propelled hexapod robot developed at the Indiana University (Bloomington) Robotics Laboratory. Its legs are propelled by nitnol actuator wires. Each leg has one degree of freedom. The robot walks up to 10 centimeters per minute and can carry a 9-volt cell, a MOSIS "tiny chip" and power transistors to drive the nitinol actuator wires. Nitinol wire (aka BioMetal, Flexinol), is a nickel-titanium alloy which exerts useful force as it is heated by passing a current through it. IUCS Technical Report 363a describes Stiquito's construction and is available by anonymous ftp from cs.indiana.edu:/pub/stiquito/ [129.79.254.191] as are many other related files. The tech report is also available by US mail for $5 (checks or money orders should be made payable to "Indiana University") from Computer Science Department, Attn: TR 363a 215, Lindley Hall, Indiana University, Bloomington, Indiana 47405. A kit containing all the materials needed to construct a simple version of Stiquito and its controller is available for an extra $10 from the above address (use attn line "Stiquito Kit"). To receive a video showing the assembly of Stiquito, include an additional $10 and add "Video" to the "Attn:" line. Anyone may build and use Stiquitos in any quantity for educational or research purposes, but Indiana University reserves all rights to commercial applications. Questions about Stiquito should be sent to Prof. Jonathan W. Mills
mailing list run by Jon Blow of UC/Berkeley, send mail to
stiquito-request@xcf.berkeley.edu.
Togai InfraLogic, Inc. (TIL) is a supplier of fuzzy logic and fuzzy
expert system software and hardware. For more information, write to
Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718, call +1 714
975 8522, fax +1 714 975 8524, or send email to info@til.com or
til!info. TIL also supports an email-server that can be reached at
fuzzy-server@til.com or til!fuzzy-server. Send an email message that
contains just the word "help" in either the subject line or the
message body for more information. A list of products can be obtained
by sending a message that contains only the line "send products.txt"
to the email-server. For an index of the contents of the server, send
a message with the line "send index".
The following is from Risks Digest 13.83 -- I have no idea what the software
does, but Colby did head up the PARRY project:
FEELING HELPLESS ABOUT DEPRESSION? Overcoming Depression 2.0 provides
computer based cognitive therapy for depression with therapeutic
dialogue in everyday language. Created by Kenneth Mark Colby, M.D.,
Professor of Psychiatry and Biobehavioural Sciences, Emeritus, UCLA.
Personal Version ($199), Professional version ($499). Malibu
Artificial Intelligence Works, 25307 Malibu Rd, CA 90265.
1-800-497-6889.
----------------------------------------------------------------
Subject: [1-14] AI Job Postings
A mailing list (AI-Jobs) once existed to help programmers and
researchers find AI programming and research positions, and to help
companies with AI programming and research positions find capable AI
programmers and researchers.
[According to the archives at ftp.cs.cmu.edu:/user/ai/jobs/, this list
has not been active since '96.]
[For neural networks, the Neuron Digest and Connectionists mailing
lists are a good source of job postings. For computer vision, the
VISION-LIST digest includes occasional job announcements. A good
source for general AI is Computists' Communique. For postdoctoral
appointments, see sci.research.postdocs.]
----------------------------------------------------------------
Subject: [1-15] Future Directions of AI
The purpose of this question is to compile a list of major ongoing and
future thrusts of AI. To be included in this list a research problem
or application must have the following characteristics:
[1] Collaborative Community Effort: It must span several subfields
of AI, requiring some degree of collaboration between AI
researchers of different specialties. The idea is to help
unify the fragmented subfields with a common purpose or
purposes.
[2] High Impact: It must address important problems of widespread interest.
Solving the problem must matter to many people and not simply
be adding another grain of sand on the anthill. This will help
motivate and excite researchers, and justify the field to outsiders.
[3] Short Horizon for Progress: It must be possible to have incremental
progress and not be an all or nothing problem. For example,
problems where we can reasonably expect to make significant
measurable progress over the next 10 years or so.
[4] Drive Basic Research: It should involve more than just
applying current technology, but should drive basic research
and the development of new technology (possibly in completely
new directions).
In short, these problems should be "Grand Challenges" for AI. If you
were trying to describe the field of AI to a layman, what concrete
problems would you use to illustrate the overall vision of the field?
Saying that the goal of AI is to produce "thinking machines that solve
problems" doesn't quite cut it.
o Knowbots/Infobots, Web Agents and Intelligent Help Desks
Unified NLU, NLG, Information Retrieval, KR, Reasoning,
Intelligent User Interfaces, Qualitative Reasoning.
o Autonomous Vehicles
Unified Robotics, Machine Vision, Machine Learning,
Intelligent Control, Planning
o Machine Translation
Unified NLU, NLG, Knowledge Representation, Speech Understanding,
Speech Synthesis
It seems appropriate to mention, in this context, some of the early
goals of AI. In 1958 Newell and Simon predicted that computers would
-- by 1970 -- be capable of composing classical music, discovering
important new mathematical theorems, playing chess at grandmaster
level, and understanding and translating spoken language. Although
these predictions were overly optimistic, they did represent a set of
focused goals for the field of AI. [See H. A. Simon and A. Newell,
"Heuristic Problem Solving: The Next Advance in Operations Research",
Operation Research, pages 1-10, January-February 1958.]
----------------------------------------------------------------
Subject: [1-16] Why is this FAQ so short?
The comp.ai FAQ is in a state of flux after being inactive for a
number of years. Please send suggestions for new questions to the
maintainers for inclusion.
----------------------------------------------------------------
Subject: [1-17] Where are the FAQs for...neural nets? natural
language? artificial life? fuzzy logic? genetic algorithms?
philosophy? Lisp? Prolog? robotics?
The FAQs for various related AI fields can be found:
( this list is obviously incomplete)
comp.ai.neural-nets: ftp://ftp.sas.com/pub/neural/FAQ.html
comp.ai.nat-lang: http://www.cs.columbia.edu/~acl/nlpfaq.txt
comp.ai.alife: ?
comp.ai.fuzzy: ?
comp.ai.genetic: ftp://rtfm.mit.edu/pub/usenet/comp.ai.genetic/
comp.ai.philosophy: ?
comp.lang.lisp: ftp://ftp.think.com/public/think/lisp/
comp.lang.prolog: http://warbase.selwerd.cx/~dirk-jan/prolog/faq/
---
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to
[ ask your news administrator to fix the problems with your system. ]
From: cardo@cs.ucla.edu
Subject: Artificial Intelligence FAQ: Newsgroups and Mailing Lists 2/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: Artificial Intelligence Related Newsgroups and Mailing Lists
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part2
Posting-Frequency: monthly
Last-Modified: Wed Mar 19 14:33:13 PST 1999 by Ric Crabbe
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_2.txt
Size: 69371 bytes, 1855 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Amit Dubey, Ric Crabbe and Mark Kantrowitz
;;; ai_2.faq
Part 2 (AI-related Newsgroups and Mailing Lists):
List of all known AI-related newsgroups, mailing lists, and
electronic bulletin board systems.
Outline:
----------------
[2-0] How to Subscribe to a Mailing List
[2-1] AI-related Newsgroups
[2-1a] AI-related Newsgroup Archives
[2-1b] AI-related Newsgroup FAQ postings
[2-2] AI Research in a particular country
[2-3] Dial-up AI-related Bulletin Board Systems
----------------
[2-4] Artificial Life
[2-5] AI for Development
[2-6] AI in Education
[2-7] AI and Law
[2-8] AI in Medicine
[2-9] AI and Statistics
[2-10] Blackboard Architectures
[2-11] Business, Economics, Finance (IE-Digest, AT-Finance)
[2-12] Cellular Automata
[2-13] Classification and Clustering
[2-14] Cognitive Science and Psychology
[2-15] Connectionism and Neural Networks
[2-16] Constraint Satisfaction
[2-17] Cybernetics and Systems
[2-18] Diagrams
[2-19] Distributed AI
[2-20] Expert Systems in Agriculture
[2-21] Use of Computers in the Fine Arts
[2-22] Fuzzy Logic
[2-23] Game Playing
[2-24] Genetic Algorithms and Genetic Programming
[2-25] HCI: AI Applications to Human-Computer Interface Design
[2-26] Knowledge Acquisition
[2-27] Knowledge-based Scheduling
[2-28] Knowledge Representation
[2-29] Logic Programming, Prolog
[2-30] Machine Discovery
[2-31] Machine Learning
[2-33] Natural Language Processing
[2-34] Qualitative Physics
[2-35] Robotics
[2-36] Simulated Annealing
[2-37] Simulation
[2-38] Symbolic Math
[2-39] Theorem Provers
[2-40] Case-Based Reasoning
[2-41] Uncertainty
[2-45] Vision Research
[2-50] Commercial Systems: Kappa PC, ...
[2-60] Miscellaneous: Artificial Morality, Intelligent Control,
Intelligent Decision Support Systems, Frogs,
Meteorology, Natural World Problems, OOP Frameworks
[2-61] AI Research
----------------
Search for [#] to get to question number # quickly.
----------------------------------------------------------------
Subject: [2-0] How to Subscribe to a Mailing List
To be added or deleted to any of the mailing lists described in this
post, send mail to the -request version of the list except where
otherwise noted. This sends mail to the list maintainer, instead of
annoying the membership of the entire mailing list. To subscribe to
one of the BITNET listserv forums, send mail there which contains a
line of the form
SUB
as the first and only line in the body of the message. To unsubscribe
to a ListServ list, send
UNSUB
or
SIGNOFF
instead.
For Lisp-related mailing lists, see part 4 of the FAQ for the
newsgroup comp.lang.lisp.
The LISTSERV home page is located at the URL
http://www.clark.net/pub/listserv/listserv.html
It includes a list of the top 40 listserv lists (the Linguist list is
#20 with 5800 members, and SCHOLAR is #29 with 3984 members), and
lists of listserv lists organized alphabetically and by category.
----------------------------------------------------------------
Subject: [2-1] AI-related Newsgroups
Subscribe to these using your newsreader.
comp.ai Artificial Intelligence (moderated)
comp.ai.alife Artificial Life
comp.ai.fuzzy Fuzzy Logic. Gatewayed to NAFIPS-L and Fuzzy-Mail.
comp.ai.games AI in Games and Game Playing
comp.ai.genetic Genetic Algorithms
comp.ai.nat-lang Natural Language Processing (unmoderated)
comp.ai.neural-nets Neural Networks
comp.ai.philosophy Philosophical Foundations of AI
comp.ai.shells Expert System Shells
comp.robotics Robotics
comp.speech Speech related research, including speech
recognition and synthesis.
comp.ai.vision Vision Research. Also available through
the Vision List Digest (see [45] below).
comp.ai.jair.papers Online papers of the Journal of AI Research. (M)
comp.ai.jair.announce Announcements & abstracts of JAIR papers. (M)
comp.theory.info-retrieval Information Retrieval
comp.cog-eng Cognitive Engineering
sci.cognitive Cognitive Science
sci.psychology.research Psychology. Bi-directionally gatewayed to
the psy-research mailing list; send mail to
psy-research-request@psy.psych.nova.edu
to subscribe.
comp.simulation Simulation
sci.lang Linguistics
sci.math.symbolic Symbolic Math
sci.virtual-worlds Virtual Reality. Also available through
the bi-directional gateway, VIRTU-L on
LISTSERV@UIUCVMD.BITNET or
LISTSERV@VMD.CSO.UIUC.EDU
comp.theory.cell-automata Cellular Automata
comp.theory.self-org-sys Self-organizing systems
AI Programming Languages
comp.constraints Constraint Processing
comp.lang.clos Common Lisp Object System
comp.lang.dylan Dylan
comp.lang.functional Functional Programming Languages
comp.lang.lisp Common Lisp
comp.lang.lisp.franz Franz Lisp
comp.lang.lisp.mcl Macintosh Common Lisp
comp.lang.lisp.x XLisp
comp.lang.ml Standard ML. Gatewayed to sml-list@cs.cmu.edu.
comp.lang.prolog Prolog and Logic Programming
comp.lang.scheme Scheme
comp.lang.scheme.c MIT C Scheme
comp.lang.smalltalk Smalltalk
comp.lang.pop POPLOG integrated programming language &
environment for Lisp, Prolog, ML and Pop11
comp.object Object Oriented Programming
comp.object.logic Integrating Object-Orientend and Logic Paradigms
comp.org.lisp-users Association of Lisp Users
comp.std.lisp Lisp Standards
German AI newsgroups:
de.sci.ki.announce
de.sci.ki.discussion
----------------------------------------------------------------
Subject: [2-1a] AI-related Newsgroup Archives
The archives in ftp.cs.cmu.edu:/user/ai/pubs/news/ are no longer
maintained. Moder users should use DejaNews:
http://www.dejanews.com/
----------------------------------------------------------------
Subject: [2-1b] AI-related Newsgroup FAQ postings
Of the newsgroups listed in [2-1], the following have FAQ postings:
comp.ai, comp.ai.fuzzy, comp.ai.shells, comp.ai.genetic, comp.robotics,
comp.speech, comp.neural-nets, comp.lang.lisp, comp.lang.scheme,
comp.lang.clos, comp.lang.prolog, comp.object, comp.theory.cell.automata,
comp.constraints, comp.ai.nat-lang, comp.lang.smalltalk
Many of the FAQ postings are available by anonymous FTP from
ftp.cs.cmu.edu:/user/ai/pubs/faqs/
In general FAQs should be downloaded from rtfm.mit.edu:/pub/faqs
----------------------------------------------------------------
Subject: [2-2] AI Research in a particular country
British AI alvey jws%ib.rl.ac.uk@nsfnet-relay.ac.uk
Japanese AI fj-ai%etl.jp@relay.cs.net
Mexican AI IAMEX-L on listserv@tecmtyvm.mty.itesm.mx
Florida AI FLAIRS on listserv@ucf1vm.cc.ucf.edu
The IAMEX-L list is administrated by the AI Invetigation Center in
Instituto Tecnologico y de Estudios Superiores de Monterrey (ITESM)
in Monterrey, N.L. To be added to that list, please contact:
pl500368@tecmtyvm.bitnet (Juana Maria Gomez Puertos)
pl157961@tecmtyvm.bitnet (Fernando Careaga Sanchez)
The newsgroup de.sci.ki.discussion is the German equivalent of comp.ai.
The newsgroup de.sci.ki.announce is for announcements about AI.
The newsgroup aus.ai is the (unmoderated) Australian equivalent of comp.ai.
BCINFO-IT is a mailing list for information about information
technology in Britain. To subscribe, send mail to
bcifunit@solomon.technet.sg
with
ADD BCINFO-IT
in the Subject line of the message. For more information, contact
Mrs Yu-Toh Yin Yin, Information Officer, The British Council,
30 Napier Road, Singapore 1025, call 473-1111 x145, fax 479-7481, or
send email to bcifunit@solomon.technet.sg.
----------------------------------------------------------------
Subject: [2-3] Dial-up AI-related Bulletin Board Systems
NOTE: This list was compiled several years ago. Are any of these BBSs
still in operation?
The primary AI-related dial-up bulletin board systems are:
The Interocitor 214-258-1832 (Fido 1:124/2206) V.32bis (14.4kbps)
SysOp: Steve Rainwater Hours: 24
Desc: NCC AI CD-ROM submission site, general AI archive.
Free access 1/2 hour per day.
ShadeTree BBS 412-244-9416 (Fido 1:129/124) V.22bis (2400bps)
SysOp: Bill Keller Hours: 8:30pm-8:30am only
Desc: Oriented toward beginners in the field.
C.N.S. BBS 509-627-6267 (Fido 1:347/303) USR HST (9600bps)
SysOp: Wesley Elsberry Hours: 24
Desc: Best source for neural network related information.
Cognitive Development BBS 01256-50086 (It'l 44-1256-50086) 8/N/1 (14.4kbps)
SysOp: Matthew Probert
Desc: Lisp, Prolog, Expert Systems, NLP, Turing Test
Fuzzy Logic Related BBS's:
Aptronix FuzzyNet:
408-428-1883 N/8/1 1200-19,200 baud
The Turning Point:
512-219-7828 N/8/1 DS/HST 1200-19,200 baud (LIBRARY)
512-219-7848 N/8/1 DS/HST 1200-19,200 baud
Motorola FREEBBS:
512-891-3733 E/7/1 1200-9600 baud
Electronic Design News (EDN) BBS:
617-558-4241 N/8/1 1200-9600 baud
Neural Networks Related BBS's:
Central Neural System, 409-737-5222
8-N-1, 300-14,400 bps v.32bis or HST
or NEURAL_NET Echo from FidoNet 1:117/385
Operated by Wesley R. Elsberry, 6070 Sea Isle, Galveston, TX 77554.
E-mail: welsberr@orca.tamu.edu
URL: http://www.rtis.com/nat/user/elsberry
Elsberry will mail you files if you send him a DOS diskette, SASE,
and a list of file names from his F3407_2.ZIP or CNS_FILE.LST index
in the ARTICLES area. You'll need the InfoZip compression program,
which is compatible with the PKZ204G distribution.
The files are mirrored on
me.uta.edu:/pub/neural/ [129.107.2.20]
Source code for this program for PC/Mac/Unix/Atari is included in
the COMPRESS file area. CNS contains a variety of neural-network,
genetic algorithms, fuzzy logic, artificial life, and AI code,
mostly for PCs, but some for Unix and Mac.
Online Services AI Forums:
Delphi GO CUST 206
----------------------------------------------------------------
Subject: [2-4] Artificial Life
alife@cognet.ucla.edu
The alife mailing list is for communications regarding artificial
life, a formative interdisciplinary field involving computer science,
the natural sciences, mathematics, medicine and others. Send mail to
alife-request@cognet.ucla.edu to be added to the list.
See also the UCLA Artificial Life Depository in question [5-1].
----------------------------------------------------------------
Subject: [2-5] AI for Development
aidev@aisb.ed.ac.uk
An occasional newsletter for folk interested in AI applications in
and for developing countries. The newsletter is sent to the mailing
list and to the newsgroup comp.society.development.
Send requests to be added to the mailing list to Kathleen King
----------------------------------------------------------------
Subject: [2-6] AI in Education
AI-ED:
ai-ed@sun.com (was ai-ed@sumex-aim.stanford.edu)
Includes ICAI (intelligent computer aided instruction) and
ITS (intelligent tutoring systems).
All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to ai-ed-request@sun.com.
[As of 12/12/94, this list seems to have moved. Anybody know where?]
HUMANIST: [Mail from utorepas bounces. 8/18/93 mk]
humanist%utorepas.bitnet@cornellc.ccs.cornell.edu
HUMANIST is an international mailing list for discussion of
applications of computers to scholarship in the humanities. AI
or NLP topics sometimes come up.
Interested individuals should send a note together with a brief
biography to the Coordinator in the following format:
*Family-name, Given-names
Title, mailing address(es), telephone number(s).
Body of biography. This should not be a c.v. and need not be very
detailed but should cover the full range of your professional
activities and interests, both present and past. Mention other things
at your discretion. Biographies vary considerably in length, though
few are less than 100 words or more than 500.
Coordinator:
Willard McCarty
NEWEDU-L:
NEWEDU-L@vm.usc.edu
NEWEDU-L is dedicated to exploring new paradigms in education and
how they can be implemented, including, among other things, the role
of artificial intelligence in education.
To subscribe, send a message to listserv@uscvm.bitnet or
listserv@vm.usc.eduwith the following line in the message body:
SUBSCRIBE NEWEDU-L Your_full_name
To remove yourself from the mailing list, send a message with the line
SIGNOFF NEWEDU-L
For further information, contact the moderators, Greg Swan and Paul
Privateer, at npadmin@mc.maricopa.edu.
----------------------------------------------------------------
Subject: [2-7] Artificial Intelligence and Law
ail-l@austin.onu.edu
To subscribe to AIL-L you should send a message to the internet address
listserv@austin.onu.edu
The body of the message should consist of:
subscribe AIL-L
----------------------------------------------------------------
Subject: [2-8] AI in Medicine
AI in Medicine:
ai-medicine@med.stanford.edu
Focus is on computer-based medical decision support. Currently over
1,000 subscribers in more than 35 countries.
All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to ai-medicine-request@med.stanford.edu. The list
is coordinated by Wanda Pratt and Serdar Uckun.
Archives of the mailing list are available by anonymous ftp from
lhc.nlm.nih.gov:/pub/ai-medicine/ [130.14.1.128].
CBR-MED:
cbr-med@cs.uchicago.edu
Case-Based Reasoning in Medicine.
To subscribe to the list, send a message to listproc@cs.uchicago.edu
with
subscribe CBR-MED
in the message body. To get the FAQ, include
get cbr-med faq
If you need to speak with a human being, send mail to
Jeff Berger
Other medicine lists with some AI content include:
SMDM-L on listserv@dartcms1.dartmouth.edu (medical decision making)
MedInf-L on listserv@dearn.bitnet (medical data processing and informatics)
----------------------------------------------------------------
Subject: [2-9] AI and Statistics
AI and Statistics:
ai-stats@watstat.uwaterloo.ca
All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to ai-stats-request@watstat.uwaterloo.ca
----------------------------------------------------------------
Subject: [2-10] Blackboard Architectures
GBB-Users:
gbb-users@bn.cs.umass.edu
The list covers both the commercial GBB framework and the UMass
research prototype (mostly the former these days).
To be added to the list, send mail to
gbb-users-request@bn.cs.umass.edu
See also http://www.bbtech.com
----------------------------------------------------------------
Subject: [2-11] Business, Economics, Finance (IE-Digest, AT-Finance)
Intelligent Systems for Business and Economics (IE-Digest):
IE-list@cs.ucl.ac.uk
The IE-digest aims to act as a forum to exchange ideas on using
`intelligent' techniques to model economic and financial systems.
Calls for papers, paper announcements and queries are welcome.
Techniques which were originally developed to model psychological and
biological processes are now receiving considerable attention as tools
for modelling and understanding economic and financial processes.
These techniques, which include neural networks, genetic algorithms
and expert systems are now being used in a wide variety of
applications including the modelling of economic cycles, modelling of
artificial economies, portfolio optimisation and credit evaluation.
To be added to the list, send mail to IE-list-request@cs.ucl.ac.uk. An
archive of back issues of the digest, as well as papers,
bibliographies and software, may be obtained by anonymous ftp from
cs.ucl.ac.uk:/ie/ [128.16.5.31].
List moderated by Suran Goonatilake, Dept. of Computer Science,
University College London, Gower St., London WC1E 6BT, UK,
Advanced Technology for Finance:
at-finance-board@invnext.worldbank.org
The Advanced Technology for Finance Special Interest Group of the INNS
maintains the AT-Finance mailing list for discussions of financial or
economic applications of advanced technology. Discussion sometimes
involves Neural Networks, Genetic Algorithms, Fuzzy Logic, Statistics,
Complexity theory, Artificial Life, and Nonlinear and Chaos Theory.
To subscribe, send mail to at-finance-request@invnext.worldbank.org.
For further information, send mail to the AT-Finance administrator at
[This list seems to be defunct. --mk]
----------------------------------------------------------------
Subject: [2-12] Cellular Automata
cellular-automata@think.com (aka ca@think.com)
Gatewayed to the newsgroup comp.theory.cell-automata.
Archived messages may be found at
ftp.think.com:/mail/
in the files ca.archive*.
All other requests to be added to or deleted from this list, problems,
questions, etc., should be sent to cellular-automata-request@think.com.
----------------------------------------------------------------
Subject: [2-13] Classification and Clustering
class-l%sbccvm.bitnet@cunyvm.cuny.edu
Mailing list and file server for researchers in classification,
clustering, phylogenetic estimation, and related areas of data
analysis.
To subscribe to CLASS-L you should send a message to the internet address
listserv%sbccvm.bitnet@cunyvm.cuny.edu
The body of the message should consist of:
subscribe CLASS-L
To have your name removed from the CLASS-L subscriber list, send:
signoff CLASS-L
----------------------------------------------------------------
Subject: [2-14] Cognitive Science and Psychology
PSYCGRAD (The Psychology Graduate Student Journal) is an online
journal of technical papers by psychology graduate students and is
edited by a team of 18 graduate student editors. To submit a paper or
article, send email to psygrd-j@acadvm1.uottawa.ca. To subscribe, send
a message "sub psygrd-j
listserv@acadvm1.uottawa.ca or read the newsgroup bit.listserv.psycgrad.
PSYCHE is a refereed electronic journal concerning the
interdisciplinary exploration of the nature of consciousness and its
relationship to the brain. To subscribe, send a message with
"SUBSCRIBE PSYCHE-L Firstname Lastname" in the body to
Executive Editor, Patrick Wilken, Computer Science Dept., Monash
University, Clayton, 3167, AUSTRALIA,
A discussion group PSYCHE-D has also been created for discussion of
the contents of the journal and related topics. To subscribe, send a
message with "SUBSCRIBE PSYCHE-D Firstname Lastname" in the body to
COGNEURO (Cognitive Neuroscience) is a low volume mailing list for
discussing matters at the interface of cognitive science and
neuroscience. For more information about the list, send mail to
cogneuro-request@ptolemy.arc.nasa.gov with Subject line "cogneuro:
send info". To subscribe, use the Subject line "cogneuro: subscribe",
and to unsubscribe, "cogneuro: unsubscribe". Only members of the list
may post to the list. The mailing list archives are available by
anonymous ftp from
ego.psych.mcgill.ca:/pub/cogneuro/ [132.206.106.211]
and are maintained by Phil A. Hetherington
The list is moderated by Kimball Collins
COGPSY is a moderated mailing list concerned with connectionist
research in cognitive psychology. To be added to the list, send mail
to cogpsy-request@phil.ruu.nl. Submissions should be sent to the same
address.
----------------------------------------------------------------
Subject: [2-15] Connectionism and Neural Networks
Connectionists:
connectionists@cs.cmu.edu
This is a restricted mailing list for discussion of technical
issues relating to neural computation, and for dissemination of
information directly relevant to researchers in the field. Membership
is restricted to students and faculty who are actively involved in
connectionist research.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to connectionists-request@cs.cmu.edu.
Neural Networks (moderated):
Neuron@cattell.psych.upenn.edu
Neuron-Digest is a moderated list (in digest form) dealing with all
aspects of neural networks (and any type of network or neuromorphic
system). Topics include both connectionist models (artificial neural
networks) and biological systems ("wetware"). The digest is posted to
comp.ai.neural-nets.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to neuron-request@psych.upenn.edu
Send submissions to neuron@psych.upenn.edu.
Neuron Digest archives are kept in the OSU Neuroprose collection
and in psych.upenn.edu:/pub/Neuron-Digest/ [130.91.68.31]
Back issues of Neuron Digest are now also available from an email
archive server. Send a message with "help" in the subject line to
archive-server@psych.upenn.edu for more information.
Hypertext versions of the Neuron Digest are available via the URL
http://www.erg.abdn.ac.uk/projects/neuralweb/digests/
Neuron-UK:
neuron-uk@mailbase.ac.uk
Neural networks in Europe.
To subscribe, send mail to mailbase@mailbase.ac.uk with
subscribe neuron-uk yourname
in the message body.
Users of the Rochester Connectionist Simulator:
simulator-users@cs.rochester.edu
simulator-bugs@cs.rochester.edu
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to simulator-request@cs.rochester.edu.
The simulator is available in ftp.cs.rochester.edu:/pub/packages/simulator/
Users of the Stuttgart Neural Network Simulator:
snns@informatik.uni-stuttgart.de
To be added to the mailing list, send a message to
listserv@informatik.uni-stuttgart.de with
subscribe snns
in the message body.
The simulator is available in
ifi.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.1]
RNA:
RNA on LISTSERV@UTFSM.BITNET
RNA is a Neural Net list in Spanish.
RNA es una lista dedicada a todas aquellas personas interesadas en el
desarrollo e investigacion en el campo de las Redes de Neuronas
Artificiales. El proposito de esta lista es intercambiar
informacion, favorecer el encuentro de personas con intereses
afines, promover la formacion de grupos de trabajos y servir de
apoyo a quienes se integran al area.
Para subscribirse enviar una nota a LISTSERV@UTFSM.BITNET con el
siguiente mensaje en el cuerpo de la nota:
SUB RNA nombre apellido
Cells:
cells@tce.ing.uniroma1.it
A mailing list about cellular neural networks. According to the
list announcement, Cellular Neural Networks are continuous-time
dynamical systems consisting of a grid of processing elements
connected only to neighbours within a given (small) distance. They are
silicon-efficient locally recurrent networks such as artificial retinas.
To subscribe, send mail to Marco Balsi
----------------------------------------------------------------
Subject: [2-16] Constraint Satisfaction
See also comp.constraints. The FAQ is available via WWW as
http://web.cs.city.ac.uk/archive/constraints/constraints.html
and by anonymous ftp as
ftp.cs.city.ac.uk:/pub/constraints/ [138.40.91.9]
The comp.constraints newsgroup is archived in
ftp.cs.city.ac.uk:/pub/constraints/archive/
Questions about the FAQ should be directed to Michael Jampel
to Andy Whitcroft
csp-list@saturne.cert.fr
A moderated mailing list for topics related to Constraint
Satisfaction Problems, including algorithms, properties, extensions,
benchmarks, applications, calls for papers, and so on.
To subscribe, send a message to listserver@saturne.cert.fr with
sub csp-list
in the message body.
If you prefer to receive a digest once a week, send the listserv
a command like
set csp-list mail digest
after successfully subscribing to the list.
Archives and various informative files can be found by sending the
"index csp-list" and "get" commands to listserver@saturne.cert.fr. See
the explanations in "help" for full details.
For further questions, please get in contact with Thomas Schiex,
CERT-ONERA (GIA), 2 Avenue Edouard Belin, BP 4025, 31055 Toulouse
CEDEX, FRANCE, call +33 61-55-70-65, fax +33 61-55-71-94, or send
email to schiex@cert.fr.
----------------------------------------------------------------
Subject: [2-17] Cybernetics and Systems
Cybernetics and Systems:
cybsys-l@bingvmb.cc.binghamton.edu
cybsys-l%bingvmb.bitnet@cunyvm.cuny.edu
The Cybernetics and Systems mailing list is an open list serving those
working in or just interested in the interdisciplinary fields of
Systems Science, Cybernetics, and related fields (e.g. General
Systems Theory, Complex Systems Theory, Dynamic Systems Theory,
Computer Modeling and Simulation, Network Theory, Self-Organizing
Systems Theory, Information Theory, Fuzzy Set Theory). The list is
coordinated by members of the Systems Science department of the Watson
School at SUNY-Binghamton, and is affiliated with the International
Society for the Systems Sciences (ISSS) and the American Society for
Cybernetics (ASC).
To subscribe to cybsys-l you should send a message to the internet address
listserv@bingvmb.cc.binghamton.edu
listserv%bingvmb.bitnet@cunyvm.cuny.edu
The body of the message should consist of:
SUB CYBSYS-L
To unsubscribe send the following command: UNSUB CYBSYS-L
Autopoiesis:
Mailing list concerning autopoietic (self-producing) systems, as
described in
H. Maturana and F. Varela in "Autopoiesis and Cognition" (D. Reidel,
1980) and "The Embodied Mind."
To subscribe, send a message to listserv@thinknet.net with
sub autopoiesis
in the message body.
Complex Systems:
complex@life.anu.edu.au
The Complex Systems List is concerned with all aspects of
Complex Systems, including cellular automata, artificial life,
genetic algorithms, and fractals.
To subscribe, send mail to listserv@life.anu.edu.au with
subscribe complex "your name"
in the message body.
----------------------------------------------------------------
Subject: [2-18] Diagrams
diagrams@cs.swarthmore.edu
A mailing list for discussions on (and announcements about activities
concerning) computational and cognitive issues related to diagrams and
imagery. Issues covered include problem solving with diagrammatic
representations, visual reasoning, computational imagery, etc.
To subscribe, send a request to
diagrams-request@cs.swarthmore.edu
Maintained by Dr. David Barker-Plummer, Computer Science, Swarthmore College.
----------------------------------------------------------------
Subject: [2-19] Distributed AI
DAI-List:
DAI-List@ece.sc.edu
Send subscription requests to DAI-List-request@ece.sc.edu.
Back issues archived on ftp.mcc.com [128.62.130.101].
MAAMAW Blackboard (Modeling Autonomous Agents in a Multi-Agent World):
Send requests to demazeau@lifia.imag.fr
Send submissions to maamaw@lifia.imag.fr
Distributed-AI Discussion List:
To subscribe or get help send COMMAND (e.g. HELP) to mailbase@mailbase.ac.uk
Send contributions to distributed-ai@mailbase.ac.uk
For other questions, contact the list owner, lyndon@sx.ac.uk.
Special interest group on cooperating knowledge based systems:
ckbs@cs.keele.ac.uk.
----------------------------------------------------------------
Subject: [2-20] Expert Systems in Agriculture
ag-exp-l%ndsuvm1.bitnet@cunyvm.cuny.edu
To subscribe to ag-exp-l you should send a message to the internet address
listserv%ndsuvm1.bitnet@cunyvm.cuny.edu
The body of the message should consist of:
subscribe AG-EXP-L
----------------------------------------------------------------
Subject: [2-21] Use of Computers in the Fine Arts
fineart%ecs.umass.edu@relay.cs.net
The FINEART Forum is dedicated to International collaboration between
artists and scientists. It is subsidized by the International Society for
the Arts, Science, and Technology (ISAST), 2020 Milvia, Berkeley, CA 94704.
The purpose of this bulletin board is to disseminate information regarding
the use of computers in the Fine Arts. One of the general areas of
interest is Art & AI.
----------------------------------------------------------------
Subject: [2-22] Fuzzy Logic
Both the NAFIPS-L and Fuzzy-Mail mailing lists are now gatewayed to
comp.ai.fuzzy.
NAFIPS Fuzzy Logic Mailing List at Georgia State University:
NAFIPS-L@gsuvm1.gsu.edu
To subscribe send the following command to LISTSERV@GSUVM1.BITNET:
SUB NAFIPS-L your_full_name
where "your_full_name" is your real name, not your login Id.
Non-BitNet users can join by sending the above command as the only
line in the text/body of a message to LISTSERV@GSUVM1.GSU.EDU.
(NAFIPS = "North American Fuzzy Information Processing Society")
Postings to this mailing list are automatically archived.
Technical University of Vienna Fuzzy Logic Mailing List:
fuzzy-mail@vexpert.dbai.tuwien.ac.at
To subscribe send the following command to
listproc@vexpert.dbai.tuwien.ac.at:
SUB FUZZY-MAIL your_full_name
where "your_full_name" is your real name, not your login Id.
This mailing list is two-way gatewayed to the NAFIPS-L list and to
the comp.ai.fuzzy newsgroup.
The listserver also gives access to some files, including the
"Who is Who in Fuzzy Logic" database that is currently under
construction by Robert Fuller
----------------------------------------------------------------
Subject: [2-23] Game Playing
Go:
computer-go@prg.ox.ac.uk
List for discussion of programs that play the game of GO. The list
was set up by Fletch
To subscribe, send mail to computer-go-request@prg.ox.ac.uk.
----------------------------------------------------------------
Subject: [2-24] Genetic Algorithms and Genetic Programming
Genetic Algorithms Digest:
GA-List@AIC.NRL.NAVY.MIL (moderated; digest format)
Send subscription requests to the -request form of the list
or to gref@aic.nrl.navy.mil.
Past copies of the digest are archived on
ftp.aic.nrl.navy.mil:/pub/galist/
Some software is also archived there.
Discussion of genetic algorithms also appears from time to time in
comp.ai.neural-nets and comp.theory.self-org-sys.
Genetic Programming:
genetic-programming@cs.stanford.edu
A mailing list for discussion of Genetic Programming. See Koza's
book for details.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to
genetic-programming-request@cs.stanford.edu
The genetic-programming mailing list is archived on
ftp.cc.utexas.edu:/pub/genetic-programming/ along with some code and papers.
Evolutionary Programming Email Digest:
The digest is intended to promote discussions on a wide range of
technical issues in evolutionary optimization, as well as provide
information on upcoming conferences, events, journals, special issues,
and other items of interest to the EP community. Discussions on all
areas of evolutionary computation are welcomed, including artificial
life, evolution strategies, and genetic algorithms. The digest is
meant to encourage interdisciplinary communications.
To subscribe to the digest, send mail to ep-list-request@magenta.me.fau.edu
and include the line "subscribe ep-list" in the body of the text. Further
instructions will follow your subscription.
The digest will be moderated by N. Saravanan of Florida Atlantic
University,
Evolutionary Computing:
This is a UK discussion group for genetic programming, artificial
life, and other topics in evolutionary computing.
To subscribe, send mail to mailbase@mailbase.ac.uk with
join evolutionary-computing
in the message body.
GEnetic Algorithms Research Students (GEARS):
gaphd-list@dcs.warwick.ac.uk
A mailing list for students conducting research in the field of
genetic algorithms. Example topics may include
"How do I get started in GA research?",
"Has x ever been tried before?"
"Does anyone else get these results?"
"Where can I obtain this paper?"
"My supervisor's annoying me!"
To subscribe, send mail to gaphd-list-request@dcs.warwick.ac.uk.
The list is maintained by Martyn Amos
GANN:
gann@cs.iastate.edu
GANN is a mailing list concerned with the use of evolutionary
algorithms (genetic algorithms, genetic programming and their
variants) in the exploration of the design space of (artificial)
neural network architectures and algorithms. The list will be
semi-moderated to keep the signal to noise ratio as high as possible.
To subscribe to the list, send mail to gann-request@cs.iastate.edu
with
subscribe
in the Subject line.
Moderated by Dr. Vasant Honavar
Dr. Mike Rudnick
Balakrishnan
----------------------------------------------------------------
Subject: [2-25] HCI: AI Applications to Human-Computer Interface Design
STUDENTS.CHI:
students.chi@xerox.com
The STUDENTS.CHI mailing list has been established by the SIGCHI
Extended Executive Committee (EEC) and Xerox (the corporate sponsor of
the CHI email distribution lists).
The objective of STUDENTS.CHI is to distribute information and
share perspectives of particular concern to students involved in any
aspect of the human factors and computing field. The Human-Computer
Interaction field (HCI) focuses on the research, design, development and
evaluation of human-computer communication and interaction.
Other distribution lists include:
announcements.chi Broadcasts messages of general interest
educators.chi Discussion of education in HCI issues
ii.chi Messages related to intelligent interfaces
intercultural.chi Cross-cultural issues and SIGCHI
socialaction.chi Discussion of CHI-related Social Issues
techprogram.chi Long range planning of CHI conf. program
vision.chi Discussions related to the future of SIGCHI
To be added to a mailing list, send a list of the CHI lists that you
want to receive to Nick Briggs at "Registrar.chi@xerox.com".
AI-CHI:
wiley!ai-chi@lll-lcc.llnl.gov
All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to wiley!ai-chi-request@LLL-LCC.LLNL.GOV.
[This machine seems to be defunct. Anybody knowing the new location
of the mailing list should send mail to mkant+ai-faq@cs.cmu.edu.]
----------------------------------------------------------------
Subject: [2-26] Knowledge Acquisition
kaw@swi.psy.uva.nl
KAW is a list server provided by the University of Amsterdam for
the knowledge acquisition community. It will carry news and
discussion relating to KA activities.
To join the KAW list, send a message with
subscribe KAW
in the body to service@swi.psy.uva.nl. For more information about the
list server, send
help
in the body instead.
----------------------------------------------------------------
Subject: [2-27] Knowledge-based Scheduling
sched-l@vexpert.dbai.tuwien.ac.at
Covers topics related to advanced scheduling techniques and
applications, especially knowledge-based scheduling of manufacturing
processes.
To subscribe, send mail to listserver@vexpert.dbai.tuwien.ac.at, with
the following line in the message body:
SUB SCHED-L
where
If you prefer getting a digest once a week, send additionally a
SET SCHED-L MAIL DIGEST
after subscribing as described above.
If you need to talk to a human being, talk to Sandford Bessler
sched-owner@vexpert.dbai.tuwien.ac.at will reach both of them.
----------------------------------------------------------------
Subject: [2-28] Knowledge Representation
Conceptual Graphs:
cg@cs.umn.edu
Conceptual Graphs are a general semantic network representation of
knowledge invented by John Sowa. They have the expressive power of
logic, but with an easy mapping to natural language.
See, for example,
John F. Sowa, "Conceptual Structures: Information Processing in
Man and Machine", Addison-Wesley, Reading, Mass, 1984.
John Florian Sowa, "Knowledge Representation", forthcoming.
To join, contact tjan@cs.umn.edu.
KQML:
kqml@cs.umbc.edu
Discussion of the conceptual design and use of KQML (Knowledge
Query and Manipulation Language), a protocol for exchanging
information and knowledge.
To subscribe, send mail to majordomo@cs.umbc.edu
with
subscribe kqml
in the message body.
The mailing list archives are accessible by WWW to
http://www.cs.umbc.edu/kqml/mail/
The KQML WWW page is
http://www.cs.umbc.edu/kqml/
and is also accessible by anonymous ftp to
ftp.cs.umbc.edu:/pub/kqml/
Knowledge Sharing:
srkb@cs.umbc.edu
For the shared-ontologies part of the Knowledge Sharing Effort of ARPA.
To join send a message to majordomo@cs.umbc.edu with
subscribe srkb
in the message body.
Interlingua:
interlingua@isi.edu
For the KIF language (Knowledge Interchange Format) of the ARPA
Knowledge Sharing Effort. KIF resembles predicate logic with many
added parentheses, plus some set theory.
----------------------------------------------------------------
Subject: [2-29] Logic Programming, Prolog
Prolog and Logic Programming:
prolog@sushi.stanford.edu (general)
prolog-hackers@sushi.stanford.edu (nitty gritty)
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to prolog-request@sushi.stanford.edu
[The host sushi.stanford.edu no longer exists, as of 11/24/92.
Does anybody know the new location of the mailing lists?]
Concurrent Logic Programming: [Mail to jlevy bounces. 8/18/93 mk]
clp.x@xerox.com
clp-request.All_Areas@xerox.com ??
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to clp-request.x@xerox.com or to
Jacob Levy
Constraint Logic Programming:
clp-request@cis.ohio-state.edu
LOGIC-L:
logic-l@bucknell.edu
Mailing list for the teaching and study of elementary logic.
To subscribe, send a message to listserv@bucknell.edu with
sub logic-l
in the message body.
LPNMR:
lpnmr@ms.uky.edu
Mailing list for logic programming and non-monotonic reasoning.
Send mail to lpnmr-request@ms.uky.edu to subscribe.
----------------------------------------------------------------
Subject: [2-30] Machine Discovery
Knowledge Discovery in Databases:
kdd@gte.com
KDD Nuggets is a moderated mailing list for the dissemination of
information relevant to Knowledge Discovery in Databases (KDD), such as
announcements of conferences/workshops, tool reviews, application
examples, information requests, interesting ideas, outrageous opinions,
and so on.
Moderator: Gregory Piatetsky-Shapiro
To subscribe, send mail to kdd-request@gte.com.
The KDD Nuggets archive is accessible by anonymous ftp from
ftp.gte.com:/pub/kdd/
or by WWW from
http://info.gte.com/~kdd/
It includes the KDD FAQ, a catalog of commercial and public domain
tools, a list of AI resources compiled by Chris Matheus
----------------------------------------------------------------
Subject: [2-31] Machine Learning
Machine Learning List:
ml@ics.uci.edu
The Machine Learning List is moderated. Contributions should be
relevant to the scientific study of machine learning. Mail requests
to be added or deleted to ml-request@ics.uci.edu.
Back issues may be obtained by anonymous FTP from
ics.uci.edu:/pub/ml-list/
in the subdirectory Vx/ as n or n.Z where x and n are the
volume and number of the issue. Use userid anonymous and your email
address as the password. The URL for back-issues is
http://www.ics.uci.edu/AI/ML/Machine-Learning.html
Reinforcement Learning:
reinforce@cs.uwa.edu.au
This is an informal unmoderated mailing list devoted to
reinforcement learning. The mailing list's archives are located at
ftp.gmd.de:/Learning/rl/.
To join, send mail to reinforce-request@cs.uwa.edu.au.
Inductive:
inductive@unb.ca
INDUCTIVE is a moderated mailing list dedicated to the discussion
of inductive (learning) processes.
To subscribe, send a message to inductive-server@unb.ca with
subscribe inductive YOUR NAME
in the message body.
----------------------------------------------------------------
Subject: [2-33] Natural Language Processing
Information Retrieval:
irlist
To subscribe send the following command to LISTSERV@UCCVMA.BITNET:
SUB IR-L your_full_name
where "your_full_name" is your real name, not your login Id.
Non-BitNet users can join by sending the above command as the only
line in the text/body of a message to
LISTSERV%UCCVMA.BITNET@VM1.NODAK.EDU.
Moderator: IRLUR%UCCMVSA.BITNET@VM1.NODAK.EDU
Natural Language and Knowledge Representation (moderated):
nl-kr@ai.sunnyside.com (formerly nl-kr@cs.rpi.edu, nl-kr@cs.rochester.edu)
Gatewayed to the newsgroup comp.ai.nlang-know-rep.
To subscribe, send LISTSERV commands to NL-KR-REQUEST@ai.sunnyside.com.
Back issues are available from
ai.sunnyside.com:/pub/nl-kr/
in the subdirectories Vxx/ as the files Nyy.Z. For example, issue
number 1 of volume 1 will be found as /nl-kr/V01/N01.Z. Mail requests
for backissues will not be promptly satisfied. The gopher server is
gopher://ai.sunnyside.com:70/pub/nl-kr
and the URL is
http://ai.sunnyside.com/pub/nl-kr
The NL-KR Digest will be slowly evolving into a citeable electronic journal.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to nl-kr-request@ai.sunnyside.com.
Natural Language Generation:
siggen@black.bgu.ac.il
Mailing list for the ACL Special Interest Group on Natural Language
Generation. Open to anybody interested in NLG.
The FTP repository,
black.bgu.ac.il:/pub/siggen/ [132.72.40.7]
contains archives of SIGGEN messages, the Dale and Kantrowitz NLG
bibliographies, and some software.
Moderated by Michael Elhadad. The siggen mailing list includes roughly
170 people.
Parsing:
sigparse@cs.cmu.edu
Speech Interfaces:
Electronic Communal Temporal Lobe (or ECTL) is a moderated mailing list
for speech interface enthusiats. To subscribe, send a message with your
name, institution, department, daytime phone and an email address to
ectl-request@snowhite.cis.uoguelph.ca. If you have trouble with this mail
address, call David Leip at (519) 824-4120 x3709 (office) x4297 (lab).
ECTL has an anonymous ftp archive which is located at
snowhite.cis.uoguelph.ca:/pub/ectl/ [131.104.48.1]
Included in the archive are: all issues of ECTL, as well as a list
of subscribers, lists of speech related products (s/w & h/w), and a
list of speech related technical report abstracts. If you would
like to contribute to the archive, please send mail to
ectl-sub@snowhite.cis.uoguelph.ca
If you need information about how to ftp, or such things, please
send mail to
ectl-request@snoehite.cis.uoguelph.ca
Statistics, Natural Language, and Computing:
empiricists@csli.stanford.edu
Corpus-based studies of natural language, statistical natural language
processing, methods that enable systems to deal with and scale up to
real-world usage, as well as how the various techniques can be useful
in such areas as information retrieval and human-computer interaction.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to empiricists-request@csli.stanford.edu
Dependency Grammar
dg@ai.uga.edu
Syntactic theory, analysis, and parsing using dependency grammar
(i.e., using links between individual words rather than a constituency
tree).
All requests for subscriptions or other assistance should be addressed
to mcovingt@ai.uga.edu.
Prosody:
To subscribe, send a one-line message to listserv@purccvm.bitnet
in the following format:
subscribe prosody
Translation and Interpretation of Natural Language:
lantra-l%finhutc.bitnet@cunyvm.cuny.edu
To add or remove yourself from the list, send a message to
listserv%finhutc.bitnet@cunyvm.cuny.edu. The sender of the message
you send must be the name (E-mail address) you want to add or remove
from the list. The text body of the message should be:
SUBSCRIBE LANTRA-L your_full_name
or:
SIGNOFF LANTRA-L
where your_full_name is your normal name, not your E-mail address.
Text Analysis and Natural Language Applications:
SCHOLAR%CUNYVM.BITNET@uga.cc.uga.edu
SCHOLAR is an online information service covering all aspects of
natural language processing in such fields as literary studies,
linguistics, history and lexicography. It consists of information like
book reviews, project reports database listings, a conference
calendar, and news of hardware and software relevant to the field.
SCHOLAR is distributed occasionally as the quantity of information
received allows. Contributions should be sent to Joseph Raben
To add or remove yourself from the list, send a message to
listserv@cunyvm.cuny.edu. The sender of the message
you send must be the name (E-mail address) you want to add or remove
from the list. The text body of the message should be:
SUBSCRIBE SCHOLAR your_full_name
or:
SIGNOFF SCHOLAR
where your_full_name is your normal name, not your E-mail address.
For technical assistance, send mail to
SCHOLAR files are available by anonymous ftp from jhuvm.hcf.jhu.edu
[128.220.2.2]. Use username scholar and type your login userid as a
password. The index of SCHOLAR files is SCHOLAR.INDEX. The WWW for
SCHOLAR is
gopher://jhuniverse.hcf.jhu.edu/11/.HAC/Journals/.SCHOLAR/
and includes a WAIS search engine.
The files are also available by listserv. For an explanation of
the coding system for items in SCHOLAR, send mail to
with the following as the body of the message:
Get SCHOLAR COD
To retrieve the entire release send mail to
with the folowing as the body of the message:
Get AZ Package
Text Corpora:
corpora@nora.hd.uib.no
Text corpora compilation, availability, and use.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to corpora-request@nora.hd.uib.no.
Files relating to the mailing list are available by anonymous ftp from
nora.hd.uib.no:/pub/corpora/ [129.177.24.42]
by mailserver from fileserv@nora.hd.uib.no (send a message with "help"
and "index" in the body to get help), or by gopher from
gopher://nora.hd.uib.no:70/
The list is hosted at the Norwegian Computing Centre for the Humanities
in Bergen, Norway. Questions about these services can be directed to:
Knut Hofland
Speech production and perception:
foNETiks
foNETiks is a monthly newsletter distributed by e-mail. The
focus is on speech production, speech perception, speech disorders,
automatic speech recognition and speech synthesis. It carries
job advertisements, notices of conferences, and other news of
general interest to phoneticians and speech scientists.
To be added to the list, send a message to
mailbase@mailbase.ac.uk
with
join fonetiks first_name last_name
in the message body, replacing "first_name" and "last_name" with your
first and last names respectively. To get an index of files
associated with the list (e.g., archives of previous issues), put
index FONETIKS
in the message body. To get off the list, put
leave fonetiks
in the message body.
The current editors are Linda Shockey and Gerry Docherty. They can
be reached at fonetiks-request@mailbase.ac.uk.
Contributions should be sent to fonetiks@mailbase.ac.uk.
LN:
ln@frmop11.bitnet
LN is an international electronic distribution list for computational
linguistics, with a French emphasis. Although the list is primarily
French-speaking, there are some posts in English. Topics of interest
include computational lexicography, study and use of corpora,
statistical models, as well as the usual calls for papers, conference
announcements, requests and discussions. The list is jointly
sponsored by the Association for Computational Linguistics (ACL) and
the Association for Computers and the Humanities (ACH).
To join LN, send a message to LISTSERV@FRMOP11.BITNET, containing only
the following line:
SUBSCRIBE LN your name
Send messages to be transmitted on the list to LN@FRMOP11.BITNET.
The list is moderated by Jean Veronis
(GRTC-CNRS, France) and Pierre Zweigenbaum
(DIAM-INSERM, France).
Linguist:
linguist@tamvm1.tamu.edu
The LINGUIST list is a moderated international list containing discussion
primarily of linguistics, although discussion of related fields is welcome.
To subscribe to the list, send a message to
listserv@tamvm1.tamu.edu
containing as its first and only line:
sub linguist
The URL for the linguist list archive is:
gopher://nic.merit.edu:7055/11/linguistics/linguist.list/
BILDIL:
BILDIL is a Turkish NLP Discussion Group.
To subscribe, send a message to listserv@trmetu.bitnet with
sub bildil
in the message body.
ELSNET:
elsnet-list@cogsci.ed.ac.uk
ELSNET is the European Network in Language and Speech mailing list.
This mailing list is used to announce activities, post job openings,
or discuss issues which are relevant to persons in the European
natural language and speech communities.
To join, send mail to elsnet@cogsci.ed.ac.uk
GESTURE-L:
gesture-l@coombs.anu.edu.au
The GESTURE-L mailing list discusses the study of gestures, sign
language, and related topics.
To subscribe to the list, send mail to
majordomo@coombs.anu.edu.au
with
subscribe gesture-l
in the message body.
Archives are available as
gopher://coombs.anu.edu.au:70/
Paramind:
Paramind@eskimo.com
The Paramind mailing list is for discussion of concepts of
computer-generated writing, especially those related to the theory of
the "telical exhaustion of the interaction of words". Telical means,
"towards an useful end".
To be added to the list, send a message to Paramind-request@eskimo.com.
The list's FAQ can be obtained by anonymous ftp from
eskimo.com:/usr/ftp/paramind/paramind.faq
The list is coordinated by telical@eskimo.com.
LFG:
This mailing list concerns Lexical-Functional Grammar.
To subscribe, send mail to majordomo@list.stanford.edu.
with
subscribe lfg
in the message body.
ConLang:
conlang@diku.dk
For discussion of any constructed or planned languages (from
Esperanto to Loglan/Lojban to Klingon, including AI-based languages).
To subscribe, write conlang-request@diku.dk or listserv@diku.dk.
----------------------------------------------------------------
Subject: [2-34] Qualitative Physics
qphysics@cs.washington.edu
To join, send mail to qphysics-request@cs.washington.edu.
----------------------------------------------------------------
Subject: [2-35] Robotics
Robot Controller Boards:
robot-board@oberon.com
The purpose of the Robot Board mailing list is to discuss robot
controller boards, and robot control in general. In particular, this
list will be used to support the Miniboard 2.0 and 6.270 board design
by Fred Martin and Randy Sargent of MIT. However, any and all traffic
related to robot controllers is welcome.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to robot-board-request@oberon.com.
You can also use ListServ to be added to or removed (send a message
with "help" in the body to listserv@oberon.com for more information).
IS Robotics Robots:
isrug@cs.umd.edu
Users' mailing list for those using or interested in the IS Robotics
Robots. This list is read by members of the company, but is primarily
intended for users wishing to contact each other.
All requests to be added to or deleted from this list, problems,
questions, etc., should be sent to isrug-requests@cs.umd.edu.
Hero Robots:
hero-owners@smcvax.smcvt.edu
Hero-owners is a mailing list for owners of HERO robots.
To subscribe to the list, send mail to
Hero-owners-request@smcvax.smcvt.edu
with
Subscribe Hero-owners
in the message body.
Questions or problems should be directed to Dave Goodwin
SPIE INFO-ROBO:
info-robo@mom.spie.org
INFO-ROBO is a mailing list from the International Society for
Optical Engineering (SPIE). Membership in SPIE is not required
to join the list.
To subscribe, send an e-mail message to
info-optolink-request@mom.spie.org
with the line
subscribe info-robo
in the message body.
For an up-to-date list of SPIE listserver groups
at any time, send the word LISTS to the same address.
Autonomous Vehicle - Mine Counter Measure:
av-mcm@stl.nps.navy.mil
The AV-MCM list is for discussion of the use of autonomous vehicles
and associated work packages and control concepts in the tasks of mine
(or hazardous materials) clearance on land, in the sea, or from the
air and space.
To subscribe to the list send a message to
av-mcm-request@stl.nps.navy.mil
without a subject line and
subscribe av-mcm your-email-address
in the message body. For information on mail archives, type
help
instead.
To talk to a human being send mail to Gary R. Porter
----------------------------------------------------------------
Subject: [2-36] Simulated Annealing
anneal@sti.com (formerly anneal-request@cs.ucla.edu (Daniel R. Greening))
This mailing list is for discussion of simulated annealing techniques,
analysis, and related issues such as stochastic optimization,
Boltzmann machines, and metricity of NP-complete move spaces.
Membership in this list is restricted to those doing active research
in simulated annealing or related areas. The list itself is
unmoderated.
To subscribe to anneal, send the following in an email message to
"majordomo@sti.com":
subscribe anneal
This will subscribe the account from which you send the message to the
anneal list.
If you wish to subscribe another address instead (such as a local
redistribution list), you can use a command of the form:
subscribe anneal other-address@your_site.your_net
To find out more about the automated server, send the following command
to "majordomo@sti.com":
help
If you feel you need to reach a human, send email to
anneal-approval@sti.com
----------------------------------------------------------------
Subject: [2-37] Simulation
simulation@ufl.edu
Gatewayed to the newsgroup comp.simulation.
All requests to be added to or deleted from this list, problems, questions,
etc., should be sent to simulation-request@ufl.edu.
----------------------------------------------------------------
Subject: [2-38] Symbolic Math
Symbolic Math
Gatewayed to the newsgroup sci.math.symbolic.
Mailing list covering symbolic math algorithms, applications and problems
relating to the various symbolic math languages.
Mail to be forwarded to the list should be sent to
leff%smu.uucp@uunet.uu.net (ARPANET/MilNet) or sci.math.symbolic (USENET).
Requests to be included on the list should be sent to
leff%smu.uucp@uunet.uu.net.
----------------------------------------------------------------
Subject: [2-39] Theorem Provers
theorem-provers@ai.mit.edu
This (unmoderated) list is intended for announcements of interest to
people interested in automated theorem proving.
To subscribe, send your email address to theorem-provers-request@ai.mit.edu.
----------------------------------------------------------------
Subject: [2-40] Case-Based Reasoning
AI-CBR:
AI-CBR is an e-mail forum for CBR researchers. Many of the
companies developing, selling and supporting CBR tools such as
ReMind, KATE, ReCall, CBR Express, and Esteem are members of the
mailing list. The mailing list also carries other information of
interest to CBR researchers.
To join AI-CBR send a message to Ian Watson
----------------------------------------------------------------
Subject: [2-41] Uncertainty
John Mark Agosta's uncertainty mailing list is defunct, but the
archives of the list can be found on
sumex-aim.stanford.edu:/var/ftp/pub/unc/
A new list has replaced it. To subscribe, send mail to
majordomo@maillist.cs.orst.edu with
subscribe uai
in the message body.
----------------------------------------------------------------
Subject: [2-45] Vision Research
vision-list@teleos.com
The Vision List is a bidirectional gateway to the comp.ai.vision
newsgroup. It provides copies of articles posted to the newsgroup in
the form of weekly digests.
Send submissions to vision-list@teleos.com. All requests to be added
to or deleted from this list, problems, questions, etc., should be
sent to Phil Kahn, the list's moderator, at
Archived in
teleos.com:/VISION-LIST-ARCHIVE/
cvnet%yorkvm1.bitnet@cunyvm.cuny.edu
Color and vision research.
----------------------------------------------------------------
Subject: [2-50] Commercial Systems: Kappa PC, ...
Kappa PC:
ai-kappa-pc@mailbase.ac.uk
Discussion list for users of Intellicorp's Kappa PC (a KBS/OOP/Windows
application development package). The list is intended for discussion
of any issues relevant to Kappa PC users, from OOP and KBS theory and
practice to specific bugs or niggles with the product. A library of
code and extensions to the product will be attached to the list.
To join the list, send a message to mailbase@mailbase.ac.uk containing
the line:
join ai-kappa-pc
For further information, contact Andy Vann
Dept of Civil Engineering, University of Bristol, UK, Tel (+44) 272
303030 x3312, Fax (+44) 272 303889.
----------------------------------------------------------------
Subject: [2-60] Miscellaneous: Artificial Morality, Kappa PC, OOP Frameworks
Artificial Morality:
artmoral-list@unixg.ubc.ca
This is a mailing list for discussion of Peter Danielson's book,
"Artificial Morality: Virtuous Robots for Virtual Games" (Routledge,
New York, 1992) and related issues. It explores theories of rational
morality with Prolog.
To join the list, send an email message to
artmoral-list-request@unixg.ubc.ca
Frog Net:
frog-net@rana.usc.edu
Frog Net is a mailing list for researchers interested in the
behavior and underlying neural mechanisms of amphibians.
To subscribe, send mail to Jim Liaw
Rough Sets:
roughset@cs.uregina.ca
EBRSC is the Electronic Bulletin of the Rough Set Community. Its
goal is to encourage the rapid dissemination of research related to
the study of Rough Set Theory, as first introduced by Z. Pawlak
(Z.Pawlak, "Rough Sets" Int. J. Inform. & Comput. Sci. 11:344-356, 1982.).
If you would like to subscribe, please send a short note with your
name and email address to roughset@cs.uregina.ca. Submissions should
be sent to the same address.
The archives of the bulletin are located at
ftp.cs.uregina.ca:/pub/ebrsc/ [142.3.200.53]
and include back issues of the Bulletin as well as data and
software contributions and a bibliography. They are also available
by gopher at gopher.cs.uregina.ca.
The EBRSC is edited by Mike Hadjimichael
Robert Golan
HOTT:
HOTT is a free monthly newsletter summarizing the latest developments
in computer, communications, and electronics technologies, as reported
in the popular press, trade magazines, research journals, mailing
lists, and newsgroups. Topics will include VR, neural networks, PDAs,
GUIs, intelligent agents, ubiquitous computing, genetic and
evolutionary programming, nanotechnology, and massively parallel
programming, among others.
To subscribe, send mail to listserv@ucsd.edu with
SUBSCRIBE HOTT-LIST
in the message body.
If you need to speak to a human being, send mail to hott@ucsd.edu.
HOTT is edited by David Scott Lewis
Intelligent Control (INTCON):
The INTCON (Intelligent Control) Special Interest Group is intended to
provide a forum for communication and exchange of ideas among
researchers in neuro-control, fuzzy logic control, reinforcement
learning and other related subjects grouped under the topic of
Intelligent Control. The emphasis is on application in control; by
"intelligence" we mean using ideas, techniques and procedures inspired
partly from biology, psychology, and so on.
To subscribe to INTCON, send mail to bahrami@syscon.ee.unsw.edu.au
INTCON is moderated by Mohammad Bahrami, School of Electrical
Engineering, University of New South Wales, P. O. Box 1, Kensington,
2033, NSW Australia.
CSGnet:
The Control Systems Group Network (CSGnet) is a mailing list for
folks interested in Perceptual Control Theory (PCT). PCT claims that a
fundamental aspect of organisms is their ability to control their
environment.
To subscribe, send a message to
listserv@vmd.cso.uiuc.edu
with
subscribe csg-l
help
get csg/Index
in the message body.
Several MS-DOS demonstration programs are available from the LISTSERV.
If you need to speak to a human being about subscription problems,
send mail to Gary Cziko
Intelligent Decision Support Systems (IDSS):
idss@socs.uts.edu.au
The IDSS Mailing list aims to act as a forum to exchange ideas on the
design, implementation and maintenance of Intelligent Decision Support
Systems (IDSS). IDSSs have proven to be successful at supporting
complex decision making problems at all levels of an organisation.
To subscribe to the IDSS mailing list, send e-mail to
listproc@socs.uts.edu.au
with the following line as the first and only line in the body of the
message:
subscribe IDSS
Do not include the brackets when specifying your full name.
If you have any problems with using the IDSS mailing list
please send e-mail to idss-request@socs.uts.EDU.AU
The list is a free service provided by the IDSSs laboratory in the
School of Computing Sciences at the University of Technology, Sydney (UTS).
It is maintained by Andrew Blair
UNIPEN:
SCRIB-L is a mailing list for on-line handwriting recognition. The
main focus of the mailing list is to exchange data and benchmarks.
The list is organized by Isabelle Guyon and Lambert Schomaker.
Send mail to isabelle@neural.att.com to be added to the mailing list.
MET-AI:
met-ai@comp.vuw.ac.nz
MET-AI is a mailing list concerned with applications of artificial
intelligence to meteorology. Topics include applications of machine
learning to weather forecasting, artificial neural networks in
meteorology, automatic interpretation and analysis of satellite
imagery, automatic synthesis of weather forecast texts, case-based
reasoning and meteorology, expert systems and decision aids for
weather forecasting, high-level interfaces to archives of
meteorological data, and statistical pattern recognition.
To subscribe, send an email message to
met-ai-request@comp.vuw.ac.nz
with
subscribe
in the message body. MET-AI is an unmoderated mailing list.
Problems and suggestions to Eric Jones
AI-NAT:
ai-nat@adfa.oz.au
Application of AI techniques to domains involving the natural world,
including natural resource management, mining, water resources,
defence, development planning and so on.
To subscribe, send a message to
Majordomo@adfa.oz.au
containing the line
subscribe ai-nat
OOP Frameworks:
FWList@AOL.COM
FWList is a moderated mailing list for discussion of Object Oriented
Frameworks, including Taligent's framework-based system, Microsoft's
MFC, and Apple's OpenDoc Parts Framework.
To subscribe to the list send a message to FWList@AOL.COM, with the word
subscribe
in the subject line and your name and preferred e-mail address in the
message body.
Wisdom List:
wisdom@mcs.com
For CYC-like ontologies for story understanding, human activities
in the real world, and especially interactive fiction and adventures.
To join write to wisdom-request@mcs.com.
----------------------------------------------------------------
Subject: [2-61] AI Research
AI-Discuss is a mailing list for discussion of AI research. To
subscribe, send mail to
ai-discuss-request@ai.mit.edu
Submissions should be sent to ai-discuss@ai.mit.edu. The list is
maintained by Pushpinder Singh
---
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to
[ ask your news administrator to fix the problems with your system. ]
From: cardo@cs.ucla.edu
Subject: Artificial Intelligence FAQ: Associations and Journals 3/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: AI-related Associations and Journals
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part3
Posting-Frequency: monthly
Last-Modified: Wed Mar 17 14:33:13 PST 1999 by Ric Crabbe
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_3.faq
Size: 64134 bytes, 1514 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Ric Crabbe, Amit Dubey, and Mark Kantrowitz
;;; ai_3.faq
This part of the AI FAQ provides a list of AI-related associations and
journals.
Part 3 (AI-related Associations and Journals):
List of AI-related associations and journals, organized by subfield.
Outline:
[3-0] General Information
[3-1a] Associations (General AI)
[3-1b] Associations (General AI, in a particular country)
[3-1c] Associations (Applied AI)
[3-1d] Associations (Natural Language Processing)
[3-1e] Associations (Cognitive Science)
[3-1f] Associations (Robotics)
[3-1g] Associations (Philosophy of AI)
[3-1h] Associations (Neural Networks)
[3-1i] Associations (Fuzzy Logic)
[3-1j] Associations (Genetic Algorithms)
[3-1k] Associations (AI and Law)
[3-2a] Journals (General AI)
[3-2b] Journals (Applied AI)
[3-2c] Journals (AI and ???, where ??? is Database Management,
Education, Engineering, Law, Manufacturing, Medicine, or Society)
[3-2d] Journals (Automated Reasoning)
[3-2e] Journals (Cognitive Science)
[3-2f] Journals (Complex Systems, Artificial Life, Adaptive Behavior)
[3-2g] Journals (Concurrent Engineering)
[3-2h] Journals (Engineering)
[3-2i] Journals (Expert Systems)
[3-2j] Journals (Fuzzy Logic)
[3-2k] Journals (Genetic Algorithms)
[3-2l] Journals (HCI, User Modeling)
[3-2m] Journals (Logic Programming)
[3-2n] Journals (Machine Learning)
[3-2o] Journals (NLP/Speech/MT)
[3-2p] Journals (Neural Nets/Connectionism)
[3-2q] Journals (Object-oriented Programming)
[3-2r] Journals (Pattern Recognition)
[3-2s] Journals (Reasoning Under Uncertainty)
[3-2t] Journals (Robotics)
[3-2v] Journals (Virtual Reality)
[3-2w] Journals (Vision)
[3-2x] Miscellaneous (Design, ...)
[3-3] Newsletters
Search for [#] to get to question number # quickly.
----------------------------------------------------------------
Subject: [3-0] General Information
When looking for a particular journal, please also check the list of
associations, as some journals have been listed with the association
that publishes them.
The scholarly societies project home page lists Web pages and gophers
for many scholarly societies. The URL for this resource is
http://www.lib.uwaterloo.ca/society/overview.html
----------------------------------------------------------------
Subject: [3-1a] Associations (General AI)
AMERICAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AAAI)
AAAI, 445 Burgess Drive, Menlo Park, CA 94025.
phone 415-328-3123, fax 415-328-4457, info@aaai.org, membership@aaai.org,
URL: http://www.aaai.org,
Membership includes AI Magazine, and the AI Directory:
$50 regular, $20 student, $75 institution/library (US/Canadian)
$75 regular, $45 student, $100 institution/library (Foreign)
AAAI has several special interest groups (SIGs) on medicine,
manufacturing, business, and law. (Add $10/year for each subgroup.)
Life memberships $700 (US/Canadian), $1000 (Foreign)
ASSOCIATION FOR COMPUTING MACHINERY (ACM)
ACM, 1515 Broadway, New York, NY 10036.
ACM, PO Box 12105, Church St. Station, New York, NY 10257.
Member Services, 11 West 42nd Street, New York, NY 10036.
800-342-6626 (212-626-0500), 212-869-7440. Fax 212-944-1318.
Email: acm_help@acm.org, acmhelp@acmvm.bitnet.
In Europe: ACM European Service Center, Avenue Marcel Thiry 204, 1200
Brussels, Belgium, +32-2-774-9602, fax +32-2-774-9690, email
acm_europe@acm.org.
To get ACM news bulletins, send a message with
subscribe info_flash
in the body to mailserv@acm.org.
URL: http://www.acm.org
$82 regular, $25 student (includes Communications of the ACM)
$15 ($8 students) extra for SIGART membership (gets Sigart Bulletin;
non-member subscription is $25)
$12 ($7 students) extra for Lisp Pointers.
$18 ($13 students) extra for Computing Surveys
$37 ($32 students) extra for Computing Reviews
INTERNATIONAL ASSOCIATION OF KNOWLEDGE ENGINEERS (IAKE)
IAKE, 973-D Russell Avenue, Gaithersburg, MD 20879-3276.
301-948-5390, fax 301-926-4243. Email: iake@umuc.umd.edu
$65 regular ($110 2-year), $30 students in US/Canada.
Add $10/year for Carribean, Central America, Mexico.
Add $25/year for Europe, North Africa, South America.
Add $30/year for Asia, USSR, Central and South Africa, Australia, and
New Zealand.
INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS (IEEE)
IEEE Service Center, 445 Hoes Lane, PO Box 1331, Piscataway, NJ 08855.
1-800-678-IEEE, 908-981-0060 (IEEE Computer Society 908-981-1393)
URLs: http://www.computer.org, http://www.ieee.org
IEEE membership is $95 regular ($28 students)
For membership in the IEEE Computer Society, add $22 ($13 students).
$20 for IEEE Expert (Intelligent Systems and their Applications)
$12 for Transactions on Neural Networks
$12 for Transactions on Systems, Man and Cybernetics
$15 for Transactions on Robotics and Automation
$19 for Transactions on Knowledge and Data Engineering
$24 for Transactions on Pattern Analysis and Machine Intelligence
ARTIFICIAL INTELLIGENCE AND SIMULATION OF BEHAVIOR (AISB)
c/o AISB Executive Officer, School of Cognitive Science,
University of Sussex, Brighton BN1 9QH, UK.
Tel: +44-0-273-678448
Fax: +44-0-273-671320
Email: aisb@cogs.susx.ac.uk
Established in 1964, AISB is the UK's original and foremost AI
society. Publishes the AISB Newsletter. UK members also receive AI
Communications (the European Journal on Artificial Intelligence).
Membership is 25 pounds Sterling (15 for students) in the UK, 28 pounds in
Europe (19 pounds for students), and forty pounds elsewhere (25 pounds for
students).
----------------------------------------------------------------
Subject: [3-1b] Associations (General AI, in a particular country)
AAAI is listed in [3-1a] because its membership is international in
nature, more so than other country-specific organizations.
EUROPEAN COORDINATING COMMITTEE FOR ARTIFICIAL INTELLIGENCE (ECCAI)
The representative body for the European AI community. Established
July 1982. Organizes the biennail European Conference on Artificial
Intelligence (ECAI), the leading conference on AI in Europe.
Individuals do not become members of ECCAI directly, but by belonging
to one of ECCAI's member organizations, many of which are described in
this section. [Not every organization listed in this section is part
of ECCAI, of course.]
Els van der Heijden, ECCAI Secretariat, c/o Knowledge-based Systems Group,
Department of Computer Science, University of Twente, P.O. Box 217,
7500 AE Enschede, The Netherlands
Tel: +31 53 489 4283
Fax: +31 53 489 2927
Email: els@cs.utwente.nl
URL: http://www.eccai.org
Members of associations that are part of ECCAI receive subscriptions
to the journal AI Communications, currently edited by Ramon Lopez de
Mantaras, IIIA - Institut d'Investigacio en Intel.ligencia Artificial,
CSIC - Spanish Scientific Research Council, Campus Universitat
Autonoma de Barcelona, 08193 Bellaterra, Catalunya, Spain, fax +34 3
5809661, phone +34 3 5809570, email mantaras@iiia.csic.es.
...
ASSOCIAZIONE ITALIANA PER L'INTELLIGENZA ARTIFICIALE (AI*IA)
ITALIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE
c/o Fondazione Ugo Borboni, Roma - Italy
Contact: Oliviero Stock
Tel: +39 6 54803428
Fax: +39 6 54804405
URL: gopher://gopher.di.unito.it/11/assoc/aiia [mostly in Italian]
AUSTRIAN SOCIETY FOR ARTIFICIAL INTELLIGENCE (ASAI)
OSTERREICHISCHE GESELLSCHAFT FUR AI (OGAI)
Postfach 177, A-1014 Vienna, AUSTRIA
Tel: (43) 1 535-32810
Fax: (43) 1 532-0652 (attn: OGAI)
Email: harald@ai.univie.ac.at
BELGIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (BAAI)
Walter Van de Velde, ArtiLab., Free University Brussels, Pleinlaan 2,
gebouw k, B-1050 Brussel
Email: walter@arti17.vub.ac.be
BRITISH COMPUTER SOCIETY SPECIALIST GROUP ON EXPERT SYSTEMS (BCS-SGES)
Chairman: Prof. M.A. Bramer, Department of Information Science,
University of Portsmouth, Milton, Southsea PO4 8JF, England
Tel: +44-705-844444
Fax: +44-705-844006
Email: bramerma@csovax.portsmouth.ac.uk
Membership/Mailings: Dr. Rob Milne, Intelligent Applications Ltd.,
Kirkton Business Centre, Kirk Lane, Livingston Village, West Lothian
EH54 7AY, Scotland
Tel: +44-506-410242
Fax: +44-506-410243
Email: rmilne@cix.compulink.co.uk
BULGARIAN ARTIFICIAL INTELLIGENCE ASSOCIATION (BAIA)
Institute of Informatics - BAS, Acad. Bonchev str. bl. 29A, Sofia
1113, Bulgaria
Fax: +359-2-72-01-66
Chairman: Vassil Sgurev, +359-2-70-52-25
Secretary: Danail Dochev, +359-2-70-75-86, email ari@iinf.bg
CANADIAN SOCIETY FOR COMPUTATIONAL STUDIES OF INTELLIGENCE (CSCSI)
Members receive a subscription to Canadian Artificial Intelligence.
CSCSI/SCEIO, c/o CIPS, 430 King Street West, Suite 205, Toronto,
Ontario M5V 1L5, CANADA
416-593-4040, fax 416-593-5184
Membership: $40 individuals, $30 students
URL: http://ai.iit.nrc.ca/cscsi_point.html
CATALAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (ACIA)
URL: http://www.iiia.csic.es/ACIA/ACIA.html
Email: acia@lsi.upc.es
President: Enric Plaza i Cervera
IIIA - Institut d'Investigacio en Intel.ligencia Artificial
CSIC - Spanish Scientific Research Council,
Campus Universitat Autonoma de Barcelona
08193 Bellaterra, Catalonia, Spain
Voice: +34 3 5809570 Fax: +34 3 5809661
Secretary: Jordi Vitria
CZECH SOCIETY FOR CYBERNETICS AND INFORMATICS (CSCI)
President: Jaroslav Vlcek, Czech Technical University, Zikova 4, 166 35
Prague 6, Czech Republic
Tel: +42-2-311-3475
Fax: +42-2-311-9692
Scientific Secretary: Radim Jirousek, Institute for Inf. Theory and
Automation Pod vodarenskou vezi 4, 182 08 Praha 8, Czech Republic
Tel: +42-2-815-20-46
Fax: +42-2-84-74-52
E-mail: radim@cspgas11.bitnet
DANISH ARTIFICIAL INTELLIGENCE SOCIETY (DAIS)
Brian Mayoh, Computer Science Department, Aarhus University, Ny
Munkegade, Bldg.540, DK-8000 Aarhus C
Tel: +45-86-12-71-88
Fax: +45-86-13-57-25
Email: brian@daimi.aau.dk
FINISH ARTIFICIAL INTELLIGENCE SOCIETY (FAIS)
Dr. Eero Hyvonen, VTT/TIK, Lehtisaarentie 2, SF-00340 Helsinki, FINLAND
Tel: +358-0-456-6043
Fax: +358-0-489-519
Email: Eero.Hyvonen@vtt.fi
FRENCH ASSOCIATION FOR COGNITIVE SCIENCE (ARC)
Chairman: Daniel Kayser, Department d'Informatique, Universite de
Paris XIII, Avenue Jean-Baptiste Clement, 93430 Villetaneuse, France
Tel: +33-1-49-40-30-00
Email: dk@lipn.univ-paris13.fr
Secretary: Pierre-Yves Raccah, 4 rue du Roi de Sicile, 75004 Paris, France
Tel: +33-1-42-71-69-76
Email: pyr@ccr.jussieu.fr
FRENCH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AFIA)
Chairman: Jean-Paul Haton, CRIN - Universite de Nancy I, BP 239, 54506
Vandouvre-les-Nancy Cedex
Tel: 83-59-20-50
Fax: 83-41-30-79
Email: jph@loria.fr
Secretary: Marie-Odile Cordier, IRISA - Campus de Beaulieu, Avenue du
General Leclerc, BP 25A, 35042 Rennes Cedex
Tel: 99-84-73-14
Fax: 99-38-38-32
Email: cordier@irisa.fr
FRENCH SOCIETY FOR INFORMATION AND SYSTEMS SCIENCES AND TECHNOLOGY (AFCET)
AFCET, Sabine Forgeot, 156, boulevard Pereire, F - 75017 Paris
GERMAN INFORMATICS ASSOCIATION (GI)
Chair of AI Chapter of GI:
Dr. Otthein Herzog
PRGS Germany - GSDL - Information Warehouse/7030-91
IBM Deutschland Entwicklung GmbH
Hanns-Klemm-Stasse 45
D-71034 Boeblingen, Germany
Tel: +49-7031-16-6813
Fax: +49-7031-16-6440
Email: otthein_herzog@vnet.ibm.com
International Relations Officer of GI:
Prof. Wolfgang Wahlster
DFKI
Stuhlsatzenhausweg 3
D-66123 Saarbruecken, Germany
Tel: +49-681-302-5252
Fax: +49-681-302-5341
Email: wahlster@dfki.uni-sb.de
[Hungary] JOHN VON NEUMANN SOCIETY FOR COMPUTING SCIENCES (NJSZT)
Ljuba Kornis, John von Neumann Society for Computing Sciences, Bathori
u. 16, H - 1054, BUDAPEST V.
Tel: +361-132-9349
Fax: +361-131-8140
ARTIFICIAL INTELLIGENCE ASSOCIATION OF IRELAND (AIAI)
Dr. Mark Keane, Dept. of Computer Science, Trinity College, Dublin 2, IRELAND
Email: mkeane@cs.tcd.ie
ISRAELI ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (IAAI)
Contact: Prof. Martin Charles Golumbic, Dept. of Mathematics and
Computer Science, Bar-Ilan University, Ramat Gan, Israel
Email: golumbic@bimacs.cs.biu.ac.il
Secretary: Mrs. Ruth Kuperman, secretary, Israeli Association for
Artificial Intelligence (IAAI), Kfar HaMacabia, Ramat Gan, Israel
ITALIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AI*IA)
President: Oliviero Stock, IRST - Instituto per la Ricerca Scientifica
e Tecnologica, 38050 Povo, Trento, Italy
Tel: +39-(0)461-814443
Fax: +39-(0)461-810851
Email: stock@irst.it
JAPANESE ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (JSAI)
OS Bldg. Suite #402
4-7 Tsukudo-cho, Shinjuku-ku
Tokyo 162 Japan
Phone: +81-3-5261-3401
Telfax: +81-3-5261-3402
[Mexico] SOCIEDAD MEXICANA DE INTELIGENCIA ARTIFICIAL (SMIA)
Ofelia Cervantes V, Apartado Postal #5, Universidad de las Americas,
Sta. Catarina Martir Puebla 72820, MEXICO
(52-22) 47-0522, (52-22) 47-4319
[Netherlands] DUTCH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (NVKI)
Chairman: Jaap van den Herik, University of Limburg, Faculty of
General Sciences, Department of Computer Science, PO Box 616, NL-6200
MD Maastricht, the Netherlands
Tel: +31-43-883477
Fax: +31-43-252392
Email: herik@cs.rulimburg.nl
Secretary: Jan Treur, Vrije Universiteit, Faculty of Mathematics and
Computer Science, Department of Computer Science, De Boelelaan 1081a,
NL-1081 HV Amsterdam, the Netherlands
Tel: +31-20-5485326/7273
Fax: +31-20-6427705
Email: treur@cs.vu.nl
NORWEGIAN ARTIFICIAL INTELLIGENCE SOCIETY (NAIS)
President: Dr. Bernt Bremdal, Geoknowledge, 1300 Sandvika, Norway
Tel: +47-67-54-72-44
Fax: +47-67-54-72-34
Email: nais@ifi.uio.no
SOVIET ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (SAAI)
DSc. Stefanuk, L. Vadim
SAAI - (Soviet) Association for Artificial Intelligence, Institute for
Information Transmission Problems, Russian Academy of Sciences,
Ermolovoy str. 19, 101447 Moscow GSP-4, Russia
Tel: 7-095-2995002; 7-095-2094981
Fax: 7-095-2090579
Email: stefanuk@ippi.msk.su
SLOVAK SOCIETY FOR CYBERNETICS AND COMPUTER SCIENCE (SSKI)
Chairman: Dr. Eng. Jan Mikles, Dept. of Process Control, Faculty of
Chemical Technology, Slovak Technical University, Radlinskeho 9, 812 37
Bratislava, Slovak Republic
Secretariat: Dr. Maria Psotulkova, Institute of Control Theory and
Robotics, Slovak Academy of Sciences, Dubravska cesta 9, 842 37
Bratislava, Slovak Republic
Tel: +427-373271
Fax: +427-376045
SLOVENIAN ARTIFICIAL INTELLIGENCE SOCIETY (SLAIS)
Chairman: Ivan Bratko, Faculty of Electrical Engineering and Computer
Science, Trzaska 25, 61000 Ljubljana, Slovenia
Tel: +38-61-265-16
Fax: +38-61-264-990
Email: Ivan.Bratko@ijs.si
Secretary: Bogdan.Filipic@ijs.si
SPANISH ASSOCIATION FOR ARTIFICIAL INTELLIGENCE (AEPIA)
President: Francisco Garijo, Telfonica, Investigacion y Desarrollo,
C/Emilio Vargas no. 6, 28043 - Madrid (SPAIN)
Tel: (34-1) 337-42-35
Fax: (34-1) 337-42-02
Secretary: Angel Vina, E.T.S. Ingenieros de Telecomunicaciones, Ciudad
Universitaria s/n, 28040 - Madrid (SPAIN)
Tel: (34-1) 549-57-00 x438
Tel: (34-1) 543-20-77
SWEDISH ARTIFICIAL INTELLIGENCE SOCIETY (SAIS)
Chairman: Carl-Gustaf Jansson, Dept. of Computer and Systems Sciences,
KTH/University of Stockholm, Electrum 230, 16440 KISTA, Sweden
Tel: +46-8-161605
Fax: +46-8-7039025
Email: calle@dsv.su.se
Secretary: Sture Hagglund, Dept. of Computer and Information Science,
Linkoping University, S-58183 Linkoping, Sweden
Tel: +46-13-281431
Fax: +46-13-142231
Email: sth@ida.liu.se
SWISS GROUP FOR ARTIFICIAL INTELLIGENCE AND COGNITIVE SCIENCE (SGAICO)
President: Rene Bach, Ingenieurschule Bern HTL, 3014 Bern
Tel: 41-31-495-111
Fax: 41-31-400-625
Email: bach@isbe.ch
Secretary: Frank Ade, ETH, 8092 Zurich.
Tel: 41-1-256-52-80
Fax: 41-1-261-34-29
Email: ade@vision.eth.zh
URL: http://expasy.hcuge.ch/sgaico/
----------------------------------------------------------------
Subject: [3-1c] Associations (Applied AI)
INTERNATIONAL SOCIETY OF APPLIED INTELLIGENCE (ISAI)
Membership is US$25 for associate members and US$85 for full members.
Full members receive a personal subscription to the International Journal of
Applied Intelligence (normal institutional rate is US$312) and discounted
registration for the IEA/AIE conferences. To apply contact ISAI, Department
of Computer Science, Southwest Texas State University, San Marcos, TX
78666-4616, phone +1 (512) 245 3409, fax +1 (512)245 3804, or send email to
Moonis Ali, President,
See WWW page at
Working groups include CIM -- Learning in Intelligent Manufacturing
Systems, Automatic Failure Diagnostics, Production Management,
Finance, Building Architecture, Scheduling and Planning.
----------------------------------------------------------------
Subject: [3-1d] Associations (Natural Language Processing)
ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL)
Natural language processing research and applications.
Members receive the journal Computational Linguistics, ISSN 0891-2017.
Regular membership $40 ($25 full-time students not earning a regular
income; $25 for retired and unemployed), $10 extra for first
class/air postage in North America, $20 elsewhere. For more
information write to Association for Computational Linguistics,
PO Box 6090, Somerset, NJ 08875, or send email to acl@cs.columbia.edu.
Institutions must subscribe to the journal through MIT Press Journals,
55 Hayward Street, Cambridge, MA 02142, USA, phone 617-253-2889, fax
617-258-6779, e-mail journals-orders@mit.edu.
To get information about the ACL listserver, send mail to
listserv@cs.columbia.edu
with
index acl-l
in the message body. To get the membership form, include
get acl-l membership-form.txt
in the message body. The ACL archive can also be accessed by
anonymous ftp from ftp.cs.columbia.edu:/acl-l/. The ACL Web page is
accessible through the URLs
http://crl.nmsu.edu/acl94/Home.html
http://www.cs.columbia.edu/~acl/home.html
ASSOCIATION FOR MACHINE TRANSLATION IN THE AMERICAS (AMTA)
655 Fifteenth Street, NW, Suite 310, Washington, DC 20005
Membership: $40 Associate members, $65 active members, Institutional $200,
Corporate $400. Members receive the MT News International and the
MT Yellow Pages.
SIGNLL is the ACL Special Interest Group on Natural Language Learning
(language acquisition and related topics). To join, send mail to
walter.daelemans@kub.nl or use the forms on the SIGNLL home page. For
more information, see the SIGNLL home page at the URL
http://www.cs.rulimburg.nl/~antal/signll/signll-home.html
See also the Cognitive Science Society.
----------------------------------------------------------------
Subject: [3-1e] Associations (Cognitive Science)
COGNITIVE SCIENCE SOCIETY
Membership: $50 individuals, $25 student. Add $15 overseas postage.
Members receive a copy of the journal Cognitive Science without
additional charge. Write to Alan Lesgold, Secretary/Treasurer,
Cognitive Science Society, LRDC, University of Pittsburgh, 3939
O'Hara Street, Pittsburgh, PA 15260, fax 1-412-624-9149, email
al+@pitt.edu.
See AISB in [3-1a].
----------------------------------------------------------------
Subject: [3-1f] Associations (Robotics)
For a list of organizations that are robotics related, see the FAQ
posting for comp.robotics, maintained by Kevin Dowling
----------------------------------------------------------------
Subject: [3-1g] Associations (Philosophy of AI)
SOCIETY FOR MACHINES AND MENTALITY
James H. Moor, Treasurer, Society for Machines and Mentality,
Department of Philosophy, Dartmouth College, 6035 Thornton Hall,
Hanover, NH 03755-3592 U.S.A.
603-646-2155. Email: James.H.Moor@Dartmouth.edu
$5 Membership only
$50 Membership with subscription to _Minds and Machines_
----------------------------------------------------------------
Subject: [3-1h] Associations (Neural Networks)
INTERNATIONAL NEURAL NETWORK SOCIETY (INNS)
Membership is $55/year for non-students and $45/year for students, and
includes a subscription to "Neural Networks", the official journal of
the society.
INNS Membership, Suite 300, 1250 24th Street, NW, Washington, DC 20037
70712.3265@compuserve.com, 202-466-4667, fax 202-466-2888.
INNS Membership, P.O. Box 491166, Ft. Washington, MD 20749
INTERNATIONAL STUDENT SOCIETY FOR NEURAL NETWORKS (ISSNNets)
Membership is $5 per year.
ISSNNet, Inc., P.O. Box 15661, Boston, MA 02215
See also comp.org.issnnet.
JAPANESE NEURAL NETWORK SOCIETY (JNNS)
Department of Engineering, Tamagawa University,
6-1-1, Tamagawa Gakuen, Machida City, Tokyo,
194 JAPAN
Phone: +81 427 28 3457
Fax: +81 427 28 3597
URL: http://jnns-www.okabe.rcast.u-tokyo.ac.jp/jnns/home.html
EUROPEAN NEURAL NETWORK SOCIETY (ENNS)
URL: http://www.neuronet.ph.kcl.ac.uk/neuronet/organisations/enns.html
----------------------------------------------------------------
Subject: [3-1i] Associations (Fuzzy Logic)
INTERNATIONAL FUZZY SYSTEMS ASSOCIATION (IFSA)
Membership $180, includes a subscription to the International Journal
of Fuzzy Sets and Systems, ISSN 0165-0114.
Write to Prof. Philippe Smets, University of Brussels, IRIDIA, 50 av.
F. Roosevelt, CP 194/6, 1050 Brussels, Belgium.
NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY (NAFIPS)
For more information, contact Thomas H. Whalen, Secretary/Treasurer,
Decision Sciences Department, Georgia State University, Atlanta, GA 30303,
404-651-4080,
a workshop in alternating years.
SPANISH ASSOCIATION FOR FUZZY LOGIC AND TECHNOLOGIES (FLAT)
For more information, contact decsai@ugr.es, Prof. J. L. Verdegay
(Secretary), Department of Computer Science and Artificial
Intelligence of the University of Granada, Faculty of Sciences, 18071
Granada, Spain, call +34.58.244017 (19) (95), or fax +34.58.243317.
----------------------------------------------------------------
Subject: [3-1j] Associations (Genetic Algorithms)
EVOLUTIONARY PROGRAMMING SOCIETY
9363 Towne Centre Dr., San Diego, CA 92121, Attn: Bill Porto, Treasurer
Membership: $40/year ($10/year for students with id)
Members get a discounted registration at the annual conference.
----------------------------------------------------------------
Subject: [3-1k] Associations (AI and Law)
THE INTERNATIONAL ASSOCIATION FOR ARTIFICIAL INTELLIGENCE AND LAW (IAAIL)
Contact: Prof. Carole Hafner, IAAIL, College of Computer Science,
Northeastern University, 360 Huntington Avenue, Boston, MA 02115 USA
fax 617-373-5121, e-mail hafner@ccs.neu.edu.
Membership: $60 Regular, $35 student (incuding AI and Law Journal)
$25 Reduced (without journal subscription)
----------------------------------------------------------------
Subject: [3-2a] Journals (General AI)
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH (JAIR)
JAIR is a refereed publication, covering all areas of AI, that is
distributed free of charge over the internet by WWW, ftp, electronic mail,
gopher, and the newsgroups comp.ai.jair.announce (announcements and
abstracts of new papers) and comp.ai.jair.papers (papers, code, and other
materials, distinguished by subject line). In addition, each complete
volume of JAIR is published by Morgan Kaufmann.
Submissions in all areas of AI are invited. Papers should
describe work that has both practical and theoretical significance.
Only papers of the highest quality will be accepted. JAIR aims for
a review turn-around time of about 7 weeks, with electronic publication
occurring immediately after the editor receives the final version of an
accepted article.
JAIR can be accessed by via the World Wide Web using the URL
http://www.cs.washington.edu/research/jair/home.html
by gopher to
gopher://p.gp.cs.cmu.edu/
or by anonymous ftp to
p.gp.cs.cmu.edu:/usr/jair/pub/
ftp.mrg.dist.unige.it:/pub/jair/pub/
For more information, send electronic mail to jair@cs.cmu.edu with
the subject AUTORESPOND and the message body HELP. Or contact
jair-ed@ptolemy.arc.nasa.gov.
COMPUTATIONAL INTELLIGENCE, AN INTERNATIONAL JOURNAL (CI)
Published 4 times annually. ISSN 0824-7935
Blackwell Publishers, Journal Subscription Department,
238 Main Street, Cambridge, MA 02142, call 1-800-835-6770, or email
blkwell@world.std.com.
Blackwell Publishers, 108 Cowley Road, Oxford, OX4 1JF, England.
Individual subscriptions are $99 in North America and $110 in the rest of
the world. Institutional subscriptions are $214 and $233, respectively.
A reduced rate of $50 is available to members of AAAI and the Canadian
Society for Computational Studies of Intelligence (CSCSI).
Editors: Nick Cercone and Gordon McCalla.
Send electronic submissions to ci@cs.uregina.ca. Starting in 1994,
Basil Blackwell will typeset the entire journal LaTeX. LaTeX style
macros will be available by anonymous ftp from cs.uregina.ca:/pub/ci/.
They can also handle Microsoft Word and FrameMaker documents. Current
manuscript guidelines and subscription information are available from
the same ftp location. Their Web server is
http://calypso.cs.uregina.ca/CI/ci.html
and contains information on upcoming articles and issues, subscription
information, author instructions, and tables of contents.
ARTIFICIAL INTELLIGENCE REVIEW (Survey and Tutorial Journal)
ISSN 0269-2821.
Kluwer Academic Publishers,
101 Philip Drive, Norwell, MA 02061, 617-871-6600, fax 617-871-6528.
PO Box 358, Accord Station, Hingham, MA 02018-0358.
PO Box 322, 3300 AH Dordrecht, The Netherlands
Email: kluwer@world.std.com
The institutional subscription rate is $233.50 per volume (4 issues).
Editor: Masoud Yazdani
University of Exeter, Prince of Wales Road, Exeter, EX4 4PT, Great Britain
ARTIFICIAL INTELLIGENCE - AN INTERNATIONAL JOURNAL
Published 14 times annually. ISSN 0004-3702.
Subscriptions: $85 individuals (must be a member of one of the major
AI societies), $1278.75 institutions (Dfl 2366.00).
To order in the US, write to AAAI, AI Journal, 445 Burgess Drive, Menlo
Park, CA 94025-3496, or to Elsevier Science Publishing, 655 Avenue of
the Americas, New York, NY 10017, 212-633-3827. Outside the US,
contact Elsevier Science Publishers, Attn: Petra van der Meer, PO Box 103,
1000 AC Amsterdam, The Netherlands, call +31-20-5862-602, or
fax +31-20-5862-616.
JOURNAL OF EXPERIMENTAL AND THEORETICAL ARTIFICIAL INTELLIGENCE (JETAI)
Published quarterly, ISSN 0952-813X.
Subscriptions (1995): institutions $231; individuals $116.
Submissions: Eric Dietrich, SUNY, Binghamton, NY 13902-6000, USA,
To order in the US, write to Taylor and Francis, Inc., 1900 Frost Road,
Suite 101, Bristol, PA 19007-1598, phone 1-800-821-8312
(215-785-5800), fax 215-785-5515.
Or contact the home office: Taylor and Francis Ltd, Rankine Road,
Basingstoke, Hampshire, UK RG24 8PR, phone +44 (0) 256-840366,
fax +44 (0) 256-479438.
SPANG ROBINSON REPORT ON INTELLIGENT SYSTEMS
Published monthly. ISSN 0885-9957.
Subscriptions: $405 US & Canada, $455 elsewhere.
John Wiley and Sons, Inc., 605 Third Avenue, New York, NY 10158-0012,
212-850-6347, fax 212-850-6088.
JOURNAL OF INTELLIGENT SYSTEMS
Published quarterly, since 1985.
Freund Publishing House, London
http://http2.brunel.ac.uk:8080/~hs92jis/
MINDS AND MACHINES
Journal for Artificial Intelligence, Philosophy, and Cognitive Science
ISSN 0924-6495
Subscription information and sample copies available from:
Kluwer Academic Publishers Group, P.O. Box 322, 3300 AH Dordrecht,
The Netherlands. In the US, write to Kluwer Academic Publishers, 101
Philip Drive, Norwell, MA 02061.
COMPUTERS AND ARTIFICIAL INTELLIGENCE
I. Plander (ed.)
VEDA Publishing House of the Slovak Academy of Sciences,
Klemenosova 19, 814 30 Bratislava, Slovakia.
Published bimonthly, order from:
Lange & Springer GmbH, Foller Str.2, P.O.B. 10 16 10,
5000 Koln 1, Germany.
INTERNATIONAL JOURNAL OF AI TOOLS
World Scientific Publishing Co., Inc.
1060 Main Street, River Edge, NJ 07661
Tel: 1-800-227-7562
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
ISSN 1012-2443.
J.C. Baltzer AG Scientific Publishing Company, Wettsteinplatz 10,
CH-4058 Basel, Switzerland, tel 41-61-691-89-25, fax 41-61-692-42-62.
In the United States, send orders to J. C. Baltzer AG, Scientific
Publishing Company, PO Box 8577, Red Bank, NJ 07701-8577.
Subscriptions: Individuals Sfr. 130.00/$80.00
Editor: M. C. Golumbic
ARTIFICIAL INTELLIGENCE AND SOCIETY
Published quarterly, since 1987.
Subscriptions: UK pounds 110 + carriage charges
Springer Verlag, Heidelberger Platz 3, D-100 Berlin 33, Germany, phone
30-82071, fax 30-8214091.
JOURNAL OF SYMBOLIC COMPUTATION
Published monthly, since 1985.
Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK.
Subscriptions (includes postage): Individuals UK pounds 111, US $204;
Institutions UK pounds 222, US $408. Subscribers in Canada should add GST
at the current rate of 7%.
Send subscription orders to: Academic Press Ltd., Foots Cray, Sidcup,
Kent DA14 5HP, UK, phone 81-300-3322.
INFORMATICA
ISSN 0350-5596.
An International Journal of Computing and Informatics.
Published by The Slovene Society Informatika and The Jozef Stefan
Institute, Ljubjana, Slovenia.
Subscriptions: individuals $17, students $4, institutions $34
Mr. R. Murn, Department for Computer Science, Jozef Stefan Institute:
Tel (+386) 61 1259 199, Fax (+386) 61 219 385
Submissions: Matjaz Gams
contact), Marcin Paprzycki
and South America), or Xindong Wu
Australia).
Ftp: ftp.arnes.si:/magazines/informatica/ (basic information about
informatica and back issues)
----------------------------------------------------------------
Subject: [3-2b] Journals (Applied AI)
APPLIED ARTIFICIAL INTELLIGENCE
Published 4 times annually. ISSN 0883-9514
Subscriptions: Institutions $300; Individuals $142.
Hemisphere Publishing Corp., 1900 Frost Rd., Suite 101, Bristol, PA
19007-1598, 1-800-821-8312 (215-785-5800), fax 215-785-5515.
(in the UK, write to Taylor & Francis Ltd., Rankine Rd., Baskingstoke,
Hampshire RG24 0PR, UK, call +44-256-840366, or fax +44-256-479438)
APPLIED INTELLIGENCE
The International Journal of Artificial Intelligence, Neural Networks,
and Complex Problem-Solving Technologies
Subscriptions: Institutions $217; Individuals $75.
Editor in Chief: Dr. Moonis Ali, Professor of Computer Science, The
University of Tennessee Space Institute, Tullahoma, TN 37388
Publisher: Kluwer Academic Publishers, P.O. Box 358, Accord Station,
Hingham, MA 02018-0358,
----------------------------------------------------------------
Subject: [3-2c] Journals (AI and ???, where ??? is Database Management,
Education, Engineering, Law, Manufacturing, or Medicine)
AI and Database Management:
JOURNAL OF INTELLIGENT INFORMATION SYSTEMS (JIIS)
INTEGRATING AI AND DATABASE TECHNOLOGIES
Published quarterly. ISSN: 0925-9902
Subscriptions: Individuals, $85; Institutions $193.
Publisher: Kluwer Academic Publishers, PO Box 358/Accord Station,
Hingham, MA 02018-0358, 617-871-6600, fax 617-871-6528, e-mail
Kluwer@world.std.com.
AI and Education:
JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION
Published quarterly, since 1989.
Subscriptions: $65. Outside the US add $10 Canada/Mexico and $15 all
others for postage. Student and institutional rates available upon request.
Published by the Association for the Advancement of Computing in
Education (AACE), PO Box 2966, Charlottesville, VA 22902, phone
804-973-3987.
AI and Engineering:
ARTIFICIAL INTELLIGENCE IN ENGINEERING
Published 4 times annually. ISSN 0954-1810.
Subscriptions: 193 pounds ($295). Sample copies available upon request.
Claire Coakley, Elsevier Applied Science, Crown House, Linton Road,
Barking, Essex, IG11, 8JU, UK, phone 081-594-7272, fax 081-594-5140.
US info: Journal Information Center, Elsevier Science Publishers, 655
Avenue of the Americas, New York, NY 10010, phone 212-633-3650, fax
212-633-3990.
INTELLIGENT SYSTEMS ENGINEERING JOURNAL
Published by Inst. Elect. Engrs for the British Computer Soc. and the IEE.
Executive Editor: Kathryn Lenton (Mrs), Intelligent Systems
Engineering, IEE Publishing Dept., Michael Faraday House, Six Hills
Way, Stevenage, Herts., SG1 2AY, UK, phone 0438-313311, fax
0438-742849.
ARTIFICIAL INTELLIGENCE IN ENGINEERING DESIGN, ANALYSIS
AND MANUFACTURE (AI EDAM)
Published 4 times annually.
Editor: Clive L. Dym
of Engineering Design, Harvey Mudd College, Claremont CA 91711-5990
USA, phone 909-621-8853, fax 909-621-8967.
Subscriptions: $75 individual, $160 institution (US, Canada, Mexico).
Cambridge University Press, 40 West 20th Street, New York, NY
10011-4211 USA, fax 914-937-4712. Outside US, Canada, and Mexico,
write to Cambridge University Press, The Edinburgh Building, Cambridge
CB2 2RU, UNITED KINGDOM.
AI and Finance:
THE MAGAZINE OF ARTIFICIAL INTELLIGENCE IN FINANCE
Published quarterly.
415-905-2200
AI and Law:
ARTICIAL INTELLIGENCE AND LAW
Subscriptions: $158, including postage
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.
AI and Manufacturing:
JOURNAL OF INTELLIGENT MANUFACTURING (JIM)
Published quarterly, since 1990.
Chapman and Hall, London
Editor: Prof. Andrew Kusiak, Department of Industrial Engineering,
4132 Engineering Building, University of Iowa, Iowa City, IA 52242
JOURNAL OF MANUFACTURING SYSTEMS
Published quarterly, since 1982.
Published by the Computer and Automated Systems Association of the SME.
Society of Manufacturing Engineers, One SME Drive, PO Box 930,
Dearborn, MI 48121. 313-271-1500
AI and Medicine:
ARTIFICIAL INTELLIGENCE IN MEDICINE
Published 6 times annually. ISSN Number 0933-3657.
Subscriptions: $175.
To order in the US, write to Elsevier Science Publishing, 655 Avenue of
the Americas, New York, NY 10017, 212-633-3827. Outside the US,
contact Elsevier Science Publishers, Journal Department, PO Box 211,
1000 AE Amsterdam, The Netherlands, call +31-20-5803-642, or fax
+31-20-5803-598.
AI and Society:
AI & SOCIETY
Published quarterly. ISSN 0951-5666.
The Journal of Human-Centred Systems and Machine Intelligence
Topics include impact of AI and information technology on social
and cultural values and vice versa.
Editors: Karamuit S. Gill and James Finkelstein.
Springer-Verlag New York Inc., Journal Fulfillment Services, 44 Hartz
Way, Secaucus, NJ 07094, 1-800-SPRINGER.
Subscriptions: $197.
----------------------------------------------------------------
Subject: [3-2d] Journals (Automated Reasoning)
JOURNAL OF AUTOMATED REASONING
Published 6 times annually. ISSN 0168-7433
Subscriptions: Individuals $131; Institutions $263; AAR members $65.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.
AUTOMATED SOFTWARE ENGINEERING
The International Journal of Automated Reasoning and Artificial
Intelligence in Software Engineering.
Published quarterly. ISSN 0928-8910.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358, phone 617-871-6600, fax 617-871-6528,
email kluwer@world.std.com.
Subscriptions: individuals $95, institutions $255.50. Special reduced
rates available for ACM-SIGART and KBSE members.
ANNUAL REVIEW IN AUTOMATIC PROGRAMMING
Published annually, since 1960.
Supplement of "International tracts in computer science and technology
and their applications".
Published by Pergamon Press, 395 Saw Mill River Road, Elmsford, NY
10523, phone 800-257-5755 (914-592-7700).
Subscriptions: UK pounds 105 or US $200 (approximate). Postage included.
----------------------------------------------------------------
Subject: [3-2e] Journals (Cognitive Science)
COGNITIVE SCIENCE
Ablex Publishing Company,
355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax 201-767-6717
$50 individual, $125 institution.
BEHAVIORAL AND BRAIN SCIENCES
Published quarterly, since 1978.
In the UK: Cambridge University Press, The Edinburgh Building,
Shaftesbury Road, Cambridge CB2 2RU, UK.
In the US: Cambridge University Press, Journals Department, 40 West
20th Street, New York, NY 10011-4211.
BRAIN AND COGNITION
Published quarterly, since 1982.
Academic Press, 11, Fifth Avenue, New York, NY 10003
BRAIN AND LANGUAGE
Published bimonthly, since 1974
Academic Press, 1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax: 619-699-6715
COGNITION
Published quarterly, since 1972.
The Hague; Paris:Mouton, subscription orders must be sent to:
Subscriptions: US$670
Elsevier Science Publishers B.V., P.O. Box 211, 1000 AE Amsterdam,
phone (31)-20-5803642, fax (31)-20-5803598.
Cognition, Publication Expediting, Inc., 200 Meacham Avenue,
Elmont, NY 11003
COGNITION AND BRAIN THEORY
Published 1980-84, subsequently absorbed into Cognitive Science.
COGNITIVE PSYCHOLOGY
Published quarterly, since 1970
Academic Press, 1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax: 619-699-6715
----------------------------------------------------------------
Subject: [3-2f] Journals (Complex Systems, Artificial Life, Adaptive Behavior)
COMPLEXITY INTERNATIONAL
This is a refereed journal for scientific papers relating to work
in complex systems research. It is available by anonymous ftp from
life.anu.edu.au:/pub/complex_systems/ci/
Send manuscripts to ci-submissions@life.anu.edu.au,
and editorial correspondence to ci-editor@life.anu.edu.au
To subscribe, send mail to ci-subscribe@life.anu.edu.au with
subscribe ci "your name"
in the message body.
ARTIFICIAL LIFE
Published quarterly. ISSN 1064-5462.
Subscriptions: $45 individual ($25 student/retired), $125 institution.
Canadians add 7% GST, shipping outside US add $14 postage and handling.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142,
call 617-253-2889, fax 617-258-6779, or e-mail journals-orders@mit.edu.
Submissions: Christopher G. Langton, Santa Fe Institute, 1660 Old
Pecos Trail, Santa Fe, NM 87501, call 505-984-8800, fax 505-982-0565,
or e-mail cgl@santafe.edu. See also http://alife.santafe.edu/
ADAPTIVE BEHAVIOR
Published quarterly. ISSN 1059-7123.
Concerned with understanding the behaviors and underlying
mechanisms that allow animals (and potentially robots) to adapt and
survive in uncertain environments. Emphasis on well-defined models,
computer simulations, and built robots.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142,
call 617-253-2889, fax 617-258-6779, or e-mail journals-orders@mit.edu.
Subscriptions: individual $50 (student/retired $35), institutions $125.
Canadians add 7% GST, shipping outside US add $14 postage and handling.
Submissions: J. A. Meyer, Groupe de BioInformatique- Ecole Normale Superieure
46 rue d'Ulm, 75230 Paris cedex 05 France, email meyer@wotan.ens.fr.
----------------------------------------------------------------
Subject: [3-2g] Journals (Concurrent Engineering)
CONCURRENT ENGINEERING: RESEARCH & APPLICATIONS (CERA)
Published quarterly.
Official journal of the Concurrent Engineering Institute of the
International Society for Productivity Enhancement (ISPE).
Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK. Call
71-267-4466, fax 71-482-2293 or 71-485-4752, or email ac2@ib.rl.ac.uk.
Relevant to parallel processing, blackboard systems, distributed AI,
and AI in manufacturing.
For information about submissions, write to Biren Prasad, Managing
Editor, CERA Institute, PO Box 250254, West Bloomfield, MI 48325, call
313-492-0551, fax 313-661-8333, or send email to bprasad@cmsa.gmr.com.
----------------------------------------------------------------
Subject: [3-2h] Journals (Engineering)
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE
Published 6 times annually.
Subscriptions: Institutions (1992) 235.00 or approx US$425.00; two year
institutional rate (1992/93) 446.50 or approx US$807.50.
North America: Pergamon Press Inc., 660 White Plains Road,
Tarrytown, NY 10591-55153, USA.
Rest of the World: Pergamon Press Ltd, Headington Hill Hall,
Oxford OX3 0BW, England. Tel: Oxford (0865)794141
ENGINEERING OPTIMISATION
Published quarterly, since 1974.
Gordon and Breach, London
----------------------------------------------------------------
Subject: [3-2i] Journals (Expert Systems)
See the Expert System Shells FAQ.
----------------------------------------------------------------
Subject: [3-2j] Journals (Fuzzy Logic)
INTERNATIONAL JOURNAL OF
UNCERTAINTY, FUZZINESS AND KNOWLEDGE-BASED SYSTEMS (IJUFKS)
Published 4 times annually. ISSN: 0218-4885
Intended as a forum for research on methods for managing imprecise,
vague, uncertain and incomplete knowledge.
Subscriptions: Individuals $90, Institutions $180. (add $25 for airmail)
World Scientific Publishing Co Pte Ltd, Farer Road, PO Box 128,
SINGAPORE 9128, e-mail phua@ictp.trieste.it, phone 65-382-5663, fax
65-382-5919.
Submissions: B Bouchon-Meunier, editor in chief, Laforia-IBP,
Universite Paris VI, Boite 169, 4 Place Jussieu, 75252 Paris Cedex 05,
FRANCE, phone 33-1-44-27-70-03, fax 33-1-44-27-70-00, e-mail
bouchon@laforia.ibp.fr.
MATHWARE AND SOFT COMPUTING
2 regular issues and one monographic issue a year. ISSN 0210-7821.
Partially supported by the Universitat Politecnica de Catalunya (UPC)
and the Spanish Association of Logic and Fuzzy Technologies (FLAT).
Topicsinclude Approximate Reasoning, Fuzzy Logic and Functional
Equations, applied to Soft Computing, Logic, Consensus, Possibilistic
Reasoning and other fields.
Editor: Prof. J. Jacas
Informatica, E.T.S. d'Arquitectura de Barcelona, Universitat
Politecnica de Catalunya, Diagonal 649, E-08028 Barcelona Spain,
fax 34-3-4016367.
Subscriptions: $50 (surface; $10 extra for air mail)
----------------------------------------------------------------
Subject: [3-2k] Journals (Genetic Algorithms)
EVOLUTIONARY COMPUTATION
Published 4 times annually, beginning April/May 1993.
100 pages per issue, 7x10. ISSN 1063-6550.
Editor-in-chief: Kenneth De Jong
Subscription Rates: individuals $45 (student/retired $30.00),
institutions $125.00. Canadians add 7% GST, shipping outside US add
$14 postage and handling.
MIT Press Journals, 55 Hayward Street, Cambridge, MA 02142-1399,
617-253-2889, fax 617-258-6779, E-mail hiscox@mitvma.mit.edu.
----------------------------------------------------------------
Subject: [3-2l] Journals (HCI, User Modeling)
INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES
(formerly INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES)
Published monthly, since 1969. ISSN 1071-5819.
Subscriptions (including postage): Individuals 161 pounds UK, US $291;
Institutions 437 pounds UK, US $792. Canadian subscribers should add
GST at current rate of 7%.
Publisher: Academic Press Ltd., 24-28 Oval Road, London, NW1 7DX, UK, phone
71-267-4466, fax 71-482-2293 or 71-485-4752, or email ac2@ib.rl.ac.uk.
Send subscription orders to: Academic Press Ltd., Foots Cray, Sidcup,
Kent DA14 5HP, UK, phone 81-300-3322.
Air freight and mailing in the USA by Publications Expediting, Inc.,
200, Meacham Avenue, Elmont, NY 10003.
USER MODELING AND USER-ADAPTED INTERACTION
4 issues per annum, ISSN 0924-1868,
$153.50 p.a. ($50 for individuals)
Kluwer Academic Publishers Group,
P.O. Box 322, 3300 AH Dordrecht,
The Netherlands.
INTERNATIONAL JOURNAL OF HUMAN-COMPUTER SIMULATION
Editors: Gavriel Salvendy, Purdue; Michael J. Smith, Univ. of
Wisconsin; and Masamitsu Oshima, MISDC.
Subscriptions: individual $45, institutions $125.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax 201-767-6717
----------------------------------------------------------------
Subject: [3-2m] Journals (Logic Programming)
JOURNAL OF LOGIC PROGRAMMING
Published bimonthly, since 1984.
Society rate available through Elsevier for members of the Association
of Logic Programming.
Subscriptions: Institutions $486 (outside US add $48 p&h).
Elsevier Science Publishing (direct orders to Cindy Williams) 655
Avenue of the Americas, New York, NY 10010, phone 212-633-3815, fax
212-633-3820 or Elsevier Science Publishing PO Box 211, Amsterdam,
1000 AE, The Netherlands, phone 020-580-3641, fax 020-580-3769.
NEW GENERATION COMPUTING
Published quarterly, since 1983.
Published in Japan in English by Ohmsha Ltd., 3-1 Kanda Nishiki-cho,
Chiyoda-ku, Tokyo 101 Japan, phone 03-3233-0641.
Subscriptions:
Japan: yen 28,000 including carriage charges.
Springer Verlag Tokyo, 37-3, Hongo 3-chome, Bunkyo-ku, Tokyo 113,
phone 03-3812-0331, fax 03-3812-0719.
North America: US $242 including carriage charges.
Springer Verlag New York Inc., Service Center Secaucus,
44, Hartz Way, Secaucus, NJ 07094, phone 212-460-1500.
All other countries: DM 338 plus carriage charges. Airmail delivery
on request only. Springer Verlag, Journal Fulfillment Department,
Heidelberger Platz 3, D-1000 Berlin 33, Germany, phone 30-82071
LOGIC PROGRAMMING NEWSLETTER
Published quarterly.
Included with membership in the Association for Logic Programming
($20 regular, $10 students). For membership information, write to
Cheryl Anderson (ALP), DoC-ICSTM, 180 Queens Gate, London SW7 2BZ,
UK, phone +44-71-589-5111 x5011, fax +44-71-589-1552, or send email
to alp@doc.ic.ac.uk. Contributions are welcome and should be sent
to Andrew Davidson
METHODS OF LOGIC IN COMPUTER SCIENCE
Published quarterly since 1994.
Editors: Rick L. Smith, Univ. of Florida, and Ralph W. Wilkerson,
Univ. of Missouri-Rolla.
Subscriptions: individuals $55, institutions $130.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax 201-767-6717
INFORMATION AND COMPUTATION
http://theory.lcs.mit.edu/~iandc/
Includes bibliography, list of editors, and author information.
----------------------------------------------------------------
Subject: [3-2n] Journals (Machine Learning)
MACHINE LEARNING
Published 8 times annually. ISSN 0885-6125
Subscriptions: Institutions $301; Individuals $140. (AAAI Individual
Members $88)
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.
----------------------------------------------------------------
Subject: [3-2o] Journals (NLP/Speech/MT)
COMPUTER SPEECH & LANGUAGE (CS&L)
Published 4 times annually. ISSN 0885-2308.
Subscriptions: Institutions $170, Individuals $75.
Harcourt Brace and Company Limited, High Street, Foots Cray, Sidcup,
Kent, DA14 SHP. England.
Editors: Prof. S.J. Young & Dr. S.E. Levinson
Submissions (outside Americas): Prof. Steve Young, Cambridge
University Engineering Dept., Trumpington Street, Cambridge, CB2
1PZ, England. Email: sjy@eng.cam.ac.uk
Submissions (from Americas): Dr. Steve Levinson, Head Linguistics
Reseach, AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill,
New Jersey 07974. USA. Email: sel@research.att.com
MACHINE TRANSLATION
Published 4 times annually. ISSN 0922-6567.
Subscriptions: Institutions $141 plus $16 postage; Individuals $55
(members of ACL $46).
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.
SPEECH TECHNOLOGY
Published quarterly, since 1981.
Media Dimensions, New York, NY, USA
NATURAL LANGUAGE & LINGUISTIC THEORY (NALA)
Published quarterly. ISSN 0167-806X
Subscriptions: Individual $59,-/Dfl.156,-; Institutional $200,-/Dfl.383,-
including p&h. Kluwer Academic Publishers
USA: Order Dept, Box 358, Accord Station, Hingham, MA 02018-0358. Phone
(617) 871-6600; Fax (617) 871-6528; E-mail: Kluwer@world.std.com
Other: P.O.Box 322, 3300 AH Dordrecht, The Netherlands. Phone (31) 78
524400; Fax (31) 78 183273; Telex: kadc nl; E-mail: vanderLinden@wkap.nl
JOURNAL OF NATURAL LANGUAGE ENGINEERING (JNLE)
Published quarterly, starting in March 1995.
Emphasis: Practical (commercial) applications of computational linguistics.
Cambridge University Press, 40 West 20th Street, New York, NY
10011-4211, fax 914-937-4712.
Subscriptions: individuals $59, institutions $118. (These prices for
USA, Canada, and Mexico only. Outside these countries write to
Cambridge University Press, The Edinburgh Building, Cambridge CB2 2RU,
UK.) [Note: Subtract 20% pre-publication discount through December 1, 1994.]
Editors: Branimir Boguraev, Roberto Garigliano, and John Tait
Submissions: From North and South America and Oceania, submit to
Branimir Boguraev
submit to Roberto Garigliano
See also Computational Linguistics in the ACL entry.
----------------------------------------------------------------
Subject: [3-2p] Journals (Neural Nets/Connectionism)
CONNECTION SCIENCE
Published 4 times annually. ISSN 0954-0091.
Subscriptions: Individual $82, Institution $184, Institution (UK) 74 pounds
Carfax Publishing Company, PO Box 25, Abingdon, Oxfordshire OX14 3UE, UK.
Submissions: Julie Clarke
Department of Computer Science, Regent Court, University of Sheffield,
S1 4DP, Sheffield, UK.
THE INTERNATIONAL JOURNAL OF NEURAL NETWORKS RESEARCH & APPLICATIONS
Published quarterly. ISSN 0954-9889.
Learned Information Ltd., Woodside, Hinksey Hill, Oxford OX1 5AU, UK.
Tel: +44 (0)865-730275 Fax: +44 (0)085-736354
INTERNATIONAL JOURNAL OF NEURAL SYSTEMS (IJNS)
Published quarterly. ISSN 0129-0657
Information processing in natural and artificial neural systems.
Subscriptions: Individual $42, Institution $88 (plus $9-$17 for postage)
USA: World Scientific Publishing Co., 687 Hartwell Street, Teaneck, NJ
07666, 201-837-8858; Eurpoe: World Scientific Publishing Co. Pte.
Ltd., 73 Lynton Mead, Totteridge, London N20-8DH, England, (01)
4462461; Other: World Scientific Publishing Co. Pte. Ltd., Farrer
Road, P.O. Box 128, Singapore 9128, 2786188.
NEURAL COMPUTING AND APPLICATIONS
Published quarterly. ISSN 0941-0643.
Official journal of the Neural Computing Applications Forum.
Subscriptions: $215. (Free to NCAF members.)
Springer Verlag, Service Center Secaucus, 44 Hartz Way, Secaucus, NJ 07094
Tel: 201-348-4033
Springer-Verlag, Springer House, 8 Alexandra Road, LONDON SW19 7JZ
Tel: ..44/0 81 947 1280 Fax: 0 81 947 1274
Spqringer-Verlag, Heidelberger Platz 3, D-1000 BERLIN, Germany
Tel: (0)30 8207-1
NEURAL COMPUTATION
Published quarterly since 1989. ISSN 0899-7667.
MIT Press Journals, 55 Hayward Street Cambridge, MA 02142-9949, 617-253-2889
Subscriptions: Individual $65 (Student/Retired $40), Institution $166.
Canadians add 7% GST, shipping outside US add $22 postage and handling.
Editor: Terrence Sejnowski.
NEURAL NETWORK WORLD
Published 6 times annually.
Editor-in-Chief: Dr. Mirko Novak
Institute of Computer Science, Czech Academy of Sciences, 18207 Prague,
Pod vodarenskou vezi 2, Czech Republic
Tel: (0042) 82 16 39
Fax: (0042) 85 85 789
Subscriptions: The subscription price for Volume 5 (1995) is DM 360,
including postage and handling charges.
Publisher: The IDG, Czechoslovakia, 160 00 Prague 6, Luzna 2, Czech Republic.
NEURAL NETWORKS
Published 6 times annually. ISSN 0893-6080.
Official journal of the International Neural Network Society.
Subscriptions: $380
Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK.
Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153.
IEEE CONTROL SYSTEMS MAGAZINE
Published bimonthly, since 1985, by the IEEE Control Systems Society.
(Often has articles about NNs and fuzzy systems.)
JOURNAL OF ARTIFICIAL NEURAL SYSTEMS (JANS)
Published quarterly.
Subscriptions: $192/year ($64 for contributors).
The Bellwood Research Center, 17 Briston Private, Ottawa, Ontario,
Canada, K1G 5R5
JOURNAL OF ARTIFICIAL NEURAL NETWORKS
Published quarterly.
Editor: Omid M. Omidvar
Subscriptions: individuals $45, institutions $110.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax 201-767-6717
NEURAL PROCESSING LETTERS
Published bimonthly starting in September 1994.
Emphasis on ideas, developments, and work in progress.
Francois Blayo (France) and Michel Verleysen (Belgium),
+32 2 245 43 63, + 32 2 245 46 94 Fax.
Subscriptions: BEF 4400
D facto publications, 45 rue Masui, B-1210 Brussels, Belgium
phone +32-2-245-43-63, fax +32-2-245-46-94.
URL: http://www.dice.ucl.ac.be/neural-nets/NPL/NPL.html
FTP: ftp.dice.ucl.ac.be:/pub/neural-nets/NPL/
----------------------------------------------------------------
Subject: [3-2q] Journals (Object-oriented Programming)
OBJECT-ORIENTED SYSTEMS
Published 4 times annually. ISSN 0969-9767.
Subscriptions: Institutions US$210/120 pounds EC/130 pounds RoW
Individuals US$93/50 pounds EC/50 pounds RoW
USA/Canada: Journals Promotion Dept., Chapman & Hall, 29 West 35th
Street, New York, NY 20001-2299, USA, 212-244-3336, fax 212-244-3426,
E-mail 71201.1651@compuserve.com.
EC/RoW: Journals Promotions Dept., Chapman & Hall, 2-6 Boundary Row,
London SE1 8HN, UK, +44 (0)71-865-0066, fax +44 (0)71-522-9623, E-mail
journal@chall.mhs.compuserve.com.
JOURNAL OF OBJECT ORIENTED PROGRAMMING
9 issues/year, since 1988.
SIGS Publications Inc., 588 Broadway, Suite 604, New York, NY 10012,
phone 212-274-0640. Order service number: 1-800-783-4903
Subscriptions: $59 individuals, $153 institutions. (Add $40 postage
for foreign orders).
----------------------------------------------------------------
Subject: [3-2r] Journals (Pattern Recognition)
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE
Annual subscription, 1992/3, $340; individual subscription, $138. Add
$34 for airmail. Published 5 times a year by World Scientific
Publishing Co. Pte. Ltd., Farrer Road, PO Box 128, Singapore 9128.
(In the US, write to World Scientific Publishing Co., Inc., River Edge,
NJ 07661; in Europe to World Scientific Publishing Co., Inc., Totteridge,
London N20 8DH, England.)
PATTERN RECOGNITION
Journal of the Pattern Recognition Society. Members receive the
journal free of charge as part of their membership in the Society.
Institutions may subscribe for $845.
Pergamon Press, Ltd., Headington Hill Hall, Oxford OX3 0BW, UK.
Pergamon Press, Inc., 660 White Plains Road, Tarrytown, NY 10591-5153.
PATTERN RECOGNITION LETTERS
Published 12 times annually. ISSN 0167-8655.
Official publication of the International Association for Pattern
Recognition. Subscriptions: $462 Institutions.
Elsevier Science Publishing, 655 Avenue of the Americas, New York, NY
10017, 212-633-3827. Outside the US, contact Elsevier Science
Publishers, Attn: Ursula van Dijk, PO Box 103, 1000 AC Amsterdam, The
Netherlands, or call +31-20-5862-608.
----------------------------------------------------------------
Subject: [3-2s] Journals (Reasoning Under Uncertainty)
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
The treatment of Uncertainty in Artificial Intelligence
Published 8 times a year. ISSN 0888-613X.
Subscriptions: Institutions $282; included with NAFIPS membership
(see NAFIPS entry above).
North-Holland, Elsevier Science Publishing Co., Inc., 655 Avenue of the
Americas, New York, NY 10010
----------------------------------------------------------------
Subject: [3-2t] Journals (Robotics)
AUTONOMOUS ROBOTS
Published twice yearly. ISSN 0929-5593.
Editor: George A. Bekey, Univ. of Southern California.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358, phone 617-871-6600, fax 617-871-6528,
email kluwer@world.std.com.
Subscriptions: individuals $50, institutions $114.
INDUSTRIAL ROBOT
ISSN 0143-991X
Published quarterly. $145/year
MCB University Press Limited, 62 Toller Lane, Bradford, West
Yorkshire, England BD8 9BY, (44) 274-499821, fax (44) 274-547143. In
the US, write to MCB University Press Limited, PO Box 10812,
Birmingham, AL 35201-0812, 1-800-633-4931 (1-205-995-1567), fax
1-205-995-1588.
INTERNATIONAL JOURNAL OF ROBOTICS AND AUTOMATION
Published 4 times annually. ISSN 0826-8185
Subscriptions: $165 US or 313.50 SFr. ($12 US or 22.80 SFr postage and
handling). A special rate is available to members of IASTED.
Write to ACTA Press, PO Box 354, CH-8053, Zurich, Switzerland or ACTA
Press, PO Box 2481, Anaheim, CA 92814.
IASTED is the International Association of Science and Technology for
Development. Individual memberships are $60 US or $120 SFr and
corporate memberships $100 US or $200.00 SFr. Members receive a
complimentary subscription to the journal of their choice; the annual
cost of additional journals for members is $20US/$40SFr per journal.
Write to IASTED, PO Box 25, Station G, Calgary, Alberta, Canada T3A
2G1, or IASTED, PO Box 354, CH-8053, Zurich, Switzerland.
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH
MIT Press, 28 Carleton Street, Cambridge, MA 02142
Subscriptions: individuals $80 (student/retired $50), institution $185.
Canadians add 7% GST, shipping outside US add $22 postage and handling.
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS
Three issues per volume, $58.50 per volume (individual)
Kluwer Academic Publishers Group, PO Box 322, 3300 AH Dordrecht,
The Netherlands. In the US write to Kluwer Academic Publishers, PO Box 358,
Accord Station, Hingham, MA 02018-0358.
ROBOTICS TODAY
Society of Manufacturing Engineers, One SME Drive, PO Box 930,
Dearborn, MI 48121. 313-271-1500
ROBOTICS WORLD
Published quarterly.
Communication Channels, 6255 Barfield Road, Atlanta, GA 30328
404-256-9800
A magazine of flexible automation for the end-user.
They also publish the Robotics World Directory for $49.95
ROBOT (Japanese)
Industrial Robots and Application Systems
Published bimonthly.
Japan Industrial Robot Association (JIRA)
Kikai-Shinko Building, 3-5-8, Shiba-Kohen, Mina To-ku, Tokyo, Japan
Tokyo (03) 3434-2919, fax (03) 3578-1404
ROBOTICA
International Journal of Information, Education and Research
in Robotics and Artificial Intelligence.
Published quarterly, US $179/year.
Cambridge University Press, The Edinburgh Building, Shaftesbury Road,
Cambridge CB2 2RU, UK. In the US write to Cambridge University Press,
Journals Department, 40 West 20th Street, New York, NY 10011-4211.
ROBOTICS AND AUTONOMOUS SYSTEMS
8 issues/year, since 1988.
Subscriptions: Dfl. 766 including postage/handling (surface delivery)
Published by Elsevier Science Publishers, B.V. Journals Department,
P.O. Box 211, 1000 AE Amsterdam, the Netherlands.
ROBOTICS AND C.I.M.
Published quarterly, since 1984.
Pergamon Press, NY
ROBOTICS AGE
Published 1979-1985, now defunct.
Replaced by Robotics Engineering (monthly since 1986).
----------------------------------------------------------------
Subject: [3-2v] Journals (Virtual Reality)
PRESENCE
Subscriptions: $50 individual (student/retired $40), $135 institutions
Canadians add 7% GST, shipping outside US add $14 postage and handling.
MIT Press Journals
55 Hayward Street, Cambridge, MA 02142-1399
617-253-2889, fax 617-258-6779
hiscox@mitvma.mit.edu
----------------------------------------------------------------
Subject: [3-2w] Journals (Vision)
MACHINE VISION AND APPLICATIONS
Published 4 times annually. ISSN 0932-8092.
Subscriptions: Institutions $191 (plus $11 p&h); Individuals $54 (incl p&h).
Springer-Verlag New York Inc., Journal Fulfillment Services, 44 Hartz
Way, Secaucus, NJ 07094, 1-800-SPRINGER.
INTERNATIONAL JOURNAL OF COMPUTER VISION
Published 6 times annually. ISSN 0920-5691.
Subscriptions: Institutions $229; Individuals $115. Add $8 for airmail.
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The
Netherlands, or Kluwer Academic Publishers, PO Box 358, Accord
Station, Hingham, MA 02018-0358.
COMPUTER VISION, GRAPHICS AND IMAGE PROCESSING
Published monthly, 1983-1990, now defunct.
----------------------------------------------------------------
Subject: [3-2x] Miscellaneous (Design, ...)
INTERNATIONAL JOURNAL OF DESIGN SCIENCES AND TECHNOLOGY (DST)
Published twice annually.
DST is a multidisciplinary forum dealing with all facets and fields of
design. It endeavours to provide a framework with which to support
debates on the different economical, historical, pedagogical,
philosophical, scientific and technological issues surrounding design.
Subscriptions: FF 580
Editions HERMES, 14, rue Lantiez, 75017 Paris - France, call (33) (1)
42-29-44-66, or fax (33) (1)-42-29-15-56.
Submissions: Khaldoun Zreik, Journal of Design Sciences and
Technology, Editions HERMES - 14, rue Lantiez - 75017 Paris - France
INTERACTIVE LEARNING ENVIRONMENTS
Editor: Elliot Soloway, Univ. of Michigan.
Topics include computational models of learning, intelligent tutoring
systems, micro-worlds, interface design, student modeling and
cognitive diagnosis, and architectures for interactive learning environments.
Subscriptions: individuals $45, institutions $105.
Ablex Publishing Company, 355 Chestnut Street, Norwood, NJ 07648
201-767-8450, fax 201-767-6717
----------------------------------------------------------------
Subject: [3-3] Newsletters
The Computists' Communique (ISSN 1084-015X) is a weekly online
newsletter for AI/IS/CS scientists. It covers research and funding
news; career, consulting, and entrepreneurial issues; AI-related job
postings and journal calls; FTPable & other resource leads; market
trends; analysis and discussion. The Communique serves members of
Computists International, a professional mutual-aid society.
Membership in Computists International runs $135 for new professional
members, $55 for students and the unemployed. There is a 25% discount
for Canada, Western Europe, the UK, Japan, and Australia; other
countries and territories outside the U.S. get a 50% discount. Free
copies are available on the day of each full moon. For more
information, contact Dr. Kenneth I. Laws (laws@ai.sri.com),
415-493-7390, 4064 Sutherland Drive, Palo Alto, CA 94303.
INTELLIGENT SYSTEMS REPORT
Editor: David Blanchard
ISR is a monthly newsletter featuring news and applications of such
intelligent technologies as expert systems, neural networks, fuzzy logic,
virtual reality, natural language, and speech recognition.
Subscriptions: $299 (US and Canada); $349 (elsewhere).
Lionheart Publishing, 2555 Cumberland Parkway, Suite 299, Atlanta, GA
30339, (404) 431-0867, fax (404) 432-6969
INTELLIGENT SOFTWARE STRATEGIES
Covers expert systems, OOP, case systems, neural networks, and natural
language.
Subscriptions: $425 (add $60 if outside North America)
Editor: Paul Harmon
Cutter Information Corp., 37 Broadway, Arlington, MA 02174-5539
Tel: 800-964-8702 (617-648-8702)
Fax: 800-888-1816 (617-648-1950)
Email: 64107.653@compuserve.com
________________________________________________________
---
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to
[ ask your news administrator to fix the problems with your system. ]
From: cardo@cs.ucla.edu
Subject: Artificial Intelligence FAQ: Bibliography 4/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: Bibliography of AI introductory texts, overviews and references
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part4
Posting-Frequency: monthly
Last-Modified: Fri May 29 14:33:13 PST 1999 by Ric Crabbe
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_4.faq
Size: 77635 bytes, 1997 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Ric Crabbe, Amit Dubey, and Mark Kantrowitz
;;; ai_4.faq
This part of the AI FAQ provides a bibliography of good introductory
texts, overviews of AI and specific subfields of AI, and some
important papers in those subfields. If you feel that there is a
reference or set of references which should be added to this FAQ, or
references which should be removed, please send email to
cardo@cs.ucla.edu. When suggesting references to be included in a
particular subfield, only suggest the best two or three references (or
a particularly well-written overview). It is NOT the intention of this
listing to be a comprehensive AI bibliography.
Books suggested by their authors must present a strongly argued case.
Part 4 (Bibliography):
Bibliography of introductory texts, overviews and references
Addresses and phone numbers for major AI publishers
Outline:
[4-0] AI in general (Introductions, Overviews)
[4-1] Search and Game Playing
[4-2] Knowledge Representation
[4-3] Logic
[4-4] Planning
[4-5] Natural Language Processing (NLP)
[4-6] Speech Recognition and Synthesis
[4-7] Connectionism and Neural Nets
[4-8] Machine Learning
[4-9] Case-Based Reasoning
[4-10] Genetic Algorithms
[4-11] Production Systems, Expert Systems and Match Algorithms
[4-12] Integrated AI Architectures
[4-13] Fuzzy Logic
[4-14] Artificial Life and Cellular Automata
[4-15] Qualitative Physics and Model Based Reasoning
[4-16] Task-specific Architectures for Problem Solving
[4-17] Automated Deduction/Theorem Proving
[4-18] Probabilistic Reasoning
[4-19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS)
[4-20] Robotics and Computer Vision
[4-21] Animats and Autonomous Agents
[4-22] Distributed AI
[4-23] User/Agent Modeling
[4-24] Philosophy of AI
[4-25] Cyc
[4-25] Miscellaneous: PhD Theses
[4-26] Constraint-based Scheduling
[4-27] Music and AI
[4-28] AI and Education
[4-29] Blackboard Architectures
[4-30] Temporal Reasoning and Modal Logic
[4-31] Data Mining
[4-32] AI book publication announcements mailing list
[4-33] Who are the major AI publishers?
[4-34] How do I get a copy of the proceedings to conference
[4-35] How do I get a copy of
[4-36] How do I get Tech Report X?
[4-37] Videotapes and Magazines
Search for [#] to get to question number # quickly.
----------------------------------------------------------------
Subject: [4-0] AI in general (Introductions, Overviews)
The lack of a review or the presence of a short review should not be
interpreted as indicating anything about the quality of the text.
Introductory texts:
Thomas L. Dean, James Allen, John Aloimonons, "Artificial
Intelligence: Theory and Practice", Benjamin/Cummings, 1994. 680
pages, ISBN 0-8053-25476. [Lisp/Scheme/C++ code is available from
http://yoda.cis.temple.edu:8080/books/dean]
Matthew L. Ginsberg, "Essentials of AI", Morgan Kaufmann
Publishers, 1993, ISBN 1-55860-221-6, 430 pages, $49.95.
[Topics include search, knowledge representation, logic,
assumption-based truth maintenance, nonmonotonic reasoning,
probability, frames, semantic nets, planning, learning, vision,
natural language processing, and expert systems.]
George Luger and William Stubblefield, "Artificial Intelligence:
Structures and Strategies for Complex Problem Solving", 2nd
Edition, The Benjamin/Cummings Publishing Company, Inc., 1993.
720 pages, ISBN 0-8053-4780-1.
[Includes algorithms implemented in Lisp and Prolog.]
Ian Pratt, "Artificial Intelligence", Macmillan, London, 1994. 280
pages, ISBN 0-333-59755-9 ($35). [In-depth introduction to several
AI topics, using inference as a central theme. As a result, omits
topics like NLP, expert systems, vision, and robotics. Hence this
book is a good themed introduction to a subset of AI, but is not
suitable for a general purpose overview of AI. Curiously, the book
does include a chapter on neural networks which doesn't fit into
the theme, in addition to chapters on planning, search, and other
topics related to logic and reasoning.
The presentation is superb, doing an excellent job of conveying the
essential insights behind the concepts, followed by the technical
details and pseudocode for the algorithms. Very good use of diagrams
to explain difficult concepts. Heavily dependent on predicate
calculus, with a tutorial introduction in the appendix. Suitable
for an advanced undergraduate/introductory masters-level course. A
longer version of this review is available as
ftp.cs.cmu.edu:/user/ai/pubs/books/reviews/pratt.txt]
Elaine Rich & Kevin Knight, "Artificial Intelligence", 2nd edition,
McGraw-Hill, New York, 1991. ISBN 0-07-052263-4. [One of the more
popular introductory texts to AI, giving a very good general
overview of most AI topics. In some places the book sacrifices
depth for breadth, and a few more recent topics are neglected.
Nevertheless this book provides an excellent foundation in areas
central to AI. Source code is available from
ftp.cs.cmu.edu:/user/ai/areas/bookcode/knight/.]
Stuart Russell and Peter Norvig, "Artificial Intelligence: A Modern
Approach", Prentice Hall, 1994. 840 pages, $57.95.
[Uses intelligent agents as a unifying theme.]
Patrick Henry Winston, "Artificial Intelligence", Third Edition,
Addison Wesley, Reading, MA, 1992, ISBN 0-201-53377-4.
[A classic early AI text. This text is very much hands-on, with
actual toy examples. Source code is in ftp.ai.mit.edu:/pub/ai3/.]
Overviews and References:
Avron Barr and Edward A. Feigenbaum, "The Handbook of Artificial
Intelligence", volumes 1-4, Addison-Wesley, Reading, MA, 1986.
Alan Bundy, editor, "Catalogue of Artificial Intelligence
Techniques", 3rd Edition, Springer Verlag, 1990, ISBN 0-387-52959-4,
179 pages, $29.50.
Stan Gibilisco, editor, "The McGraw-Hill Illustrated Encyclopedia of
Robotics and Artificial Intelligence", Tab Books, Blue Ridge Summit,
PA, 1994. 512 pages, ISBN 0-07-023613-5 hardcover ($40), ISBN
0-07-023614-3 paper ($25). [This entry tentative -- I haven't seen a
copy of the book yet.]
Raymond Kurzweil's "The Age of Intelligent Machines", MIT Press,
1990, 565 pages, ISBN 0-262-11121-7, $39.95. [General Introduction]
Minsky, Marvin, "The Society of Mind", Simon and Schuster, New
York, 1988. 339 pages, ISBN 0-67-160740-5 ($21.95).
Shapiro, Stuart C. (ed), "Encyclopedia of Artificial Intelligence",
2nd Edition, John Wiley & Sons, New York, 1992. (1st ed, 1987)
Sundermeyer, K., "Knowledge-Based Systems: Terminology and References",
Wissenschaftverlag, 1991. ISBN 3-411-14941-8
Bonnie Lynn Webber and Nils J. Nilsson, "Readings in Artificial
Intelligence", Morgan Kaufmann, San Mateo, CA, 1981.
Glossaries and Dictionaries:
Colin Beardon "Artificial Intelligence Terminology: a reference guide"
John Wiley & Sons, NY, 1989, 283 pages. ISBN 0-7458-0718-6
Dennis Mercadal, "Dictionary of Artificial Intelligence", Van
Nostrand Reinhold, 1994. ISBN 0-442-00451-6, $36.95.
Online Dictionary of Computing
http://wombat.doc.ic.ac.uk/
Contains a glossary of computer science terminology with
cross-references and links to related Internet resources.
P610.8, "Draft Standard Glossary of Artificial Intelligence Terminology"
referenced in "IEEE Std 610.12-1990, IEEE Standard Glossary of
Software Technology, December 1990".
Jerry M. Rosenberg, "Dictionary of Artificial Intelligence and
Robotics", Wiley, New York, 1986, 203 pages.
Raoul N. Smith, editor, "The Facts on File Dictionary of Artificial
Intelligence", Facts on File, New York, 1989, 211 pages.
ISBN 0-8160-1593-3.
Ellen Thro, "The Artificial Intelligence Dictionary", Microtrend Books,
San Marcos, CA, 1991, 407 pages, ISBN 0-915391-36-8.
Surveys:
Howard E. Shrobe, editor, "Exploring Artificial Intelligence",
Morgan Kaufmann Publishers, San Mateo, CA, 1988.
(Survey talks from the AAAI 1986 and 1987 conferences.)
Applied AI:
Hugh Cartwright
Intelligence in Chemistry" Oxford University Press, 1994. 92 pages,
ISBN 0-19-855736-1.
[An inexpensive text that is aimed at undergraduate and graduate
students in engineering, physical and life sciences who have little or
no prior knowledge of AI. It provides an overview of the use and
potential of AI methods in the sciences.]
AI for C People:
Herbert Schildt, "Artificial Intelligence Using C", McGraw-Hill,
1987. 412 pages. ISBN 0-07-881255-0.
Herbert Schildt, "Artificial Intelligence Using C++", McGraw-Hill.
----------------------------------------------------------------
Subject: [4-1] Search and Game Playing
Hermann Kaindl, "Minimaxing: Theory and Practice", AI Magazine,
9(3):69-76, Fall 1988.
L. Kanal and V. Kumar, "Search in Artificial Intelligence",
Springer-Verlag, 1988.
Kirkpatrick, S. Gelatt, CD, and Vecchi, MP, "Optimization by Simulated
Annealing", Science 220(4589):671-680, 1983.
R. Korf, "Search: A survey of recent results" in Shrobe's Exploring
Artificial Intelligence, pages 197-237, August 1990.
Pearl, J. and Korf, R. E., "Search techniques", Annual Review of
Computer Science, volume 2, J.F. Traub, B.J. Grosz, B.W. Lampson and
N.J. Nilsson, editors, pages 451-467, Annual Reviews Inc., Palo
Alto, CA, 1987.
Pearl, J., "Heuristics: Intelligent Search Strategies for Computer
Problem Solving", Addison-Wesley, 1984.
Chris Thornton & Benedict du Boulay, "Artificial Intelligence
Through Search" Kluwer Academic (Paperback version Intellect Books),
Dordrecht Netherlands & Norwell, MA USA (Intellect at Oxford), 1992
Game Playing:
Richard Bartle, "Artificial Intelligence and Computer Games",
Century Communications Ltd., UK, 1985. ISBN 0-7126-0661-0.
Elwyn R. Berlekamp, John H. Conway and Richard K. Guy, "Winning Ways,
for Your Mathematical Plays", Academic Press, New York, 1982. Volume
1: Games in General (ISBN 0-12-091101-9). Volume 2: Games in
Particular (ISBN 01-12-091102-7).
Richard E. Korf, "Learning to solve problems by searching for
macro-operators", Pitman, Boston, 1985. 147 pages, ISBN 0-273-08690-1.
[Solution to Rubik's Cube, among other problems. This book is a
revision of Korf's PhD thesis at CMU.]
David Levy, "Computer Gamesmanship: Elements of Intelligent Game
Design", Simon & Schuster, ISBN 0-671-49532-1.
David Levy, editor, "Computer Chess Compendium", Springer-Verlag,
1989. 440 pages, ISBN 0-387-91331-9 ($48).
Richard Bartle, "Artificial Intelligence and Computer Games",
Century Communications Ltd., UK, 1985. ISBN 0-7126-0661-0.
----------------------------------------------------------------
Subject: [4-2] Knowledge Representation
[Several papers in "Readings in Artificial Intelligence" are relevant,
including S. Amarel "On Representations of Problems on Reasoning about
Actions" and P.J. Hayes "The Frame Problem and Related Problems in AI".]
Overviews/Surveys:
Ronald J. Brachman, "The Future of Knowledge Representation", in
Proceedings of the Eighth National Conference on Artificial
Intelligence, 1990.
Hector J. Levesque, "Knowledge Representation and Reasoning",
Annual Review of Computer Science 1:255-287, 1986.
General Papers:
Ronald J. Brachman, " ``I lied about the trees'', or, defaults and
definitions in knowledge representation", AI Magazine 6(3):80-93, 1985.
Brachman, Ronald J. and Levesque, Hector J., editors,
"Readings in Knowledge Representation", Morgan Kaufmann
Publishers, 1985.
Brachman, Ronald J., Levesque, Hector J. and Reiter, Ray, editors,
Special Volume on Knowledge Representation, Artificial Intelligence
49(1-3), January, 1991.
Ronald J. Brachman and James G. Schmolze, "An overview of the
KL-ONE knowledge representation system", Cognitive Science,
9:171-216, 1985.
Nick Cercone and Gordon McCalla, editors, "The Knowledge Frontier:
Essays in the Representation of Knowledge", Springer-Verlag, New York,
1987. 512 pages, $40.00, ISBN 0-38796-557-2. (This is the much
revised version of a special issue of COMPUTER on KR.)
Allen Newell, "The Knowledge Level", Artificial Intelligence,
18:87-127, 1982.
Allen Newell and Herb Simon, "Computer Science as Empirical
Enquiry: Symbols and Search", Communications of the ACM,
19(3):113-126, 1976.
Bernhard Nebel and Gert Smolka, "Attributive Description Formalisms
... and the Rest of the World", in Otthein Herzog and Claus-Rainer
Rollinger, editors, Text Understanding in LILOG, Springer Verlag,
Lecture Notes in Artificial Intelligence #546, pages 439-452, 1991.
[Theoretical results in the area of description logics.]
Semantic Networks:
Fritz Lehmann, Editor, "Semantic Networks in Artificial Intelligence",
Pergamon Press, Oxford, 1992. (Appeared as a double special issue
of Computers and Mathematics with Applications 23(2-9), 1992.)
James G. Schmolze and William A. Woods, "The KL-ONE Family", in
F. Lehmann, editor, Semantic Networks in Artificial Intelligence,
Pergamon Press, 1992. [History of description logics (KL-ONE style
systems).]
John Sowa, Editor, "Principles of Semantic Networks", Morgan Kaufmann,
San Mateo, CA, 1991.
W.A. Woods, "What's in a link: Foundations for semantic networks", In
D.G. Bobrow & A. Collins (Eds.), "Representation and Understanding",
Academic Press, New York, 1975. Reprinted in "Readings in Cognitive
Science", Collins & Smith (eds.), section 2.2.
----------------------------------------------------------------
Subject: [4-3] Logic
Logic in AI:
M.R. Genesereth and N.J. Nilsson, "Logical Foundations of Artificial
Intelligence", Morgan Kaufmann Publishers, Los Altos, CA, 1987.
D. Poole, A. Mackworth and R. Goebel, "Computational Intelligence: A
Logical Approach", Oxford University Press, 1998, 576 pages,
ISBN 0-19-510270-3. [Prolog code and other resources are available from
http://www.cs.ubc.ca/spider/poole/ci.html]
Constraint Logic Programming:
Pascal Van Hentenryck, "Constraint Satisfaction in Logic Programming",
MIT Press, Cambridge, MA, 1989, ISBN 0-262-08181-4.
----------------------------------------------------------------
Subject: [4-4] Planning
Intros, Overviews, Paper Collections:
James Allen, James Hendler and Austin Tate, editors,
"Readings in Planning", Morgan-Kaufmann Publishers, 1990. 754 pages,
ISBN 1-55860-130-9 paper ($49.95).
Georgeff, M. P., "Planning," in Annual Review of Computer Science,
Annual Reviews Inc., pages 359-400, 1987.
James Hendler, Austin Tate and Mark Drummond, "AI Planning:
Systems and Techniques", AI Magazine, May, 1990. (Review article.)
Drew McDermott, "Robot Planning", AI Magazine 13(2):55-79, Summer 1992.
William R. Swartout, "DARPA Workshop on Planning", AI Magazine,
9(2):115-131, Summer, 1988. (Survey of current work and issues in
planning.)
[See also Waldinger's "Achieving several goals simultaneously", in
"Readings in Artificial Intelligence".]
STRIPS:
Fikes, R.E. and Nilsson, N.J., "STRIPS: A new approach to the
application of theorem proving to problem solving", Artificial
Intelligence 2:189-208, 1971.
ABSTRIPS:
Sacerdoti, E. D., "Planning in a Hierarchy of Abstraction Spaces,"
Artificial Intelligence, 5:115-135, 1974.
Conjunctive Goals:
Chapman, D., "Planning for Conjunctive Goals", Artificial Intelligence
32:333-377, 1987.
NOAH:
Sacerdoti, E., "A Structure for Plans and Behavior", Artificial
Intelligence, pages 1-65, American Elsevier, New York, 1977.
Sacerdoti, E. D., "The Nonlinear Nature of Plans," Proc. of the Fourth
Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1975, 206-214.
Reactive Planning:
Agre P.E. and Chapman, D., "Pengi: An Implementation of a Theory of
Activity", in Proceedings of the Sixth National Conference on
Artificial Intelligence, Seattle, WA, July 1987.
Georgeoff, M.P. and Lansky, A.L., "Reactive Reasoning and
Planning", in Proceedings of the Sixth National Conference on
Artificial Intelligence, Seattle, WA, pages 677-682, July 1987.
Simmons, R.G., "A theory of debugging plans and interpretations", in
Proceedings of the Seventh National Conference on Artificial
Intelligence (AAAI-88), Morgan Kaufmann Publishers, Palo Alto,
CA, pages 94-99, 1988.
Case-based Planning:
Hammond, K., "Case-based Planning: Viewing Planning as a Memory Task",
Academic Press, Cambridge, MA, 1989.
Miscellaneous:
R.S. Aylett and A.N. Fish and S.R. Bartrum, "Task planning in an
uncertain world", International Conference on Control 2:801-806, 1991.
Thomas Dean and R. James Firby and David Miller, "Hierarchical
Planning Involving Deadlines, Travel Time, and Resources", Computing
Intelligence 4:381-398, 1988.
Thomas Dean and Michael Wellman, "Planning and Control", Morgan
Kaufmann Publishers, 1991, 486 pages, ISBN 1-55860-209-7, $49.95.
Stefik, M.J., "Planning with Constraints", Artificial Intelligence
15:111-140 and 16:141-170, 1981.
R. Wilensky, "Meta-Planning: Representing and Using Knowledge About
Planning in Problem Solving and Natural Language Understanding",
Cognitive Science 5:197-233, 1981. Reprinted in Readings in Cognitive
Science, Collins & Smith (eds.), section 5.6.
Wilkins, D.E., "Domain-Independent Planning: Representation and Plan
Generation", Artificial Intelligence 22:269-301, 1984.
----------------------------------------------------------------
Subject: [4-5] Natural Language Processing (NLP)
General:
Allen, James F., "Natural Language Understanding", 2nd edition, The
Benjamin/Cummings Publishing Company, Menlo Park, California,
(Addison-Wesley Publishing Company, Reading, Massachusetts), 1995.
625 pages, ISBN 0-8053-0335-9. Code for the book is available from
bc.aw.com:/bc/allen/
ftp.cs.rochester.edu:/pub/u/james/NLcode/
ftp.cs.cmu.edu:/user/ai/areas/nlp/bookcode/allen/
Robert C. Berwick, "Computational Linguistics", MIT Press,
Cambridge, MA, 1989, ISBN 0262-02266-4.
Brady, Michael, and Berwick, Robert C., "Computational Models
of Discourse", MIT Press, Cambridge, MA, 1983.
Michael A. Covington, "Natural Language Processing for Prolog
Programmers", Prentice-Hall, Englewood Cliffs, NJ, 1994. ISBN
0-13-629213-5.
Gazdar, G. and Mellish, C., "Natural Language Processing in Lisp:
An Introduction to Computational Linguistics", Addison-Wesley,
Reading, Massachusetts, 1989. (There are three different editions
of the book, one for Lisp, one for Prolog, and one for Pop-11.)
Grosz, Barbara J., Sparck-Jones, Karen, and Webber, Bonnie L.,
"Readings in Natural Language Processing", Morgan Kaufmann
Publishers, Los Altos, CA, 1986, 664 pages. ISBN 0-934613-11-7, $44.95.
Klaus K. Obermeier, "Natural Language Processing Technologies
in Artificial Intelligence: The Science and Industry Perspective",
John Wiley & Sons, New York, 1989.
Fernando C.N. Pereira and Barbara Grosz, "Natural Language
Processing", MIT Press, Cambridge, MA, 1994. 531 pages, ISBN
0-262-66092-X ($35).
Schank, R. and Abelson, R. "Scripts, Plans, Goals, and Understanding,"
Lawrence Erlbaum Associates, Hillsdale, New Jersey, 1977.
Terry Winograd, "Language as a Cognitive Process", Addison-Wesley,
Reading, MA, 1983.
Terminology:
David Crystal, "A Dictionary of Linguistics and Phonetics", 3rd Edition,
Basil Blackwell Publishers, New York, 1991.
Parsing:
Dick Grune and Ceriel J.H. Jacobs, "Parsing Techniques -- A Practical
Guide", Ellis Horwood, Chichester, England, 1990.
320 pages, ISBN 0-13-651431-6. [Covers most parsing algorithms and
includes an extensive annotated bibliography.]
For more information, see http://www.cs.vu.nl/~dick/PTAPG.html or
ftp://ftp.cs.vu.nl/pub/dick/PTAPG/
Marcus, M. "A Theory of Syntactic Recognition for Natural Language,"
The MIT Press, Cambridge, MA, 1980.
Pereira, F. and Sheiber, S. "Prolog and Natural-Language Analysis,"
Center for the Study of Language and Information, 1987.
Tomita, M. (Editor), "Current Issues in Parsing Technology",
Kluwer Academic Publishers, Norwell, MA, 1991.
Tomita, M., "An Efficient Context-Free Parsing Algorithm",
Computational Linguistics 13:31-46, 1987.
Statistical Parsing and Modeling:
Peter F. Brown and Stephen A. DellaPietra and Vincent
J. DellaPietra and Jennifer C. Lai and Robert L. Mercer, "An
Estimate of an Upper Bound for the Entropy of English",
Computational Linguistics, 18:1 pp31-40, 1992.
Eugene Charniak, "Statistical Language Learning", MIT Press, 1993.
[Easy-to-read text, if a bit dated.]
Eugene Charniak, "Statistical Parsing with a Context-Free Grammar
and Word Statistics", AAAI, 1997.
Stanley F. Chen and Joshua T. Goodman, "An Empirical Study of
Smoothing Techniques for Language Modeling", Proceedings of the
34th Annual Meeting of the ACL, 1996.
Michael Collins, "Three Generative, Lexicalised Models for
Statistical Parsing", Proceedings of the 35th Annual Meeting of the
ACL, 1997.
F. Jelinek and J. D. Lafferty and R. L. Mercer, "Basic Methods of
Probabilistic Context-Free Grammars", Computational Linguistics, 1992/
K. Lari and S.J. Young, "Applications of Stochastic Context-Free
Grammars using the Inside-Outside Algorithm", Computer Speech and
Language 5:237-257, 1991.
David Magerman, "Natural Language Parsing as Statistical Pattern
Recognition", PhD thesis, Stanford University, 1994.
M. Marcus and B. Santorini and M. Marcinkiewicz, "Building a Large
Annontated Corpus of English: the Penn Treebank", Computational
Linguistics, 19:2, 1993
Fernando Pereira and Naftali Tishby and Lillian Lee,
"Distributional Clustering of English Words", Proceedings of the
31st Annual Meeting of the ACL, 1993.
Wright, J., "LR Parsing of Probabilistic Grammars with Input
Uncertainty for Speech Recognition", Computer Speech and Language
4:297-323, 1990.
Zhi Biao Wu, Loke Soo Hsu, and Chew Lim Tan, "A Survey of Statistical
Approaches to Natural Language Processing", Technical report TRA4/92,
Department of Information Systems and Computer Science, National
University of Singapore, 1992
Natural Language Understanding:
Bertram C. Bruce, "Case systems for natural language", Artificial
Intelligence 6:327-360, 1975.
E. Charniak, "Passing Markers: A Theory of Contextual Influence in
Language Comprehension", Cognitive Science, 7:171-190, 1983.
Cohen, P. R., Morgan, J. and Pollack, M., editors, "Intentions in
Communication", MIT Press, Cambridge, MA, 1990.
Dyer, M. "In-Depth Understanding: A Computer Model of Integrated
Processing for Narrative Comprehension," MIT Press, Cambridge, MA, 1983.
Grosz, Barbara J. and Sidner, Candace L., "Attention, Intention, and
the Structure of Discourse", Computational Linguistics 12(3):175-204, 1986.
Aravind Joshi, Bonnie Webber and Ivan Sag, "Elements of Discourse
Understanding", Cambridge University Press, New York, 1981.
Yorick Wilks, "A Preferential, Pattern-Seeking, Semantics For
Natural Language Inference", Artificial Intelligence, 6:53-74, 1975.
Natural Language Interfaces:
Raymond C. Perrault and Barbara J. Grosz, "Natural Language
Interfaces", Annual Review of Computer Science, volume 1, J.F. Traub,
editor, pages 435-452, Annual Reviews Inc., Palo Alto, CA, 1986.
Natural Language Generation:
McKeown, Kathleen R. and Swartout, William R., "Language
Generation and Explanation", in Zock, M. and Sabah, G.,
editors, Advances in Natural Language Generation, Volume 1, Pages
1-51, Ablex Publishing Company, Norwood, NJ, 1988. (Overview of
the state of the art in natural language generation.)
There are several books published as a result of the international
workshops on natural language generation.
Machine Translation:
Bonnie J. Dorr, "Machine Translation: A View from the Lexicon" MIT
Press, Cambridge, MA 1993. 408 pages, ISBN 0-262-04138-3 ($45).
Kenneth Goodman and Sergei Nirenburg., editors, "The KBMT Project: A
Case Study in Knowledge-Based Machine Translation", Morgan Kaufmann
Publishers, San Mateo, CA, 1991. 331 pages, ISBN 1-558-60129-5, $34.95.
W. John Hutchins and Harold L. Somers, "An Introduction to Machine
Translation", Academic Press, San Diego, 1992. 362 pages, ISBN
0-123-62830-X.
A review of MT systems on the market appeared in BYTE 18(1), January 1993.
(can anyone give me a proper citation for this?)
Linguistics:
Vivian J. Cook, "Chomsky's Universal Grammar: An Introduction", Basil
Blackwell Publisher, New York, 1988, 201 pages.
Victoria Fromkin and Robert Rodman, "An Introduction to Language",
Holt, Rinehart, and Winston, New York, 4th edition, 1988, 474 pages.
Ralph Grishman, "Computational Linguistics: An Introduction",
Cambridge University Press, New York, 1986, 193 pages. [Mainly parsing.]
Liliane M.V. Haegeman, "Introduction to Government and Binding
Theory", Basil Blackwell Publishers, Oxford, 1991, 618 pages.
Michael A. K. Halliday, "An Introduction to Functional Grammar",
Edward Arnold, London, 1985.
Geoffrey C. Horrocks, "Generative Grammar", Longman, London, 1987,
339 pages.
Andrew Radford, "Transformational Grammar: A First Course", Cambridge
University Press, New York, 1988, 625 pages.
----------------------------------------------------------------
Subject: [4-6] Speech Recognition and Synthesis
Speech Recognition and Synthesis:
John Allen, Sharon Hunnicut and Dennis H. Klatt, "From Text to Speech:
The MITalk System", Cambridge University Press, 1987. [Synthesis,
precursor of DECtalk.]
Frank Fallside and William A. Woods (editors), "Computer Speech Processing"
Prentice Hall, Englewood Cliffs, NJ, 1985.
X. D. Huang, Y. Ariki and M. A. Jack, "Hidden Markov Models for Speech
Recognition", Edinburgh University Press, 1990. [Analysis]
A. Nejat Ince (editor), "Digital Speech Processing: Speech Coding,
Synthesis, and Recognition", Kluwer Academic Publishers, Boston,
1992. [Analysis and Synthesis]
Dennis H. Klatt, "Review of Text-To-Speech Conversion for English",
Journal of the Acoustic Society of America (JASA), 82(3):737-793,
September 1987. [Synthesis. Seminal article; biased toward formant
synthesis.]
Kai-Fu Lee, "Automatic Speech Recognition: The Development of the
SPHINX System", Kluwer Academic Publishers, Boston, MA, 1989. [Analysis]
S. E. Levinson, L. R. Rabiner and M. M. Sondhi, "An Introduction to the
Application of the Theory of Probabilistic Functions of a Markov Process
to Automatic Speech Recognition" in Bell Syst. Tech. Journal
62(4):1035-1074, April 1983. [Analysis]
R. P. Lippmann, "Review of Neural Networks for Speech Recognition",
Neural Computation, 1(1):1-38, 1989. [Analysis]
Martin, P., et. al., SpeechActs: A Spoken Language Framework. IEEE
Computer, 29(7), 1996.
Douglas O'Shaughnessy, "Speech Communication: Human and Machine"
Addison-Wesley, MA, 1987. [Analysis and Synthesis]
Lawrence R. Rabiner and Ronald W. Schafer, "Digital Processing of
Speech Signals", Prentice Hall, Englewood Cliffs, NJ, 1978.
[Analysis and Synthesis]
Lawrence R. Rabiner and Biing-Hwang Juang, "Fundamentals of Speech
Recognition", Prentice Hall, Englewood Cliffs, NJ, 1993.
ISBN 0-13-015157-2. [Analysis]
Ronald W. Schafer and John D. Markel (editors), "Speech Analysis",
IEEE Press, New York, 1979. [Analysis]
Alex Waibel and Kai-Fu Lee (editors), "Readings in Speech Recognition"
Morgan Kaufmann Publishers, San Mateo, CA, 1990, 680 pages.
ISBN 1-55860-124-4, $49.95. [Analysis]
Alex Waibel, "Prosody and Speech Recognition", Morgan Kaufmann
Publishers, San Mateo, CA, 1988. [Analysis]
Speaker Recognition:
B. S. Atal, "Automatic recognition of speakers from their voices",
Proc. IEEE, 64:460-475, April 1976.
G.R. Doddington, "Speaker recognition -- identifying people by their
voices", Proc. IEEE, 73:1651-1664, March 1985.
A. E. Rosenberg, "Automatic speaker verification: A review",
Proc. IEEE, 64:475-487, April 1976.
A.E. Rosenberg and F.K. Soong, "Recent research in automatic speaker
recognition," in S. Furui and M. Sondhi, editors, Advances in Speech
Sigmal Processing, 1991.
----------------------------------------------------------------
Subject: [4-7] Connectionism and Neural Nets
See the comp.ai.neual-nets faq at:
ftp://ftp.sas.com/pub/neural/FAQ.html
It is more up to date and more complete.
Introductions and Overviews:
Andy Clark, "Associative Engines: Connectionism, Concepts, and
Representational Change", MIT Press, Cambridge, MA 1993. 252 pages,
ISBN 0-262-03210-4.
Judith Dayhoff, "Neural Network Architectures: An Introduction", Van
Nostrand Reinhold, New York, 1990, 259 pages, ISBN 0-442-20744-1.
Scott Fahlman and Geoffrey Hinton, "Connectionist Architectures for
Artificial Intelligence", IEEE Computer 20(1):100-109, January 1987.
Fausett, L. V., "Fundamentals of Neural Networks: Architectures,
Algorithms, and Applications", Prentice Hall, Englewood Cliffs, NJ, 1994.
ISBN 0-13-334186-0.
Freeman, James A., and Skapura, David M., "Neural Networks:
Algorithms, Applications and Programming Techniques", Addison Wesley,
Reading, MA, 1991. 401 pages, ISBN 0-201-51376-5.
Simon S. Haykin, "Neural Networks: A Comprehensive Foundation",
Macmillan, New York, 1994. 696 pages, ISBN 0-02352-761-7.
Hecht-Nielsen, Robert, "Neurocomputing", Addison-Wesley, 1990, 433 pages.
ISBN 0-201-09355-3.
John Hertz, Anders Krogh, and Richard G. Palmer, "Introduction to
the Theory of Neural Computation", Addison-Wesley, 1991. 327 pages,
ISBN 0-201-51560-1. [Heavy on the math.]
Geoffrey E. Hinton, "Connectionist Learning Procedures",
Artificial Intelligence 40(1-3):185-234, 1989. Reprinted in
J. Carbonell, editor, "Machine Learning: Paradigms and Methods",
MIT Press, 1990. Also appears as Technical Report CMU-CS-87-115
(version 2), Carnegie Mellon University, Pittsburgh, PA, December 1987.
Kevin Knight, "A gentle introduction to subsymbolic
computation: Connectionism for the AI researcher". Technical Report
CMU-CS-89-150, Carnegie Mellon University, School of Computer Science,
Pittsburgh, PA, May 30, 1989.
Murray Smith, "Neural Networks For Statistical Modeling", Van
Nostrand Reinhold, 1993. ISBN 0-442-01310-8 ($40). [Good explanations of
backpropagation.]
Wasserman, Phillip D., "Neural Computing: Theory and Practice",
Van Nostrand Reinhold, New York, 1989. 230 pages, ISBN 0-442-20743-3.
Rumelhart, D.E, and McClelland, J.L., editors, "Parallel Distributed
Processing: Explorations in the Microstructure of Cognition" (Vol. 1:
Foundations; Vol. 2: Psychological and Biological Models), Cambridge,
MA: MIT Press, 1986. (See also McClelland, J.L. and D.E. Rumelhart,
"Explorations in Parallel Distributed Processing, A Handbook of Models,
Programs, and Exercises", MIT Press, Cambridge, 1988, 344 pages, for
a companion volume with some code.]
Connectionist Language Processing:
See the special issue of _Connection Science_, Volume 2 Numbers 1-2, 1990.
Also the Hinton collection "Connectionist Symbol Processing", above.
Ronan G. Reilly and Noel E. Sharkey, editors, "Connectionist
approaches to natural language processing", Lawrence Erlbaum
Associates, 1992. 472 pages, ISBN 0-863-77179-3. [Paper collection.]
Connectionist Cognitive Science:
Barnden, J.A., and Pollack, J.B., "Advances in Connectionist and Neural
Computation Theory Vol. 1: High-Level Connectionist Models", Ablex, 1991.
McCloskey, M., "Networks and theories: The place of connectionism in
cognitive science", Psychological Science 2:387-395, 1991.
Quinlan, P., "Connectionism and Psychology: A Psychological Perspective on
New Connectionist Research", University of Chicago Press, 1991.
Waltz, D., and Feldman, J.A., editors, "Connectionist Models and their
Implications: Readings from _Cognitive Science_", Ablex, 1988.
Philosophical Foundations:
Clark, A., "Microcognition: Philosophy, Cognitive Science, and Parallel
Distributed Processing", MIT Press, 1989.
Pinker, S., and Mehler, J, editors, "Connections and Symbols", MIT Press,
1988. [Was Cognition special issue Volume 28, 1988]
----------------------------------------------------------------
Subject: [4-8] Machine Learning
General:
Tom Mitchell, "Machine Learning", McGraw Hill, 1997.
Christopher Bishop, "Neural Networks for Pattern Recognition", Oxford
University Press, 1996. ISBN 0-19-853849-9 Hardback, ISBN 0-19-853864-2
Paperback.
J. G. Carbonell, editor, "Machine Learning: Paradigms and Methods", MIT
Press, Cambridge, MA 1990.
Alan Hutchinson, "Algorithmic Learning", Oxford University Press,
Oxford, England, 1994. 434 pages, ISBN 0-19-853848-0 paper (27.50
Sterling), ISBN 0-19-853766-2 hardcover (55.00 Sterling). Corrections and
additions are available by anonymous ftp from
dcs.kcl.ac.uk:/ftp/pub/alg-learn/ [137.73.8.10]
Tom Mitchell, Jaime G. Carbonell, and Ryszard S. Michalski,
"Machine Learning: A guide to current research", Kluwer Academic
Publishers, Boston, 1986. [A bit out of date.]
Jude W. Shavlik and Thomas D. Dietterich, editors, "Readings in
Machine Learning", Morgan Kaufmann Publishers, 1990, 853 pages.
ISBN 1-55860-143-0, $49.95.
Decision Trees:
Quinlan, J. Ross, "Induction of Decision Trees", Machine Learning
1(1):81-106, 1986.
Quinlan, J. Ross, "C4.5: Programs for Machine Learning", Morgan Kaufmann
Publishers, 1992. ISBN 1-55860-238-0. $44.95 US, $49.45 International.
For a slight additional charge ($25), the book comes with software (ISBN
1-55860-240-2). For software only, (ISBN 1-55860-239-9) $34.95 US,
$38.45 International.
Probabilistic Clustering:
Fisher, D.H., "Knowledge Acquisition Via Incremental Conceptual
Clustering", Machine Learning 2:139-172, 1987. (Probabilistic
clustering methods.)
Clancey, W.J., "Classification Problem Solving", Proceedings of the
National Conference on Artificial Intelligence, 49-55, Los Altos, CA,
Morgan Kaufmann. 1984.
Version Spaces:
Tom M. Mitchell, "Generalization as Search", Artificial Intelligence
18:203-226, 1982.
Machine Discovery:
Langley, P., and Zytkow, J. M., "Data-driven approaches to empirical
discovery", Artificial Intelligence 40:283-312, 1989.
Langley, P., Simon, H.A., Bradshaw, G.L., and Zytkow, J.M.,
"Scientific Discovery: Computational Explorations of the Creative
Processes", MIT Press, Cambridge, MA, 1987.
Langley, P., Simon, H.A. and Bradshaw, G.L., "Heuristics for
Empirical Discovery", in L. Bolc, editor, Computational Models
of Learning, Springer-Verlag, 1987. Also appears as CMU CS
Tech Report CMU-CS-84-14.
Chunking:
Laird J.E., Rosenbloom, P.S. and Newell, A., "Chunking in SOAR: The
Anatomy of a General Learning Mechanism", Machine Learning
1:1-46, 1986.
Explanation-Based Learning:
Mitchell, Tom M., Keller, R. M., and Kedar-Cabelli, S. T.,
"Explanation-based learning: A unified view", Machine Learning
1:47-80, 1986.
Derivational Analogy:
Carbonell, J. G., "Derivational analogy: A theory of
reconstructive problem solving and expertise acquisition." In R.S.
Michalski, Jaime G. Carbonell, and Tom M. Mitchell, editors, Machine
Learning: An Artificial Intelligence Approach, Morgan Kaufmann
Publishers, San Mateo, CA, 1986.
Theoretical Results:
Haussler, D., "Quantifying Inductive Bias: AI Learning
Algorithms and Valiant's Learning Framework", Artificial Intelligence,
36:177-221, 1988.
Leslie G. Valiant, "A theory of the learnable", Communications
of the ACM, 27(11):1134--1142, 1984.
----------------------------------------------------------------
Subject: [4-9] Case-Based Reasoning
Janet Kolodner, "Case-Based Reasoning", Morgan Kaufmann
Publishers, San Mateo, CA, 1993, 612 pages, ISBN 1-55860-237-2,
$54.95.
Janet L. Kolodner, editor, "Special issue on Case-Based Reasoning",
Machine Learning 10(3), 1993.
Roger C. Schank, "Dynamic Memory: A Theory of Reminding and
Learning in Computers and People", Cambridge University Press, New
York, NY, 1982.
Roger C. Schank and C. Riesbeck, "Inside Case-Based Reasoning",
Lawrence Erlbaum Associates, Hillsdale, NJ, 1989.
Roger C. Schank, Alex Kass, and Christopher K. Riesbeck, "Inside
Case-Based Explanation", Lawrence Erlbaum, Hillsdale, NJ, 1994. 416
pages, ISBN 0-8058-1029-3.
Craig Stanfill and David Waltz, "Toward Memory-Based
Reasoning", Communications of the ACM, 29(12):1213-1228,
December 1986. (Memory-based reasoning.)
----------------------------------------------------------------
Subject: [4-10] Genetic Algorithms
For an extended bibliography, see the FAQ posting for comp.ai.genetic.
http://www.cs.purdue.edu/coast/archive/clife/FAQ/www/
Overviews:
L. B. Booker, D.E. Goldberg and J.H. Holland, "Classifier Systems and
Genetic Algorithms", Artificial Intelligence 40(1-3):235-282,
September 1989.
David E. Goldberg, "Genetic Algorithms in Search, Optimization, and
Machine Learning", Addison-Wesley, Reading, MA, 1989, 412 pages.
ISBN 0-201-15767-5.
Davis, Lawrence (editor), "Handbook of Genetic Algorithms", Van
Nostrand Reinhold, New York, 1991, ISBN 0-442-00173-8.
D.B. Fogel, "An Introduction to Simulated Evolutionary Optimization",
IEEE Transactions on Neural Networks 5(1):3-14, 1994.
[Survey of evolutionary computation, including genetic
algorithms, evolution strategies and evolutionary programming.]
M. Srinivas and Lalit M. Patnaik, "Genetic Algorithms: A Survey",
IEEE Computer 27(6):17-26, July 1994.
Jose L. Ribeiro Filho, Philip C. Treleaven, and Cesare Alippi,
"Genetic-Algorithm Programming Environments", IEEE Computer
27(6):28-43, July 1994.
See also [4-14] Artificial Life and Cellular Automata.
----------------------------------------------------------------
Subject: [4-11] Production Systems, Expert Systems and Match Algorithms
See the Expert System Shells FAQ.
http://www.cs.cmu.edu/Web/Groups/AI/html/faqs/ai/expert/part1/faq.html
----------------------------------------------------------------
Subject: [4-12] Integrated AI Architectures
Kurt VanLehn, editor, "Architectures for Intelligence",
Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.
SOAR:
John E. Laird, Allen Newell, and Paul S. Rosenbloom, "SOAR: An
Architecture for General Intelligence", Artificial
Intelligence, 33(1):1-64, 1987.
Paul S. Rosenbloom, John E. Laird, and Allen Newell, editors, "The
SOAR Papers", MIT Press, 1993. 1,510 pages in 2 volumes,
ISBN 0-262-68071-8 paper ($65).
PRODIGY:
Steven Minton, Jaime G. Carbonell, Craig A. Knoblock,
Daniel R. Kuokka, Oren Etzioni, and Yolanda Gil.
"Explanation-based learning: A problem solving perspective".
Technical Report CMU-CS-89-103, Carnegie Mellon University,
School of Computer Science, Pittsburgh, PA, 1989.
THEO:
Tom M. Mitchell, J. Allen, P. Chalasani, J. Cheng, Oren Etzioni,
Marc Ringuette, and Jeffrey Schlimmer, "THEO: A Framework for
Self-Improving Systems", in Kurt VanLehn, editor, Architectures for
Intelligence, Lawrence Erlbaum Associates, Hillsdale, NJ, 1991.
Subsumption Architectures:
Brooks, R., "A Robust Layered Control System for a Mobile Robot",
IEEE Journal of Robotics and Automation, RA-2, pages 14-23, April 1986.
----------------------------------------------------------------
Subject: [4-13] Fuzzy Logic
Introductions/Textbooks:
Earl Cox, "The Fuzzy Systems Handbook: A Practitioner's Guide to
Building, Using, and Maintaining Fuzzy Systems", Academic Press,
Boston, MA 1994. 615 pages, ISBN 0-12-194270-8 ($49.95). [Includes
disk with ANSI C++ source code.]
Klir, George J. and Folger, Tina A., "Fuzzy Sets, Uncertainty, and
Information", Prentice Hall, Englewood Cliffs, NJ, 1988, 355 pages.
ISBN 0-13-345984-5
Kosko, B., "Neural Networks and Fuzzy Systems", Prentice Hall,
Englewood Cliffs, NJ, 1992.
Zimmermann, Hans J., "Fuzzy Set Theory and its Applications",
Boston, MA, Kluwer-Nijhoff Publishing, 1985. [Discusses fuzzy set
theory but not much about fuzzy control.]
Earl Cox, "The Fuzzy Systems Handbook: A Practitioner's Guide to
Building, Using, and Maintaining Fuzzy Systems", Academic Press,
Boston, MA 1994. 615 pages, ISBN 0-12-194270-8 ($49.95). [Includes
disk with ANSI C++ source code.]
Readings:
Didier Dubois, Henri Prade, and Ronald R. Yager, editors,
"Readings in Fuzzy Sets for Intelligent Systems", Morgan Kaufmann
Publishers, 1993. 916 pages, ISBN 1-55860-257-7 paper ($49.95).
R. Yager and L. Zadeh, editors, "An Introduction to Fuzzy Logic:
Applications in Intelligent Systems" Kluwer, 1992. $90. [Collection of
papers about fuzzy applications.]
Papers:
Zadeh, L.A., "Fuzzy Sets," Information and Control, 8, 338-353, 1965.
Brubaker, D.I., "Fuzzy-logic Basics: Intuitive Rules Replace
Complex Math," EDN, June 18, 1992.
Schwartz, D.G. and Klir, G.J., "Fuzzy Logic Flowers in Japan,"
IEEE Spectrum, July 1992.
----------------------------------------------------------------
Subject: [4-14] Artificial Life and Cellular Automata
The best source for information is the proceedings of the Artificial
Life conferences. The proceedings were edited by Christopher G.
Langton and published by Addison-Wesley.
Langton, Chris G., editor, "Artificial Life" (Proceedings of the First
International Conference '87), Addison-Wesley, 1989. ISBN 0-201-09356-1.
Langton, C.G., Taylor, C., Farmer, J.D., and Rasmussen, S., editors,
"Artificial Life II", Addison-Wesley, 1991. ISBN 0-201-52751-2.
Langton, C.G., editor, "Artificial Life III", Addison-Wesley, 1994.
ISBN 0-201-62494-X.
Artificial Life:
Levy, S., "Artificial Life", Pantheon, New York, 1992. ISBN 0-679-40774-X.
[An excellent popularization]
Przemyslaw Prusinkiewicz and Aristid Lindenmayer, "The Algorithmic
Beauty of Plants", Springer-Verlag, 1990. 228 pages, ISBN
0-387-97297-8 hardcover ($40).
See also [4-10] Genetic Algorithms.
----------------------------------------------------------------
Subject: [4-15] Qualitative Physics and Model Based Reasoning
QP Theory:
Forbus, K. D., Qualitative Process Theory, Artificial Intelligence,
24:85-168, 1984.
QSIM:
Kuipers, B., Qualitative Reasoning with Causal Models in
Diagnosis of Complex Systems, In D. S. Weld & J. deKleer, editors,
Readings in Qualitative Reasoning about Physical Systems,
pages 257-274, chapter 10, Morgan Kaufmann Publishers, 1989.
MBR-based Diagnosis:
Davis, R., Diagnostic Reasoning Based on Structure and Behavior,
Artificial Intelligence, 24:347-410, 1984.
Function-based MBR:
Sticklen, J., Chandrasekaran, B., & Bond, W.
Distributed Causal Reasoning. Knowledge Acquisition, 1:139-162, 1989.
----------------------------------------------------------------
Subject: [4-16] Task-specific Architectures for Problem Solving
Generic Tasks:
Chandrasekaran, B., Towards a Functional Architecture for
Intelligence Based on Generic Information Processing Tasks, In
IJCAI-87, pages 1183-1192, Milan, 1987.
Components of Expertise:
Steels, L., The Components of Expertise. AI Magazine, Summer, 1990.
KADS:
Breuker, J., & Wielinga, B., Models of Expertise in Knowledge
Acquisition, in G. Guida & C. Tasso, editors, Topics in
Expert Systems Design: Methodologies and Tools, Amsterdam:
North Holland Publishing Company, 1989.
Role-limiting Methods:
McDermott, J., Preliminary Steps Toward a Taxonomy of
Problem-Solving Methods, in S. Marcus, editor, Automating
Knowledge Acquisition for Expert Systems, pages 225-255,
Boston: Kluver Academic Publishers, 1988.
----------------------------------------------------------------
Subject: [4-17] Automated Deduction/Theorem Proving
Alan Bundy, "The Computer Modelling of Mathematical Reasoning",
Academic Press, 1983. [Contains Prolog code for a simple
resolution-based theorem prover.]
C. Chang and R.C. Lee, "Symbolic Logic and Mechanical Theorem
Proving", Academic Press, 1973.
David Duffy, "Principles of Automated Theorem Proving", John
Wiley and Sons, 1991.
Larry Wos and Ross Overbeek and Ewing Lusk and Jim Boyle,
"Automated Reasoning. Introduction and Applications", Second Edition,
McGraw-Hill, 1992.
Proceedings of the 11th International Conference on Automated
Deduction (CADE-11), D. Kapur (editor), Saratoga Springs, NY, USA,
June 15-18, 1992, Lecture Notes in AI 607, Springer-Verlag, 1992, 793
pages. ISBN 0-387-55602-8 and 3-540-55602-8.
[The CADE proceedings have a systems abstracts section with short
descriptions of implemented systems, many of which are available
by anonymous ftp.]
----------------------------------------------------------------
Subject: [4-18] Probabilistic Reasoning
R.O. Duda, P.E. Hart, and N.J. Nilsson, "Subjective Bayesian Methods
for Rule-Based Inference Systems", In Proceedings of the 1976 National
Computer Conference, pages 1075-1082, AFIPS, 1976.
Neapolitan, Richard E., "Probabilistic Reasoning in Expert Systems:
Theory and Algorithms", John Wiley and Sons, 1990. [Practical guide
to implementation.]
Oliver, Robert M., and Smith, James Q., editors, "Influence Diagrams,
Belief Nets and Decision Analysis", John Wiley and Sons, 1990.
Pearl, Judea, "Probabilistic Reasoning in Intelligent Systems:
Networks of Plausible Inference", Morgan Kaufmann, San Mateo,
California, 1988. [Theoretical framework for Bayesian networks]
Shafer, Glenn, and Pearl, Judea, "Readings in Uncertain Reasoning",
Morgan Kaufmann, San Mateo, California, 1990. 768 pages,
ISBN 1-55860-125-2 paper ($49.95).
Charniak, Eugene, "Bayesian Networks without tears", AI Magazine
12(4):50-63, Winter 1991. [Intro to Bayesian networks for beginners]
Abduction & Uncertainty:
Charniak, E., "Motivation analysis, abductive unification, and
nonmonotonic equality", Artifical Intelligence 34:275-95.
Hobbs, J., et al., "Interpretation as abduction", SRI AI TR #499.
Kass, A., "Adaptation-based explanation", 11th IJCAI, pages 141-47.
Current Research:
Uncertainty in Artificial Intelligence [2|3|4|5], North-Holland.
Proceedings of the Nth Conference on Uncertainty in Artificial
Intelligence, Morgan Kaufmann Publishers.
See also:
[4-8], Machine learning.
----------------------------------------------------------------
Subject: [4-19] Nonmonotonic Reasoning and Truth Maintenance Systems (TMS)
Matthew L. Ginsberg, "Readings in Nonmonotonic Reasoning",
Morgan Kaufmann, San Mateo, CA, 1987.
Reiter, Ray, "Nonmonotonic Reasoning", Annual Review of Computer
Science, 2:147-186, 1987. (Appears in Ginsberg.)
Doyle, J., "Truth Maintenance Systems", Artificial Intelligence,
12(3):231-272, 1979.
Reiter, Raymond and de Kleer, Johan, "Foundations of Assumption-Based
Truth Maintenance Systems: Preliminary Report", Proceedings of AAAI-87,
pages 183-188.
J.P. Martins, "The Truth, The Whole Truth And Nothing But the Truth:
An Indexed Bibliography to the Literature of TMS's", AI Magazine
(Special Issue), AAAI, 1990.
De Kleer, J., "An assumption-based TMS", Artificial Intelligence
28:127-162, 1986.
De Kleer, J., "Extending the ATMS", Artificial Intelligence
28:163-196, 1986.
De Kleer, J., "Problem Solving with the ATMS", Artificial Intelligence
28:197-224, 1986.
De Kleer, J., "A comparison of ATMS and CSP techniques", IJCAI 1989,
pages 290-296.
Kenneth D. Forbus and Johan de Kleer, "Building Problem Solvers",
MIT Press, Cambridge, MA 1994, 700 pages, $50. ISBN 0-262-06157-0.
[Good textbook.]
Proceedings of AAAI 1988.
Alex Kean and George Tsiknis, "Assumption based Reasoning and Clause
Management Systems", Computational Intelligence 8(1):1-24, 1992.
Alex Kean and George Tsiknis, "Clause Management Systems (CMS)",
Computational Intelligence 9(1):11-40, 1993.
Martins, Joao, & Shapiro, Stuart C., "A Model for Belief Revision,"
Artificial Intelligence 35:25-79 1988.
Martins & Reinfrank (eds), "Truth Maintenance Systems", published
by Springer Verlag in their 'Lecture Notes in Computer Science'
series, 1991.
Reinfrank, M., Dressler, O. and Brewka, G., On the Relation
Between Truth Maintenance and Autoepistemic Logic, IJCAI 1989.
Selman, B. and Levesque, H.J., "Abductive and Default Reasoning: A
Computational Core", Proceedings of AAAI-90.
----------------------------------------------------------------
Subject: [4-20] Robotics and Computer Vision
Introductions (Robotics):
John J. Craig, "Introduction to Robotics", Addison-Wesley,
Reading, MA, 1989.
Joseph L. Jones, and Anita M. Flynn, "Mobile Robots: Inspiration to
Implementation", A.K. Peters, Publisher, Wellesley, MA, 1993. 349
pages, $39.95. ISBN 1-56881-011-3.
[Two papers in the Encyclopedia of Artificial Intelligence are relevant:
Path planning and obstacle avoidance, pages 708-715
Mobile robots, pages 957-961]
Introductions (Vision):
David Marr, "Vision: a computational investigation into the human
representation and processing of visual information", W.H. Freeman,
San Francisco, CA, 1982. [The classic text, still good.]
Berthold K.P. Horn, "Robot Vision", MIT Press and McGraw-Hill,
Cambridge, MA, 1986. 509 pages. ISBN 0-2620-815-98 (MIT Press),
0-0703-034-95 (McGraw-Hill).
Vicki Bruce and Patrick R. Green, "Visual Perception: Physiology,
Psychology and Ecology", 2nd Edition, Lawrence Erlbaum Associates,
Hillsdale, NJ, 1990. ISBN 0-86377-146-7.
Martin D. Levine, "Vision in Man and Machine", McGraw-Hill, New York, 1985.
Roger Watt, "Visual Processing: computational, psychophysical, and
cognitive research", Lawrence Erlbaum Associates, Hillsdale, NJ, 1988,
152 pages.
Harry Wechsler, "Computation Vision", Academic Press, Boston, MA,
1990, 558 pages.
E. Bruce Goldstein, "Sensation and Perception", 3rd edition,
Wadsworth, Belmont CA, 1989, 598 pages, ISBN 0-534-09672-7. [Emphasis
on the physiological aspects of visual perception.]
Linda G. Shapiro and Azriel Rosenfeld, "Computer Vision and Image
Processing", Academic Press, Boston, MA 1992, 623 pages.
[One paper in the Encyclopedia of Artificial Intelligence is relevant:
Sensors, pages 1031-1036]
Surveys (Vision):
Michael I. Jordan (editor), "Learning in Graphical Models", MIT Press,
1998, 648 pages, ISBN 0-262-60032-3.
J. Michael Brady, "Computational approaches to image understanding",
ACM Computing Surveys 14(1):3-71, March 1982. (Survey of methods in
computer vision.)
Paper Collections:
Martin A. Fischler and Oscar Firschein, editors, "Readings in
Computer Vision", Morgan Kaufmann, San Mateo, CA, 1987.
Michael S. Landy and Anthony J. Movshon, "Computational Models of
Visual Processing", MIT Press, Cambridge, MA, 1991, 394 pages.
[Collection of research papers.]
Miscellaneous:
The 6.270 Robot Builder's Guide, by Fred Martin. Available by
anonymous ftp from
kame.media.mit.edu:/pub/fredm/README [18.85.0.45]
cherupakha.media.mit.edu:/pub/6270/docs/ [18.85.0.47]
This directory contains "The 6.270 Robot Builder's Guide", the
course notes to the 1992 MIT LEGO Robot Design Competition. For
more information, contact Fred Martin
-----------------------------------------------------------------
Subject: [4-21] Animats and Autonomous Agents:
R. Beer, "Intelligence as Adaptive Behavior. An Experiment in
Computational Neuroethology", Academic Press, San Diego, 1990.
ISBN: 0-12-084730-2
V. Braitenberg, "Vehicles: Experiments in Synthetic
Psychology". MIT Press, Cambridge, MA. 1984. ISBN 0-262-02208-7
Rodney A. Brooks, "A Robust Layered Control System for a Mobile
Robot", IEEE Journal of Robotics and Automation, 2:14-23, 1986.
Rodney A. Brooks, "A Robot that Walks: Emergent Behaviour from a
Carefully Evolved Network", Neural Computation, 1(2), 1989.
W. Lim and J. Eilbert, "Plan-behaviour interaction in autonomous
navigation", Proceedings of the SPIE, 1388:464-475, 1991.
Pattie Maes and Rodney A. Brooks, "Learning to Coordinate Behaviours",
Proceedings of AAAI-90, 1990.
Pattie Maes, "Designing Autonomous Agents: Theory and Practice from
Biology to Engineering and Back", MIT Press, 1991.
T. Tyrrell, "The Use of Hierarchies for Action Selection", From
animals to animats2: Proceedings of the Second International
Conference on Simulation of Adaptive Behavior, 1993.
T. Tyrrell, "Computational Mechanism for Action Selection", PhD
Thesis University of Edinburgh, 1993.
Animals to Animats Conferences:
Jean-Arcady Meyer and Stewart W. Wilson, "From Animals to Animats:
Proceedings of the First International Conference on Simulation of
Adaptive Behavior (1990, Paris, France)", MIT Press, Cambridge, MA, 1991.
551 pages, $55, ISBN 0-262-63138-5.
Jean-Arcady Meyer, Herbert L. Roitblat, and Stewart W. Wilson,
editors, "From Animals to Animats: Proceedings of the Second
International Conference on Simulation of Adaptive Behavior", MIT
Press, Cambridge, MA, 1993. 523 pages, $55, ISBN 0-262-63149-0.
Francisco J. Varela and Paul Bourgine, editors, "Toward a Practice of
Autonomous Systems: Proceedings of the First European Conference on
Artificial Life", Complex Adaptive Systems Series, MIT Press,
Cambridge, MA, 1992. 515 pages, $55.00, ISBN 0-262-72019-1.
----------------------------------------------------------------
Subject: [4-22] Distributed AI
Annotated Bibliography:
B. Chaib-draa, R. Mandiau, and P. Millot, "Distributed Artificial
Intelligence, An Annotated Bibliography", SIGART Bulletin
3(3):20-37, August 1992.
Collections:
Alan H. Bond and Les Gasser, "Readings in Distributed
Artificial Intelligence", Morgan Kaufmann, San Mateo, CA, 1988.
Les Gasser and Michael N. Huhns, eds., "Distributed
Artificial Intelligence, Volume II", Morgan Kaufmann, 1989.
Michael N. Huhns, ed., "Distributed Artificial
Intelligence", Morgan Kaufmann, 1987.
M. Wooldridge and N. R. Jennings, eds., "Intelligent Agents",
Springer-Verlag, 1995. (Lecture Notes in AI Vol 890)
(Special Issue on Distributed AI) IEEE Transactions on
Systems, Man, and Cybernetics, Vol. 11, No. 1, Jan 1981.
(Special Issue on Distributed AI---10 years later) IEEE
Transactions on Systems, Man, and Cybernetics, Vol. 21,
No. 6, Nov/Dec 1991.
Decentralized Artificial Intelligence, Y. Demazeau ed. 1990,
Decentralized AI 2, Demazeau, Y. & Muller, J-P, eds. 1991,
Decentralized AI 3, Werner & Demazeau eds. 1992,
all published by Elsevier Science Publishers .
(Special Issue on Intelligent and Cooperative Problem Solving)
International Journal of Intelligent & Cooperative Information
Systems, Vol. 1, No. 2, June 1992.
(Special Issue on Distributed AI) Group Decision and
Negotiation, Vol. 2, No. 3, 1993.
(Special Issue on Mathematical and Computational Models of
Organizations: Models and Characteristics of Agent Behavior)
International Journal of Intelligent Systems in Accounting,
Finance, and Management, Vol 2., No. 4, December 1993.
(Special issue on Intelligent Agents and Multi-Agent Systems)
Journal of Applied Artificial Intelligence,
9(4) July/August 1995 (part I), and 10(1), January/February 1995
(part 2).
----------------------------------------------------------------
Subject: [4-23] User/Agent Modeling
Afzal Ballim and Yorick Wilks, "Artifical Believers", Lawrence
Erlbaum Associates, Hillsdale, NJ, 1991. ISBN 0-8058-0453-6.
Contains a 92 page background section on belief modeling in AI,
Philosophy, NLP and Linguistics.
Kobsa, A. & Wahlster, W. (1989) "User Models in Dialog Systems."
Springer-Verlag, Heidelberg.
Rapaport, William J., "Belief Representation Systems", in S. C.
Shapiro (ed.), Encyclopedia of Artificial Intelligence, 2nd edition
John Wiley, New York, pages 98-110, 1992.
See also the journal User Modeling and User-Adapted Interaction in
part 3 of the AI FAQ.
----------------------------------------------------------------
Subject: [4-24] Philosophy of AI
Margaret A. Boden, editor, "The Philosophy of Artificial Intelligence",
Oxford University Press, New York, 1990, 452 pages.
Margaret A. Boden, "Artificial Intelligence and Natural Man",
Harvester Press and Basic Books, 1977. 2nd edition, MIT Press, 1986.
Leslie Burkholder, editor, "Philosophy and the Computer", Westview
Press, Boulder, CO, 1992.
Robert Cummins and John Pollock, editors, "Philosophy and AI: Essays
at the Interface", MIT Press, Cambridge, MA, 1991.
Daniel C. Dennett, "Consciousness explained", 1st edition, Little,
Brown and Company, Boston, 1991, 511 pages, $27.95.
Daniel C. Dennett, "Brainstorms", Harvester Press, 1978.
Hubert L. Dreyfus, "What computers can't do: a critique of artificial
reason", Harper and Row, Publishers, New York, 1972. ISBN 0-06011082-1
James H. Fetzer, editor, "Aspects of Artificial Intelligence",
Kluwer Academic Publishers, Dordrecht, Holland, 1988.
John Haugeland, "Artificial Intelligence: The very idea", MIT Press,
Cambridge, MA, 1985, 287 pages.
John Haugeland, editor, "Mind Design: Philosophy, Psychology,
Artificial Intelligence", MIT Press, Cambridge, MA 1981, 368 pages.
Douglas R. Hofstadter and Daniel C. Dennett, "The Mind's I:
Fantasies and Reflections on Self and Soul", Basic Books, New
York, 1981, 501 pages, $15.50.
Douglas R. Hofstadter, "Godel Escher Bach: Eternal Golden Braid",
Harvester Press, and Penguin books, 1979.
Kirsh, D., editor, "Foundations of Artificial Intelligence, Special
issues of Artificial Intelligence", The MIT Press, 1991. Reprinted
from Artificial Intelligence 47(1--3), 1991.
D. McDermott, "Artificial Intelligence Meets Natural Stupidity," in
Mind Design: Philosophy, Psychology, Artificial Intelligence, J.
Haugeland, editor, chapter 5, pp. 143-160, MIT Press, 1981.
Hans Moravec, "Mind Children: The future of robot and human intelligence",
Harvard University Press, Cambridge, MA, 1988, 214 pages.
Roger Penrose, "The Emperor's New Mind: Concerning computers,
minds, and the laws of physics", Oxford University Press, New York,
1989, 466 pages, $30. [A summary appears in The Behavioral and Brain
Sciences, 13(4):643-705, 1990, accompanied by an extended set of
commentaries and a reply by Penrose. See also Aaron Sloman, "The
emperor's real mind: Review of Roger Penrose's `The Emperor's New
Mind: Concerning computers minds and the laws of physics'",
Artificial Intelligence 56:355-396, 1992.]
John R Searle, `Minds Brains and Programs' in The Behavioral and
Brain Sciences, 3(3), 1980. [This article presents Searle's
"chinese room" argument. There's also an extended set of
commentaries and reply by Searle.]
H.A. Simon, "Sciences of the Artificial", 2nd Edition, MIT Press, 1981.
A.M. Turing, "Computing Machinery And Intelligence," Mind, vol. LIX,
no. 236, 1950. Reprinted in "Computers and Thought", Feigenbaum &
Feldman (eds.), 1963. Also reprinted in "The Mind's I", Hofstadter &
Dennett (eds.). Also reprinted in "Readings in Cognitive Science",
Collins & Smith (eds.), section 1.1.
In addition to the references cited above, there is also a fair amount
of philosophical discussion in R.J. Brachman and H.J. Levesque,
editors, "Readings in Knowledge Representation", Morgan Kaufmann, 1985.
----------------------------------------------------------------
Subject: [4-25] Cyc.
Cyc is a project at MCC in Texas to build an enCYClopedic database and
reasoning engine for common sense knowledge.
R.V. Guha and Douglas B. Lenat, "Enabling agents to work together",
CACM 37(7):127-142, 1994.
"CYC", AI Magazine 1986, 7(1), 1986.
"Cyc: A Mid-Term Report," AI Magazine, 11(3):32-59, Fall 1990.
"Cyc: Toward Programs With Common Sense," CACM, 33(8):30-49,
August 1990.
"Knowledge and Natural Language Processing," CACM, Aug 1990.
"When will machines learn?," Machine Learning, 4(3-4):255-257,
December 1989.
Douglas B. Lenat and R.V. Guha, "Building Large Knowledge-Based
Systems", Addison-Wesley, Reading, MA, 1990. ISBN 0-201-51752-3.
For a critique of Cyc, see Stefik and Smoliar, "The Commonsense
Reviews", Artificial Intelligence 61(1):37-40 1993.
An annotated bibliography on the Cyc project by Will Fitzgerald was
posted to comp.ai on 7-JUL-94. A copy of this bibliography is
available as
ftp.cs.cmu.edu:/user/ai/areas/doc/bib/cyc.txt
----------------------------------------------------------------
Subject: [4-26] Constraint-based Scheduling
Operations Research books:
Kenneth R. Baker, "Introduction to Sequencing and Scheduling",
John Wiley and Sons, 1974.
Jacques Carlier and Philippe Chretienne, "Problemes d'ordonnancement:
Modelisation / Complexite / Algorithmes", Masson, 1988.
Edward G. Coffman Jr., editor, "Computers and Job-Shop Scheduling
Theory", John Wiley and Sons, 1976.
Review articles:
Stephen C. Graves, "A Review of Production Scheduling",
Operations Research, 29(4):646-675, 1981.
Karl G. Kempf, "Manufacturing Planning and Scheduling: Where We Are
and Where We Need To Be", Proceedings of the IEEE International
Conference on Artificial Intelligence Applications, Miami, Florida, 1989.
Karl Kempf, Claude Le Pape, Stephen F. Smith and Barry R. Fox, "Issues
in the Design of AI-Based Schedulers: A Workshop Report", AI Magazine,
11(5):37-46, 1991.
Karl Kempf, Bruce Russell, Sanjiv Sidhu and Stu Barrett, "AI-Based
Schedulers in Manufacturing Practice: Report of a Panel Discussion",
AI Magazine, 11(5):46-55, 1991.
Mitchell S. Steffen, "A Survey of Artificial Intelligence-Based
Scheduling Systems", Proceedings of the Fall Industrial Engineering
Conference, Boston, MA, 1986.
Miscellaneous:
S.H. Clearwater, B.A. Huberman, and T. Hogg, "Cooperative solution of
constraint satisfaction problems", Science 254(5035):1181-1183,
November 22, 1991.
Mark S. Fox and Norman Sadeh, "Why is scheduling difficult? A CSP
perspective." In Proceedings of the 9th European Conference on Artificial
Intelligence (ECAI-90), pages 754-767, 1990.
P. J. M. Val Laarhoven, E. H. L. Aarts, and J. K. Lenstra, "Job shop
scheduling by simulated annealing", Operations Research 40(1):113-125,
January-February 1992.
----------------------------------------------------------------
Subject: [4-27] Music and AI
Mira Balaban, Kemal Ebcioglu, and Otto Laske, editors, "Understanding
Music with AI: Perspectives on Music Cognition", MIT Press, Cambridge,
MA, 1992. 512 pages, ISBN 0-262-52170-9, $39.95.
David Cope, "Computers and Musical Style", A-R Editions, Madison, WS,
1991. 246 pages, ISBN 0-895-79256-7.
[Music composition by computer using ATNs.]
Minds and Machines 2(4) November 1992 was devoted to music and cognition,
and there were some relevant book reviews in 3(1) February 1993.
----------------------------------------------------------------
Subject: [4-28] AI and Education
Jill H. Larkin and Ruth W. Chabay, "Computer-assisted instruction
and intelligent tutoring systems: Shared goals and complementary
approaches", Lawrence Erlbaum Associates, Hillsdale, NJ, 1992, 280 pages.
ISBN 0-80580-233-9.
Etienne Wenger, "Artificial Intelligence and Tuturing Systems",
Morgan Kaufmann Publishers, Los Altos, CA, 1987.
----------------------------------------------------------------
Subject: [4-29] Blackboard Architectures
Daniel D. Corkill, "Blackboard Systems", AI Expert 6(9):40-47,
September 1991. [An unabridged copy of this paper can be found
at http://www.bbtech.com/bibli.html]
Ian D. Craig, "Blackboard Systems", Ablex, Norwood, NJ, 1994.
240 pages, ISBN 1-56750-029-3 paper ($24.50).
[Tutorial introduction/text.]
Robert S. Engelmore and Anthony Morgan, editors, "Blackboard
Systems", Addison-Wesley, 1988.
[Contains all classic papers on blackboard systems up to around
1986; some papers were revised for this book.]
V. Jagannathan, Rajendra Dodhiawala, and Lawrence S. Baum, editors,
"Blackboard Architectures and Applications", Academic Press, 1989
[Research efforts from 1986 to 1988.]
Penny Nii, "Blackboard Systems", AI Magazine 7(3), 1986.
----------------------------------------------------------------
Subject: [4-30] Temporal Reasoning and Modal Logic
Mehmet A. Orgun, "Temporal and Modal Logic Programming: An Annotated
Bibliography", SIGART Bulletin 5(3):52-59, July 1994.
----------------------------------------------------------------
Subject: [4-31] Data Mining
Introductions:
W. Frawley, G. Piatetsky-Shapiro, and C. Matheus, "Knowledge Discovery in
Databases: An Overview", AI Magazine, pages 213-228, Fall 1992.
Article Collections:
International Journal of Intelligent Systems 7(7), September 1992.
IEEE Transactions on Knowledge and Data Engineering 5(6), December 1993.
Gregory Piatetsky-Shapiro and William J. Frawley, editors, "Knowledge
Discovery in Databases", MIT Press, 1991.
----------------------------------------------------------------
Subject: [4-32] AI book publication announcements mailing list
The AI BOOK ANNOUNCEMENTS mailing list exists to inform the AI
community about the publication of new AI-related books.
This list hasn't been active since 1995.
----------------------------------------------------------------
Subject: [4-33] Who are the major AI publishers?
Ablex Publishing Corporation
355 Chestnut Street, Norwood, NJ 07648-2090
201-767-8455/8450
Fax: 201-767-6717
Academic Press
1250 Sixth Avenue, San Diego, CA 92101
Orders: 800-321-5068
Fax: 619-699-6715
AP Professional (imprint of Academic Press)
Marketing: 525 B Street, Suite 1900, San Diego, CA 92101-4495
Orders: 6277 Sea Harbor Drive, Orlando, FL 32821-9816
Tel: 1-800-3131-APP (1-405-345-2525)
Fax: 1-800-336-7377
Email: app@acad.com
Addison Wesley Publishing Company, Inc.
Route 128, 1 Jacob Way, Reading, MA 01867
800-447-2226 (617-944-3700)
Fax: 617-944-8243 617-944-7273
E-mail: bexpress@aw.com (must register with Book Express via paper mail first)
Benjamin Cummings Publishing Company
2727 Sand Hill Road, Menlo Park, CA 94025
415-854-0300
390 Bridge Parkway, Redwood City, CA 94065
800-552-2499, 415-594-4400
Email: bookinfo@bc.aw.com
Orders: Benjamin/Cummings Publishing Company, Inc., Reading, MA 01867,
800-447-2226, fax 800-333-3328
Canadian Orders: Addison-Wesley Publishers Ltd., PO Box 580, 26 Prince
Andrew Place, Don Mills Ontario, CANADA M3C 2T8
416-447-5101, fax 416-443-0948
International Orders: Addison-Wesley Publishing Company, International
Publishing Group, Jacob Way, Reading, MA 01867
617-944-3700, fax 617-944-0826
Information/Examination Copies: 800-950-2665
Blackwell Scientific Publications, Inc.
3 Cambridge Center, Suite 208, Cambridge, MA 02142
617-225-0401
Fax: 617-225-0412
Osney Mead, PO Box 88, Oxford, 0X2 0EL, UK 0865-240201
Cambridge University Press
40 West 20th Street, New York, NY 10022
Orders: 800-221-4512, 212-924-3900, 800-872-7423
Chapman & Hall
One Penn Plaza, 41st Floor, New York, NY 10119
Tel: 1-800-634-7064 (212-244-6412)
Fax: 1-800-248-4724 (212-268-9964)
E-mail: 71201.1651@compuserve.com
In the UK call 0264-342923 or fax 0264-364418.
Overseas call 44-264-342830 or fax 44-264-342761.
Columbia University Press
562 West 113th Street, New York, NY 10025
800-944-8648
Computer Science Press, Inc.
41 Madison Avenue, New York, NY 10010-3546
212-576-9400
Computing Reviews
11 West 42nd Street, New York, NY 10036
Cornell University Press
Box 250, 124 Roberts Place, Ithica, NY 14851
800-666-2211
Digital Press
225 Wildwood Street
Woburn, MA 01801 USA
Tel: 800-366-2665 (USA) or 617-928-2527
Fax: 800-446-6520 (USA) or 617-933-6333
Elsevier Science Publishing
655 Avenue of the Americas, New York, NY 10017
212-633-3827/3650
PO Box 211, Amsterdam, 1000 AE, The Netherlands
020-580-3641
Fax: 020-580-3769
Harvard University Press
79 Garden Street, Cambridge, MA 02138
617-495-2600/2480
Houghton Miflin Company
One Memorial Drive, Cambridge, MA 02142
617-252-3000
One Beacon Street, Boston, MA 02108
800-225-3362
John Wiley & Sons, Inc.
605 Third Avenue, New York, NY 10158
212-850-6000
Kluwer Academic Publishers
101 Philip Drive, Norwell, MA 02061.
PO Box 358, Accord Station, Hingham, MA 02018-0358.
617-871-6600
Fax: 617-871-6528
Email: kluwer@world.std.com
Ftp-server: ftp.std.com:/Kluwer/ (See journals/ and books/ subdirectories.)
The Kluwer ftp server offers the complete table of contents for
Kluwer's EE & CS journals, the Aims & Scope, Instruction for Authors,
Ordering information, and LaTeX style files. This service can also be
reached using gopher.
Gopher-server: gopher.wkap.nl
Outside US:
Kluwer Academic Publishers, PO Box 322, 3300 AH Dordrecht, The Netherlands
Tel: +31-78-524400
Fax: +31-78-183273
E-mail: services@wkap.nl
Lawrence Erlbaum Associates, Inc.
365 Broadway, Hillsdale, NJ 07642
800-926-6579, (201-666-4110)
Fax: 201-666-2394
Email: orders@leahq.mhs.compuserve.com
Little Brown & Company
34 Beacon Street, Boston, MA 02108
617-227-0730
Fax: 617-227-4633
Macmillan Publishing
866 Third Avenue, Third Floor, New York, NY 10022
800-257-5755 (212-702-2000)
McGraw Hill Book Company
1221 Avenue of the Americas, 43rd Floor, New York, NY 10020
800-442-9685 (212-512-2000)
MIT Press
55 Hayward Street, Cambridge, MA 02139-1399
617-253-5642
Customer Service: 617-625-8481
Orders: 800-356-0343 (617-625-8569)
Fax: 617-625-6660/9080
E-mail (orders): mitpress-orders@mit.edu
E-mail (inquiries): mitpress-orders-inq@mit.edu
Online catalogs: telnet techinfo.mit.edu and look under
Around MIT \ Offices & Services \ MIT Press
or use the gopher server,
gopher://gopher.mit.edu:70/
In Europe, contact MIT Press, 14 Bloomsbury Square, London WC1A
2LP England, phone 071-404-0712, fax 071-404-0610 or via e-mail
100315.1423@compuserve.com. In Australia, contact Astam Books, 57-61
John Street, Leichhardt, NSW 2040 Australia, phone 02-566-4400, fax
02-566-4411.
Morgan Kaufmann Publishers, Inc.
340 Pine Street, Sixth Floor, San Francisco, CA 94104 USA
Orders: 800-745-7323 (415-392-2665)
Fax: 415-982-BOOK (= 415-982-2665)
Email: orders@mkp.com
URL: http://market.net/literary/mkp/index.html
Their "Readings in X" series is a good source of information
on various AI topics. (Many of them are listed below.)
In Europe: Direct Distribution, 27 Church Road, Hove, East Sussex, BN3 2FA, UK
Tel (+44 273) 748427, Fax (+44 273) 722180
Oxford University Press
200 Madison Avenue, New York, NY 10016
800-451-7556
Pergamon Press
395 Saw Mill River Road, Elmsford, NY 10523
800-257-5755 (914-592-7700)
Prentice Hall Inc.
College Division, 440 Sylvan Avenue, Englewood Cliffs, NJ 07632
201-592-2377
Orders: 800-223-1360 (fax to 800-495-6991) 800-526-0485
Fax: 201-461-4573
Email: books@prenhall.com, catalogs@prenhall.com
Princeton University Press
41 William Street, Princeton, NJ 08540
800-777-4726
Random House Publishing
201 East 50th Street, New York, NY 10022
212-751-2600
Springer Verlag
175 Fifth Avenue, New York, NY 10010
800-SPRINGER/800-777-4643 (201-348-4033)
Fax: 201-348-4505
University Microfilms International
300 North Zeeb Road, Ann Arbor, MI 48106
313-761-4700
Copies of PhD theses off of microfilm.
University of Chicago Press
5801 South Ellis Avenue, Chicago, IL 60637
800-621-2736 (312-702-7700)
Van Nostrand Reinhold Company, Inc.
115 Fifth Avenue, New York, NY 10003
212-254-3232
Orders: 1-800-544-0550 or fax 606-525-7778
W. H. Freeman & Company
41 Madison Avenue, New York, NY 10010
212-576-9400
Fax: 212-689-2383
W. W. Norton & Company, Inc.
500 Fifth Avenue, New York, NY 10010
800-233-4830 (212-354-5500)
----------------------------------------------------------------
Subject: [4-34] How do I get a copy of the proceedings to conference
First, ask your librarian for help. If your local library doesn't have it,
they may be able to get it on interlibrary loan.
If you want to buy your own copy, first check with the organization
that ran the conference. See part 3 of the AI FAQ for a list of many
of the AI organizations that sponsor conferences.
If they can't help you, contact the Institute for Scientific Information
(ISI), and look up the proceedings in their Index to Scientific and
Technical Proceedings (ISTP volumes). You can contact the ISI at
Institute for Scientific Information, Inc.
3501 Market Street
Philadelphia, PA 19104
Phone: 215-386-0100
Fax: 215-386-6362
Another source for proceedings author and subject indexes is:
Directory of Published Proceedings.
Series SEMT: Science/Engineering/Medicine/Technology.
Published monthly with annual cumulations by InterDok, Harrison, NY.
ISSN 0012-3293.
----------------------------------------------------------------
Subject: [4-35] How do I get a copy of
Most dissertations from US universities are available from
University Microfilms International, Inc.
300 North Zeeb Road
Ann Arbor, MI 48106
Phone: 800-521-0600 (313-761-4700)
800-343-5299 (in Canada)
They will print a copy of the dissertation from microfilm and bind it
in paperbound or cloth for a reasonable fee.
----------------------------------------------------------------
Subject: [4-36] How do I get Tech Report X?
The easiest and cheapest way to get a copy of a tech report, paper, or
thesis is to send email to the author. Most researchers will be happy
to drop a copy of the report to you in the mail, or give you a pointer
to an online copy. In some cases they may direct you to a central
technical report coordinator for their department (see [6-2]), and
getting a copy may involve a nominal fee.
Scientific DataLink publishes AIDA (AI Database of Abstracts), a
CD-ROM of abstracts from AI technical reports on a subscription basis
with a new CD every 6 months. For more information, write to
Scientific DataLink, 270 Lafayette Street, Suite 704, New York, NY
10012, call 1-800-735-8655 or fax 212-966-3417. Ask
----------------------------------------------------------------
Subject: [4-37] Videotapes and Magazines
Videotapes:
The 4th episode of the PBS series "The Machine That Changed the World" is
a good introduction to AI. It is available for $90 from Films for the
Humanities, 1-800-257-5126.
Morgan Kaufmann also has a good set of tapes of AI-related lectures, but
it runs on the expensive side.
University Video Communications sells a few AI-related videotapes,
including Allen Newell's "Desires & Diversions". For more
information, write to UVC, PO Box 5129, Stanford, CA 94309, call
415-813-0506, fax 415-813-0315, or email uvc.lemon@forsythe.stanford.edu.
AI-related magazines include:
AI EXPERT
Miller Freeman, Inc., 600 Harrison Street, San Francisco, CA 94107.
Subscriptions: 1-800-274-2534 (303-447-9330) or 71572.341@compuserve.com
$42/year (12 issues), $6 extra in Canada and Mexico,
$15 extra (surface mail) or $40 (air mail) for overseas.
Canadian GST# 124513185. For back-issues, call 1-800-444-4881.
Submissions: Larry O'Brien, Editor in Chief, <72212.3256@compuserve.com>
[AI Expert has ceased publication with the July 1995 issue.]
PC AI (ISSN 0894-0711)
3310 West Bell Road, Suite 119, Phoenix, AZ 85023.
Subscriptions: 602-971-1869, fax 602-971-2321.
$28/year (6 issues); $54 for two years; $78 for three years.
$9 extra in Canada and Mexico, $25 extra (air mail) for all
other countries.
Both magazines are excellent sources of commercial product reviews
and frequently publish "Product Guides/Showcases" that list many of the
commercial products available in a particular area of AI, such as
expert systems, neural nets, natural language processing, and so on.
BYTE Magazine does occasional features on AI topics. Program
listings for those articles are available by anonymous ftp from
---
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to
[ ask your news administrator to fix the problems with your system. ]
From: cardo@cs.ucla.edu
Subject: Artificial Intelligence FAQ: FTP Resources 5/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: FTP Resources for AI
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part5
Posting-Frequency: monthly
Last-Modified: Fri Mar 19 13:10:23 PST 1999 by Ric Crabbe
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_5.faq
Size: 90070 bytes, 1749 lines
;;; ****************************************************************
;;; Answers to Questions about Artificial Intelligence *************
;;; ****************************************************************
;;; Written by Amit Dubey, Ric Crabbe, and Mark Kantrowitz
;;; ai_5.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.
Please note that the WWW & FTP Resources section is now split across parts 5
and 6 of the AI FAQ.
Part 5 (WWW & FTP Resources):
[5-0] General Information about WWW & FTP Resources for AI
[5-1] WWW & FTP Repositories
[5-2a] WWW & FTP Resources: Agents -- Genetic Algorithms
[5-2b] WWW & FTP Resources: Genetic Algorithms -- Theorem Proving
Note: Question [5-2] is split across parts 5 and 6.
Search for [#] to get to question number # quickly.
----------------------------------------------------------------
Subject: [5-0] General Information about WWW & FTP Resources for AI
Remember, when ftping compressed or compacted files (.Z, .gz, .arc, .fit,
etc.) to use binary mode for retrieving the files.
Files that end with a .gz suffix were compressed with the patent-free
gzip (no relation to zip). Source for gzip is available from
prep.ai.mit.edu:/pub/gnu/
as the files gzip-1.2.4.shar, gzip-1.2.4.tar,or gzip-1.2.4.msdos.exe.
If you do not have ftp access, you can FTP files by E-mail. Send a
message with the word "help" in the body to ftpmail@decwrl.dec.com. As
the DECWRL ftpmail server is overloaded, you are encouraged to use an
alternate ftpmail server, such as ftpmail@cs.uow.edu.au (Australia),
ftpmail@ftp.uni-stuttgart.de (Germany), ftpmail@doc.ic.ac.uk (Great
Britain), ftpmail@ieunet.ie (Ireland), ftpmail@lth.se (Sweden),
ftpmail@sunsite.unc.edu (USA), ftpmail@ftp.uu.net (USA, message
relayed to ftpmail@decwrl.dec.com, so don't use it),
ftpmail@gallifrey.ucs.uoknor.edu (USA), or
ftpmail@seds.lpl.arizona.edu (USA). If you're on BITNET, send a
message with the word "help" in the body to BITFTP@PUCC, BITFTP@PLEARN
or BITFTP@DEARN (Internet equivalents bitftp@pucc.princeton.edu,
bitftp@plearn.edu.pl and bitftp@vm.gmd.de, respectively).
In general, see the Lisp FAQ for Lisp-related software and the Prolog
Resource Guide and the Prolog FAQ for Prolog-related software. If a
Lisp-based or Prolog-based system is listed here, only the ftp site
and directory will be listed; for a more detailed description, see the
Lisp FAQ and the Prolog Resource Guide. For information on obtaining
the Lisp FAQ or the Prolog Resource Guide see [1-0].
When referring to software, "alpha" indicates an internal early
release, "beta" indicates an external early release, and "omega"
indicates an external "finished" release. Generally an "alpha" release
means the creator hasn't yet tested for bugs.
----------------------------------------------------------------
Subject: [5-1] WWW & FTP Repositories
CMU AI Repository:
The CMU Artificial Intelligence Repository was established by
Carnegie Mellon University to contain public domain and freely
distributable software, publications, and other materials of
interest to AI researchers, educators, students, and practitioners.
The AI Repository currently contains more than a gigabyte of
material and is growing steadily.
The AI Repository is accessible for free by anonymous FTP, AFS, and
WWW. A selection of materials from the AI Repository is also being
published on CD-ROM by Prime Time Freeware and is available for
purchase by mail or fax (see [6-5] for more information).
The AI Repository is accessible by anonymous FTP from
ftp.cs.cmu.edu:/user/ai/ [128.2.206.173]
by AFS (Andrew File System) from
/afs/cs.cmu.edu/project/ai-repository/ai/
and by WWW from the URL
http://www.cs.cmu.edu/Web/Groups/AI/html/repository.html
Be sure to read the files 0.doc and readme.txt in this directory.
The AI Repository is still under construction, but to date, the
AI Programming Languages and the AI Software Packages sections
are "complete". These can be accessed in the lang/ and areas/
subdirectories of the AI Repository. Compression and archiving
utilities may be found in the util/ subdirectory. Other directories,
which are in varying states of completion, are events/ (Calendar of
Events, Conference Calls) and pubs/ (Publications, including technical
reports, books, mail/news archives).
The AI Programming Languages section of the repository includes
directories for Common Lisp, Prolog, Scheme, Smalltalk, and
other AI-related programming languages.
The AI Software Packages section of the repository includes
subdirectories for:
agents/ Intelligent Agent Architectures
alife/ Artificial Life and Complex Adaptive Systems
anneal/ Simulated Annealing
blackbrd/ Blackboard Architectures
bookcode/ Code From AI Textbooks
ca/ Cellular Automata
classics/ Classical AI Programs
constrnt/ Constraint Processing
dai/ Distributed AI
discover/ Discovery and Data-Mining
doc/ Documentation
edu/ Educational Tools
expert/ Expert Systems/Production Systems
fuzzy/ Fuzzy Logic
games/ Game Playing
genetic/ Genetic Algorithms, Genetic Programming,
Evolutionary Programming
icot/ ICOT Free Software
kr/ Knowledge Representation, Semantic Nets, Frames, ...
learning/ Machine Learning
misc/ Miscellaneous AI
music/ Music
neural/ Neural Networks, Connectionist Systems, Neural Systems
nlp/ Natural Language Processing (Natural Language
Understanding, Natural Language Generation, Parsing,
Morphology, Machine Translation)
planning/ Planning, Plan Recognition
reasonng/ Reasoning (Analogical Reasoning, Case Based Reasoning,
Defeasible Reasoning, Legal Reasoning, Medical Reasoning,
Probabilistic Reasoning, Qualitative Reasoning,
Temporal Reasoning, Theorem Proving/Automated Reasoning,
Truth Maintenance)
robotics/ Robotics
search/ Search
speech/ Speech Recognition and Synthesis
testbeds/ Planning/Agent Testbeds
vision/ Computer Vision
The repository has standardized on using 'tar' for producing
archives of files and 'gzip' for compression.
To search the keyword index by mail, send a message to:
ai+query@cs.cmu.edu
with one or more lines containing calls to the keys command, such as:
keys lisp iteration
in the message body. Keywords may be regular expressions and are
compared with the index in a case-insensitive conjunctive fashion.
You'll get a response by return mail. Do not include anything else in
the Subject line of the message or in the message body. For help on
the query mail server, include:
help
instead.
A WWW interface to the keyword searching program is accessible
through the URL
http://www.cs.cmu.edu/Web/Groups/AI/html/keys/keysform.html
We plan on making the source code (including indexes) to
this keyword searching program available, as soon as it is stable.
We hope to eventually have a fully automated calendar of events,
an expanded AI Publications directory, mailing list and newsgroup
archives, and much much more.
Contributions of software and other materials are always welcome but
must be accompanied by an unambiguous copyright statement that grants
permission for free use, copying, and distribution -- either a
declaration by the author that the materials are in the public domain,
that the materials are subject to the GNU General Public License (cite
version), or that the materials are subject to copyright, but the
copyright holder grants permission for free use, copying, and
distribution. (We will tell you if the copying permissions are too
restrictive for us to include the materials in the repository.)
Inclusion of materials in the repository does not modify their
copyright status in any way. Materials may be placed in:
ftp.cs.cmu.edu:/user/ai/new/
When you put anything in this directory, please send mail to
ai+contrib@cs.cmu.edu
giving us permission to distribute the files, and state whether
this permission is just for the AI Repository, or also includes
publication on the CD-ROM version (Prime Time Freeware for AI).
We would also appreciate if you would include a 0.doc file for your
package; see /user/ai/new/package.doc for a template. (If you don't
have the time to write your own, we can write it for you based on
the information in your package.)
For more information on the CMU AI Repository, please send mail to
Mark Kantrowitz
Known mirrors:
+ Lisp Section
ftp.sunet.se:/pub/lang/lisp/
Artificial Life Online and the Artificial Life BBS:
Sponsored by MIT Press and the Santa Fe Institute, Artificial Life
Online and the Artificial Life BBS is intended to be a central
information collection and distribution site on the Internet for any
and all aspects of the Artificial Life endeavor.
A special feature of the BBS is a collection of 40 or so local
newsgroups dedicated to a wide variety of topics in Artificial Life.
Artificial Life Online is accessible by anonymous ftp from
alife.santafe.edu:/pub/ [192.12.12.99]
by World-Wide Web from
http://alife.santafe.edu/
and by Gopher from
gopher://alife.santafe.edu:70/
To access the Alife Online BBS (ALBBS) by telnet, telnet to
alife.santafe.edu and login as "bbs". You will find yourself in a
specially constructed UNIX shell within which either BBS menu commands
or UNIX commands can be used to browse around in the system. Run the
"account" program to set up a local account. These accounts will
initially be provided free of charge, but they will eventually have to
charge a nominal fee in order to cover operating expenses (on the
order of $15-$25 per year). Subscribers to the Artificial Life Journal
from MIT Press will have this fee waived. Once you have an account on
alife.santafe.edu, you can telnet to alife.santafe.edu and login as
yourself. You do not have to create an account to use the ALBBS via
telnet -- you can simply login as "bbs" and browse through the system
using the BBS commands.
Please send suggestions and questions about the Alife Online/BBS
system to feedback@alife.santafe.edu.
Artificial Life:
life.anu.edu.au:/pub/complex_systems/alife/
Consortium for Lexical Research:
clr.nmsu.edu:/CLR/ [128.123.1.12]
Archive containing a variety of programs and data files related to
natural language processing research, with a particular focus on
lexical research. The file 00README.clr.site is a good place to start.
See the file catalog or catalog.ps for a listing of the contents of
the archive. Long descriptions are in the info/ subdirectory.
Materials for paid-up members of the Consortium are in the
members-only/ subdirectory. Public materials include the Alvey Natural
Language Tools, Sowa's Conceptual Graph parser implemented in YACC by
Maurice Pagnucco, a morphological parsing lexicon of English, a
phonological rule compiler for PC-KIMMO, C source code for the NIST
SGML parser, PC-KIMMO sources, the 1911 Roget Thesaurus, and a variety
of word lists (including English, Dutch, and male/female/last names).
Comments and questions may be directed to lexical@nmsu.edu.
There are also some materials in clr.nmsu.edu:/pub/ unrelated to
the archive.
Fuzzy Logic Repositories:
ntia.its.bldrdoc.gov:/pub/fuzzy/ [132.163.64.201] contains information
concerning fuzzy logic, including bibliographies (bib/), product
descriptions and demo versions (com/), machine readable published
papers (lit/), miscellaneous information, documents and reports (txt/),
and programs, code and compilers (prog/). You may download new items
into the new/ subdirectory. If you deposit anything in new/, please
inform fuzzy@its.bldrdoc.gov. The repository is maintained by
Timothy Butler, tim@its.bldrdoc.gov. The Fuzzy Logic Repository is also
accessible through a mail server, rnalib@its.bldrdoc.gov. For help on
using the server, send mail to the server with the following line in
the body of the message:
@@ help
Other commands available include index, list, find, send, and credits.
Togai InfraLogic, Inc. (TIL) also runs a fuzzy logic email server
which contains demo versions of some of their software, fuzzy logic
bibliographies, conference announcements, a short introduction to
fuzzy logic, copies of the company newsletter, archives of
comp.ai.fuzzy, and so on. See the entry in the answer to question
[1-7] for more information on the company. To get started with the
fuzzy logic email server, send a message with NO SUBJECT LINE to
fuzzy-server@til.com, containing just the word "help" in the message
body. The server will reply with a set of instructions. Please
address any comments, questions or requests to either erik@til.com or
tanaka@til.com. Most of the contents of the TIL server is mirrored at
Tim Butler's fuzzy logic ftp repository at ntia.its.bldrdoc.gov and at
Ostfold ftp repository at ftp.dhhalden.no. For more information,
write to Togai InfraLogic, Inc., 5 Vanderbilt, Irvine, CA 92718 or
call 714-975-8522.
The Aptronix FuzzyNet files are available through an email
server. Send email to fuzzynet@aptronix.com with "help"
in the message body to get instructions on how to retrieve files.
"catalog" or "index" will get you a listing of available files.
(You can also connect to the FuzzyNet repository by modem to Aptronix
FuzzyNet 408-428-1883 N/8/1 1200-19,200 baud.) Files on the server
include descriptions of fuzzy logic applications (e.g., washing
machines, camera focusing, air conditioning), introductory materials,
Fide related information, archives of comp.ai.fuzzy, etc. If you'd
like to have a file included in the FuzzyNet server (e.g., moderate
length technical reports), send email to Scott Irwin
Genetic Algorithms:
The Genetic Algorithms Repository is accessible by anonymous ftp as
ftp.aic.nrl.navy.mil:/pub/galist/
There is also a WWW version at
http://www.aic.nrl.navy.mil/galist/
The information files includes Nici Schraudolph's survey of free and
commercial GA software (send email to
the list).
The software includes GAC (a simple GA written in C), GAL (a simple GA
written in Common Lisp), GAucsd, GECO (a Common Lisp toolbox for
constructing genetic algorithms), GENESIS, GENOCOP, Paragenesis (a
parallel version of GENESIS that runs on the CM-200), SGA-C (a C
implementation/extension of Goldberg's SGA system).
UC/Irvine (UCI) AI/Machine Learning Repository:
ftp.ics.uci.edu has a variety of AI-related materials, with a special
focus on machine learning. For example,
ftp.ics.uci.edu:/pub/machine-learning-databases/
contains over 80 benchmark data sets for classifier systems (30mb).
Files may also be retrieved by email using the archive server
archive-server@ics.uci.edu. Commands to the server should be given
in the message body. Some commands are:
help
send
find
The help command replies with a useful help message.
Site Librarian: Patrick M. Murphy (ml-repository@ics.uci.edu)
Off-Site Assistant: David W. Aha (aha@cs.jhu.edu)
MLnet Machine Learning Archive
MLnet Online Information Service
In 1988 the Special Interest Group on Machine Learning of the German
Society for Computer Science (GI e.V.) decided to establish a library
of PROLOG implementations of Machine Learning algorithms. By 1994 the
library had a sizable collection of GLPed PROLOG software. The site
has grown, and now, according to the webpage it "offers a growing
collection of ML information, datasets, software and pointers to other
ML resources." The current (May 1999) homepage is at:
http://www.gmd.de/ml-archive/frames/Welcome.html
In the near future (June or July 1999) this site will be succeeded by
the MLnet Online Information Service (MLnet OiS) at:
http://www.mlnet.org
Send your contributions to Mathias Kirsten (info@mlnet.org) at the GMD -
German National Research Center, or use the contribution facilities within
the MLnet OiS.
Funic Neural Nets Archive Site:
The Finnish University maintains an archive site containing a large
collection of neural network papers and public domain software.
The files are available through the web interface at
http://www.nic.funet.fi/pub/sci/neural or through FTP from
ftp://funic.funet.fi:/pub/sci/neural. FTP users: see the file 01README
for details. There's also a directory for non-neural net AI stuff
in the directory /pub/sci/ai. (Web service is still experimental as
of 05/29/99).
There is a list of mirrored ftp sites is in 04Neural_FTP_Sites. For
further information, contact neural-adm@funic.funet.fi or Marko
Gronroos
OSU Neuroprose:
archive.cis.ohio-state.edu:/pub/neuroprose/ [128.146.8.52]
This directory contains technical reports, mostly from the early 90's, as a
public service to the connectionist and neural network scientific community
which has an organized mailing list (for info:
connectionists-request@cs.cmu.edu)
NL Software Registry:
[maintainer's note: links upto this point haven't been checked]
The Natural Language Software Registry is a catalogue of software
implementing core natural language processing techniques, whether
available on a commercial or noncommercial basis. Some of the topics
listed include speech signal processing, morphological analysis,
parsers, natural language generation systems, and knowledge
representation systems. The second edition of the catalog contains
more than 100 descriptions of natural language processing software.
The catalogue is available from the German Research Institute for
Artificial Intelligence (DFKI) in Saarbruecken (Germany) at the URL
http://www.dfki.de/lt/registry
The email contact for the site is lt-www@dfki.de
Essex ROBOTS Archive:
Contains robotics related information, hasn't been updated since 1995 or so:
ftp.essex.ac.uk:/pub/robots/
Miscellaneous AI:
Some miscellaneous AI programs may be found on ftp.uu.net:/pub/ai/
Most are mirrors of programs available at other sites.
AI_ATTIC is an anonymous ftp collection of classic AI programs and
other information maintained by the University of Texas at Austin. It
includes Parry, Adventure, Shrdlu, Doctor, Eliza, Animals, Trek, Zork,
Babbler, Jive, and some AI-related programming languages. This
archive is available by anonymous ftp from ftp.cc.utexas.edu
in the directory /pub/AI_ATTIC. For more information, contact
atticmaster@bongo.cc.utexas.edu.
The QWERTZ toolbox, a library of Standard ML modules with an emphasis
on symbolic Artificial Intelligence programming, (including
implementations of heuristic search and an ATMS reason maintenance
system) may be obtained by anonymous ftp from
ftp.gmd.de:/gmd/ai-research/Software/qwertz.tar.gz
For more information, write to Tom Gordon
----------------------------------------------------------------
Subject: [5-2a] WWW & FTP and Other Resources: Agents -- Planning
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,
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 (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.
Analogical Reasoning:
SME -- multivac.ils.nwu.edu:/pub/SME
Contact: Brian Falkenhainer
Ken Forbus
the Structure-Mapping Engine, as described in Falkenhainer,
Forbus, and Gentner's 1987 AIJ article.
Artificial Life:
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.hip.atr.co.jp/~ray/tierra/tierra.html.
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.
Blackboard Architectures:
GBB (PD Version) -- ftp.cs.umass.edu:/gbb/
Case-based Reasoning:
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 -- 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.
Chess:
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
Complex Systems:
[Maintainer's note: none of the URLs below seem to be working. If you
have any information about this, or new complex systems work please get
in touch with the maintainers].
A list of resources for Complex Adaptive Systems is maintained by
Alex Mallet, including information about chaos theory, genetic
programming, artificial life, and neural networks. To get a copy by
email, send a message to
thesisnet-request@eniac.seas.upenn.edu
with cplxsys in the subject line. A hypertext version is available by WWW
from
http://www.seas.upenn.edu/~ale/cplxsys.html
Send corrections to Alex Mallet
Constraint Programming and Non-determinism:
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
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.
Data Mining and Knowledge Discovery in Databases:
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 by anonymous FTP from
ftp.gmd.de:/GMD/explora/
as the files Explora.sit.hqx and README. For more information, see
http://orgwis.gmd.de:80/explora/
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
Doerpmund
Eliza and Similar Programs:
[Maintainer's note: many sites below this point have not been checked].
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".
muLISP-87 (a MSDOS Lisp sold by Soft Warehouse) includes
a Lisp implementation of Eliza.
Compute!'s Gazette, June 1984, includes source for a BASIC
implementation of Eliza. You can also find it in 101 more computer
games, edited by David Ahl, published by Creative Computing (alas,
they're defunct, and the book is out of print).
Herbert Schildt "Artificial Intelligence using C", McGraw-Hill, 1987,
ISBN 0-07-881255-0, pp315-338, includes a simple version of DOCTOR.
ucsd.edu:/pub/pc-ai contains implementations of Eliza for the IBM PC.
eecs.nwu.edu:/pub/eliza/ contains several Eliza implementations.
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.
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
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
University of Cambridge Computer Laboratory.
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
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
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)
David Rogers
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
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
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/
as the files gpquick.tar (unix version, tested with CC and g++) and
gpquick.zip (PC/ANSI C version, tested with Borland 3.1).
For more information, write to Andrew Singleton
GENlib is a library of functions for genetic algorithms together with
two applications of the library to train neural networks. The library
is available by anonymous ftp from
ftp.neuro.informatik.uni-kassel.de:/pub/NeuralNets/GA-and-NN/
for academic research and educational purposes only. Commercial uses
________________________________________________________
---
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to
[ ask your news administrator to fix the problems with your system. ]
From: cardo@cs.ucla.edu
Subject: Artificial Intelligence FAQ: FTP Resources 6/7 [Monthly posting]
Newsgroups: comp.ai,news.answers,comp.answers
Approved: news-answers-request@MIT.EDU
Summary: FTP Resources for AI
Distribution: world
Followup-To: comp.ai
Reply-To: cardo@cs.ucla.edu
Organization: University of California, Los Angeles
Archive-name: ai-faq/general/part6
Posting-Frequency: monthly
Last-Modified: Fri Mar 19 13:37:08 PST 1999 by Ric Crabbe
Version: 2.0
Maintainer: Ric Crabbe
URL: ftp://ftp.cs.ucla.edu/pub/AI/ai_6.faq
Size: 84098 bytes, 1871 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.
Please note that the WWW & FTP Resources section is now split across parts 5
and 6 of the AI FAQ.
Note: Question [5-2] is split across parts 5 and 6.
Part 5b (WWW & FTP Resources):
[5-2b] WWW & FTP Resources: Qualitative Reasoning -- Theorem Proving
--------------------------------------------------------------------
Subject: [5-2b] WWW & FTP Resources: GAs -- Theorem Proving
ICOT:
Japan's Institute for New Generation Computer Technology (ICOT) has
made their software available to the public free of charge. The
collection includes a variety of prolog-based programs in symbol
processing, knowledge representation, reasoning and problem solving,
natural language processing. All programs are available by anonymous
ftp from ftp.icot.or.jp. Note that most of the programs are written
for the PSI machines, and very few have been ported to Unix-based
emulators. For further information, send email to ifs@icot.or.jp, or
write to ICOT Free Software Desk, Institute for New Generation
Computer Technology, 21st Floor, Mita Kokusai Bldg., 4-28, Mita
1-chome, Minato-ku, Tokyo 108, Japan, fax +81-3-4456-1618.
Knowledge Representation:
KNOWBEL -- ai.toronto.edu:/pub/kr/ as the files knowbel.tar.Z and
manual.txt.tar.Z
Contact: Bryan M. Kramer,
Telos temporal/sorted logic system.
SB-ONE -- Contact: kobsa@inf-wiss.uni-konstanz.de
KL-ONE family. Currently undergoing revision and will be
renamed KN-PART+.
KRIS -- Contact: baader@dfki.uni-kl.de
KL-ONE family (Symbolics only)
BACK -- Contact: back@cs.tu-berlin.de
ftp.cs.tu-berlin.de:/pub/doc/reports/tu-berlin.de/kit/Back52
Files are BACK_V52.intro and Back52.tar.Z
Tar file includes Tutorial/Manual in postscript format
and installation instructions.
KL-ONE family
CLASSIC -- Contact: dlm@research.att.com
KL-ONE family
MOTEL -- Contact: hustadt@mpi-sb.mpg.de
mpi-sb.mpg.de:/pub/tools/motel.tar.Z [139.19.1.1]
Modal KL-ONE (contains KRIS as a kernel).
Implemented in Prolog.
FOL GETFOL -- Contact: fausto@irst.it
Weyrauch's FOL system
COLAB/RELFUN -- Contact: boley@informatik.uni-kl.de
Logic Programming
COLAB/FORWARD -- Contact: hinkelma@dfki.uni-kl.de
Logic Programming
COLAB/CONTAX -- Contact: meyer@dfki.uni-kl.de
Constraint System for Weighted Constraints over
Hierarchically Structured Finite Domains.
COLAB/TAXON -- Contact: hanschke@dfki.uni-kl.de
Terminological Knowl. Rep. w/Concrete Domains
SNePS (Semantic Network Processing System) is the implementation of a
fully intensional theory of propositional knowledge representation and
reasoning. SNePS includes a module for creating and accessing
propositional semantic networks, path-based inference, node-based
inference based on SWM (a relevance logic with quantification) that
uses natural deduction and can deal with recursive rules, forward,
backward and bi-directional inference, nonstandard logical connectives
and quantifiers, an assumption based TMS for belief revision (SNeBR), a
morphological analyzer and a generalized ATN (GATN) parser for parsing
and generating natural language, SNePSLOG, a predicate-logic-style
interface to SNePS, XGinseng, an X-based graphics interface for
displaying, creating and editing SNePS networks, SNACTor, a
preliminary version of the SNePS Acting component, and SNIP 2.2, a new
implementation of the SNePS Inference Package that uses rule shadowing
and knowledge migration to speed up inference. SNeRE (the SNePS
Rational Engine), which is part of Deepak Kumar's dissertation about
the integration of inference and acting, will replace the current
implementation of SNACTor. SNePS is written in Common Lisp, and has
been tested in Allegro CL 4.1, Lucid CL 4.0, TI Common Lisp, CLISP
May-93, and CMU CL 17b. It should also run in Symbolics CL, AKCL 1.600
and higher, VAX Common Lisp, and MCL. The XGinseng interface is built
on top of Garnet. SNePS 2.1 is free according to the GNU General
Public License version 2. The SNePS distribution is available by
anonymous ftp from
ftp.cs.buffalo.edu:/pub/sneps/ [128.205.32.9]
as the file rel-x-yyy.tar.Z, where 'x-yyy' is the version. The other
files in the directory are included in the distribution; they are
duplicated to let you get them without unpacking the full distribution
if you just want the bibliography or manual. If you use SNePS, please
send a short message to shapiro@cs.buffalo.edu and
snwiz@cs.buffalo.edu. Please also let them know whether you'd like to
be added to the SNUG (SNePS Users Group) mailing list.
URANUS is a logic-based knowledge representation language. Uranus is
an extension of Prolog written in Common Lisp and using the syntax of
Lisp. Uranus extends Prolog with a multiple world mechanism for
knowledge representation and term descriptions to provide
functional programming within the framework of logic programming.
It is available free by anonymous ftp from
etlport.etl.go.jp:/pub/uranus/ftp/ [192.31.197.99]
for research purposes only. For more information contact the author,
Hideyuki Nakashima
Machine Learning:
COBWEB/3 -- Contact: cobweb@ptolemy.arc.nasa.gov
IND -- Contact: NASA COSMIC,
Tel: 706-542-3265 (ask for customer support)
Fax: 706-542-4807
IND is a C program for the creation and manipulation of
decision trees from data, integrating the CART,
ID3/C4.5, Buntine's smoothing and option trees, Wallace
and Patrick's MML method, and Oliver and Wallace's MML
decision graphs which extend the tree representation to
graphs. Written by Wray Buntine,
AUTOCLASS -- Contact: taylor@ptolemy.arc.nasa.gov
AutoClass is an unsupervised Bayesian classification system for
independent data.
FOIL -- ftp.cs.su.oz.au:/pub/ [129.78.8.208]
as the files foil4.sh, foil5.sh, and foil6.sh.
Each shell archive contains source, a brief manual,
and several sample datasets. FOIL2 should be available
from sumex-aim.stanford.edu:/pub/FOIL.sh. FOIL 6.0 now uses
ANSI C.
Contact: J. Ross Quinlan
Mike Cameron-Jones
RWM -- Contact: H. Altay Guvenir
RWM is a program for learning problem solving strategies,
written in Common Lisp (tested on Suns and NeXT).
MOBAL is a system for developing operational models of application
domains in a first order logic representation. It integrates a manual
knowledge acquisition and inspection environment, an inference engine,
machine learning methods for automated knowledge acquisition, and a
knowledge revision tool. By using MOBAL's knowledge acquisition
environment, you can incrementally develop a model of your domain in
terms of logical facts and rules. You can inspect the knowledge you
have entered in text or graphics windows, augment the knowledge, or
change it at any time. The built-in inference engine can immediately
execute the rules you have entered to show you the consequences of
your inputs, or answer queries about the current knowledge. MOBAL also
builds a dynamic sort taxonomy from your inputs. If you wish, you can
use several machine learning methods to automatically discover
additional rules based on the facts that you have entered, or to form
new concepts. If there are contradictions in the knowledge base due to
incorrect rules or facts, there is a knowledge revision tool to help
you locate the problem and fix it. MOBAL (release 3.0b) is available
free for non-commercial academic use by anonymous ftp from
ftp.gmd.de:/gmd/mlt/Mobal/
The system runs on Sun SparcStations, SunOS 4.1, and includes a
graphical interface implemented using Tcl/TK.
PEBLS (Parallel Exemplar-Based Learning System) is a nearest-neighbor
learning system designed for applications where the instances have
symbolic feature values. PEBLS has been applied to the prediction of
protein secondary structure and to the identification of DNA promoter
sequences. PEBLS 3.0 is written in ANSI C and is available by
anonymous ftp from blaze.cs.jhu.edu:/pub/pebls/pebls.tar.Z
[128.220.13.50] for research purposes only. For more information,
contact Steven Salzberg
OC1 (Oblique Classifier 1) is a multivariate decision tree induction
system designed for applications where the instances have numeric
feature values. OC1 builds decision trees that contain linear
combinations of one or more attributes at each internal node; these
trees then partition the space of examples with both oblique and
axis-parallel hyperplanes. OC1 has been used for classification of
data from several real world domains, such as astronomy and cancer
diagnosis. A technical decription of the algorithm can be found in
the AAAI-93 paper by Sreerama K. Murthy, Simon Kasif, Steven Salzberg
and Richard Beigel. A postscript version of this paper is included in
the distribution. OC1 is a written entirely in ANSI C. OC1 is
available by anonymous ftp from
blaze.cs.jhu.edu:/pub/oc1/ [128.220.13.50]
This distribution is provided for non-commercial purposes only. For
more information, contact Sreerama K. Murthy
(primary contact), Steven Salzberg
Kasif
Hopkins University, Baltimore, MD 21218.
Set-Enumeration (SE) Trees for Induction/Classification. Significant
research in Machine Learning, and in Statistics, has been devoted to
the induction and use of decision trees as classifiers. An induction
framework which generalizes decision trees using a Set-Enumeration
(SE) tree is outlined in
Rymon, R. (1993), An SE-tree-based Characterization of the Induction
Problem. In Proc. of the Tenth International Conference on Machine
Learning, Amherst MA, pp. 268-275.
In this framework, called SE-Learn, rather than splitting according to
a single attribute, one recursively branches on all (or most) relevant
attributes. An induced SE-tree can be shown to economically embed many
decision trees, thereby supporting a more expressive hypothesis
representation. Also, by branching on many attributes, SE-Learn
removes much of the algorithm-dependent search bias. Implementations
of SE-Learn can benefit from many techniques developed for decision
trees (e.g., attribute-selection and pruning measures). In particular,
SE-Learn can be tailored to start off with one's favorite decision
tree, and then improve upon it by further exploring the SE-tree. This
hill-climbing algorithm allows trading time/space for added accuracy.
Current studies (yet unpublished) show that SE-trees are particularly
advantageous in domains where (relatively) few examples are available
for training, and in noisy domains. Finally, SE-trees can provide a
unified framework for combining induced knowledge with knowledge
available from other sources (Rymon, 1994).
Rymon, R. (1994), On Kernel Rules and Prime Implicants. To appear in
Proc. of the Twelfth National Conference on Artificial Intelligence,
Seattle WA.
A Lisp implementation of SE-Learn is available from Ron Rymon
development.
MLC++ is a Machine Learning library of C++ classes being developed at
Stanford. More information about the library can be obtained at URL
http://robotics.stanford.edu:/users/ronnyk/mlc.html
The utilities are available by anonymous ftp from
starry.stanford.edu:/pub/ronnyk/mlc/util/
They are currently provided only as object code for Sun, but source code
will be distributed to sites that wish to port the code to other compilers.
For more information write to Ronny Kohavi
Mathematics:
SymbMath is a "symbolic calculator that can solve symbolic math
problems" written by Weiguang Huang
IBM PCs (8086) under MS-DOS. Shareware versions are available by
anonymous ftp from
wsmr-simtel20.army.mil:/calculator/sm22a.zip
rana.cc.deakin.oz.au:/huang/sm22a.zip
from the URL
http://acsusun.acsu.unsw.edu.au/~s9300078/symbmath.html
or by e-mail from listserv@vm1.nodak.edu (listserv@ndsuvm1.bitnet). To
subscribe to the symbmath@explode.unsw.edu.au mailing list, send email
to majordomo@explode.unsw.edu.au with
subscribe symbmath
in the message body.
Medical Reasoning:
TMYCIN -- sumex-aix.stanford.edu:/tmycin
Natural Language Processing:
YACC -- ftp.cs.cmu.edu:/user/ai/lang/lisp/code/parsing/lalr/
Contact: Mark Johnson
Lisp YACC/Parser.
BABBLER -- Contact: rsf1@ra.msstate.edu
Markov chains/NLP
PENMAN -- Contact: hovy@isi.edu
Natural Language Generation.
PC-KIMMO -- msdos.archive.umich.edu:/msdos/linguistics/pckim105.zip
An implementation of KIMMO morphological analyzer
for the IBM PC.
FUF -- Contact: elhadad@bengus.bgu.ac.il
ftp: black.bgu.ac.il:/pub/fuf/fuf5.2.tar.Z
cs.columbia.edu:/pub/fuf/fuf5.2.tar.Z
Natural language generation system based on
Functional Unification Grammars.
Includes unifier, large grammar of English (surge)
user manual and many examples. Written in Common Lisp.
[A WAM-based C compiler for FUF is in the works.]
RegEx -- csd4.csd.uwm.edu:/pub/compilers/regex/
Translates regular expressions to DFAs. Written in C.
Mark Hopkins
Tom -- csd4.csd.uwm.edu:/pub/compilers/tomita/
C implementation of the Tomita parsing algorithm
Mark Hopkins
Common Lisp versions of the miniature natural language understanding
programs from "Inside Computer Understanding" by Schank and Riesbeck,
1981, are available by anonymous ftp from
cs.umd.edu:/pub/schank/icu/
This includes the SAM and ELI miniatures. It will
eventually include copies of the miniature versions of PAM, POLITICS,
and Tale-Spin. The FOR macro is also available in this directory, as
are a set of functions for manipulating and matching lisp
representations of Conceptual Dependency formulas. Contact Bill
Andersen
The Link Parser is a highly efficient English parser written by Danny
Sleator and Davy Temperley. It uses a novel grammatical formalism known
as Link Grammar to represent a robust and diverse collection of
English-language phenomena. The system is available by anonymous ftp from
ftp://ftp.cs.cmu.edu/user/sleator/link-grammar/
Read the README file for more information. To see an online demo of
the parser, visit
http://bobo.link.cs.cmu.edu/cgi-bin/grammar/build-intro-page.cgi
Further information can be found on Danny Sleator's web page,
http://www.cs.cmu.edu/~sleator
The Xerox part-of-speech tagger is available by anonymous ftp from
parcftp.xerox.com:/pub/tagger/tagger-1-0.tar.Z. It is implemented in
Common Lisp and has been tested in Allegro CL 4.1, CMU CL 16e, and
Macintosh CL 2.0p2. For more information, contact the authors, Doug
Cutting
Eric Brill's trainable rule-based part of speech tagger (version 1.0.2)
is available by anonymous ftp from
ftp.cs.jhu.edu:/pub/BRILL/Programs/
This tagger is based on transformation-based error-driven learning, a
technique that has been effective in a number of natural language
applications, including part of speech and word sense tagging,
prepositional phrase attachment, and syntactic parsing. For more
information, you can obtain relevant papers in
ftp.cs.jhu.edu:/pub/BRILL/Papers/
If you do download the tagger and wish to be on the mailing list for
future releases, bug reports, etc, please send mail to Eric Brill
The Prolog and DCG programs from Pereira and Shieber's book, "Prolog
and Natural Language Analysis", are available by anonymous ftp from
das.harvard.edu:/pub/shieber/pnla/. See the file README for the
conditions under which the material is distributed. If you retrieve
the files, please send an email message to the authors letting them
know how you plan to use them. For further information, write to
Fernando Pereira
LHIP is a left-head-corner island parser compiler. The system compiles
grammar rules to Prolog code in much the same way as the Prolog DCG
system does. The rules themselves are an extended version of the DCG
rules, allowing optional constituents, negation, disjunction, the
specification of adjacency, and the ability to mark multiple heads in
a rule body. It requires an Edinburgh style Prolog and is known to
work in Sicstus 0.6. LHIP may be retrieved by anonymous ftp from
issun14.unige.ch:/pub/lhip_v1.1.tar.Z [129.194.177.14]
A more efficient version withou negation is also available:
issun14.unigh.ch:/pub/plhip_v1.0.tar.Z [129.194.177.14]
Both are also available from:
ftp.cs.cmu.edu:/user/ai/areas/nlp/parsing/lhip/lhip_v10.tar.gz
Please send a message to the author, Afzal Ballim
to let him know that you're using the package.
PAPPI is a Prolog-based natural language parser for theories in the
Principles-and-Parameters framework. The PAPPI system includes an
X Windows user interface and a sample implementation of classic GB
theory. PAPPI is available by anonymous FTP from
external.nj.nec.com:/pub/sandiway/Pappi-2.0f.tar.gz
For more information, please contact Dr. Sandiway Fong
Hdrug is an environment to develop logic grammars, parsers, and
generators for natural languages. The package comes with a number of
example grammars, including a Categorial Grammar, a Tree Adjoining
Grammar, a Unification Grammar in the spirit of Head-driven Phrase
Structure Grammar, an Extraposition Grammar, a Definite Clause
Grammar, and a port of the HPSG grammar from Bob Carpenter's ALE
system. Each of the grammars comes with a set of parsers, such as
Earley-like chart parsers, left-corner parsers and head-driven
parsers. Some grammars come with variants of the head-driven
generator. The package allows easy comparison of different
parsers/generators, extensive possibilities of compiling feature
equations into Prolog terms, graphical (Tk), LaTeX and ordinary Prolog
output of trees, feature structures and Prolog terms, and plotted
graphs and tables of statistical information. Hdrug runs in Sicstus
Prolog and requires ProTcl and Tcl/Tk. It is available by anonymous
FTP from
tyr.let.rug.nl:/pub/prolog-app/Hdrug/
or by WWW from
http://tyr.let.rug.nl/~vannoord/prolog-app/Hdrug/
For more information, write to Gertjan van Noord
Neural Networks:
A draft review of roughly 40 neurosimulators is available by anonymous
ftp from
ftp.mrc-apu.cam.ac.uk:/pub/nn/
as the file neurosim1.ps.Z (text version in neurosim1.txt and
WordPerfect 5.1 version in neurosim1.w51.Z). The review will appear in
the "Handbook of Brain Research and Neural Networks" (MIT Press, 1995).
Please send comments to Dr. Jacob M.J. Murre
Aspirin/MIGRAINES is a neural network simulator available free from the
MITRE Corporation. It contains a neural network simulation code generator
which generates high performance C code implementations for
backpropagation networks. It runs on the following platforms: Apollo,
Convex, Cray, DecStation, HP, IBM RS/6000, Intel 486/386 (Unix System V),
NeXT, News, Silicon Graphics Iris, Sun3, Sun4, Mercury i860 (40MHz)
Coprocessors, Meiko Computing Surface w/i860 (40MHz) Nodes, Skystation
i860 (40MHz) Coprocessors, and iWarp Cells. The software is available by
anonymous ftp from the CMU simulator collection on pt.cs.cmu.edu
(128.2.254.155) in the directory /afs/cs/project/connect/code (you must
cd to this directory in one atomic operation) and UCLA's cognitive
science collection on ftp.cognet.ucla.edu [128.97.8.19] in the
directory alexis as the file am6.tar.Z, am6.readme, am6.notes. They
include many examples in the release, include an implementation of NETtalk.
For more information, contact Russell Leighton
or
MUME (Multi-Module Neural Computing Environment) is a simulation
environment for multi-modules neural computing. It provides an object
oriented facility for the simulation and training of multiple nets
with various architectures and learning algorithms. The object
oriented structure makes simple the addition of new network classes
and new learning algorithms. MUME includes a library of network
architectures including feedforward, simple recurrent, and
continuously running recurrent neural networks. Each architecture is
supported by a variety of learning algorithms, including backprop,
weight perturbation, node perturbation, and simulated annealing. MUME
can be used for large scale neural network simulations as it provides
support for learning in multi-net environments. It also provide pre-
and post-processing facilities. MUME can be used to include
non-neural computing modules (decision trees, etc.) in applications. _
MUME is being developed at the Machine Intelligence Group at Sydney
University Electrical Engineering. The software is written in 'C' and
is being used on Sun and DEC workstations. Efforts are underway to
port it to the Fujitsu VP2200 vector processor using the VCC
vectorising C compiler, HP 9000/700, SGI workstations, DEC
Alphas, and PC DOS (with DJGCC). MUME is available to research
institutions on a media/doc/postage cost arrangement after
signing a license agreement. The license agreement is available by
anonymous ftp from mickey.sedal.su.oz.au:/pub/license.ps [129.78.24.170].
An overview of mume is available from the same machine as
/pub/mume-overview.ps.Z. It is also available free for MSDOS by
anonymous ftp from
brutus.ee.su.oz.au:/pub/MUME-0.5-DOS.zip
For further information, write to Marwan Jabri, SEDAL, Sydney
University Electrical Engineering, NSW 2006 Australia,
call +61-2-692-2240, fax +61-2-660-1228, or send email to
Marwan Jabri
list, send email to mume-request@sedal.su.oz.au.
Adaptive Logic Network (ALN)
The atree adapative logic network simulation package is available by
anonymous ftp from
ftp.cs.ualberta.ca:pub/atree/ [129.128.4.241]
as the file atree2.tar.Z (Unix). The MS-Windows 3.x version for the
IBM PC is available as either atre27.exe (includes C/C++ sources) or
a27exe.exe (just the executables). The PC version has a lot more
documentation than the Unix version. The Unix version has been ported
to the Macintosh, Amiga, and other machines. Documentation is in
atree2.ps.Z. Also in this directory is a rather impressive OCR demo
using atree. To be added to the mailing list, send email to
alnl-request@cs.ualberta.ca. For more information, contact William W.
Armstrong,
BPS
Neural network simulator. Other files of interest. Executables are
free; source code for a small fee.
gmuvax2.gmu.edu:nn [no longer there?]
NeuralShell
Availible by anonymous ftp from
quanta.eng.ohio-state.edu:/pub/NeuralShell/ [128.146.35.1]
as the file NeuralShell.tar. [No longer available, due to an
alleged trademark infringement.]
CONDELA
A neural network definition language.
tut.cis.ohio-state.edu:/pub/condela
ROCHESTER CONNECTIONIST SIMULATOR
Available from ftp.cs.rochester.edu:/pub/packages/simulator [192.5.53.209].
Includes a backprop package and an X11/SunView interface.
UCLA-SFINX
retina.cs.ucla.edu:/pub/sfinx_v2.0.tar.Z [131.179.16.6]
Use username sfinxftp, password joshua. Contact sfinx@retina.cs.ucla.edu
for more information.
XERION
A neural network simulator from Drew van Camp at the University
of Toronto. It provides a library of routines for building networks
and graphically displaying them. Written in C and uses the X window
system for graphics. Example simulators include Back Propagation,
Recurrent Back Propagation, Boltzmann Machine, Mean Field Theory, Free
Energy Manipulation, Kohonnen Net, and Hard and Soft Competitive
Learning. Xerion runs on SGI Personal Iris, SGI 4d, Sun3 (SunOS), Sun4
(SunOS). Available by anonymous ftp from
ai.toronto.edu:/pub/xerion/
See the file /pub/xerion.README for more information. Also included
is a little program called sciam that contains the basic kernel that
was published in the September 1992 issue of Scientific American.
To be added to the mailing list, send mail to xerion-request@ai.toronto.edu.
Bugs should be reported to xerion-bugs@ai.toronto.edu. Complaints,
suggestions or comments may be sent to xerion@ai.toronto.edu.
SNNS (Stuttgart Neural Network Simulator) is a software simulator for
neural networks on Unix workstations developed at the Institute for
Parallel and Distributed High Performance Systems (IPVR) at the
University of Stuttgart. The SNNS simulator contains a simultor kernel
written in ANSI C and a 2D/3D graphical user interface running under
X11R4/X11R5. It runs under Sun Sparc (SLC, ELC, SS2, GX, GS), DECstation
(2100, 3100, 5000/200), IBM RS 6000, HP 9000, and IBM-PC (386/486). SNNS
includes the following learning procedures: backpropagation (online,
batch, with momentum and flat spot elimin., time delay),
counterpropagation, quickprop, backpercolation 1, and generalized radial
basis functions (RBF), RProp, recurrent ART1, ART2 and ARTMAP, Cascade
Correlation and Recurrent Cascade Correlation, Dynamic LVQ, and Time
delay networks (TDNN). (Elman networks and some other network paradigms
have already been implemented but are scheduled for a later release.)
The SNNS simulator can be obtained via anonymous ftp from
ftp.informatik.uni-stuttgart.de:/pub/SNNS/SNNSv2.1.tar.Z [129.69.211.2].
The PostScript version of the user manual can be obtained as file
SNNSv2.1.Manual.ps.Z. To be added to the mailing list, send a message
to listserv@informatik.uni-stuttgart.de with "subscribe snns
snns@informatik.uni-stuttgart.de. For further information, contact
Andreas Zell,
NEOCOGNITRON SIMULATOR
The Neocognitron Simulator is written in C and is available by
anonymous ftp from
tamsun.tamu.edu:/pub/neocognitron.tar.Z [128.194.15.32]
unix.hensa.ac.uk:/pub/uunet/pub/ai/neural/neocognitron.tar.Z
[129.12.21.7]
PLANET (aka SunNet)
Simulator that runs under X Windows. Written by Yoshiro Miyata
Available by anonymous ftp from
tutserver.tut.ac.jp:/pub/misc/PlaNet5.7.tar.Z [133.15.64.6]
boulder.colorado.edu:/pub/generic-sources/PlaNet5.7.tar.Z [128.138.240.1]
Includes documentation.
LVQ_PAK and SOM_PAK
LVQ_PAK (Learning Vector Quantization) and SOM_PAK (Self-Organizing Maps)
were written by the LVQ/SOM Programming Team of the Helsinki
University of Technology, Laboratory of Computer and Information
Science, Rakentajanaukio 2 C, SF-02150 Espoo, FINLAND. The PAKs
run in Unix and MS-DOS systems. Available by anonymous ftp from
cochlea.hut.fi:/pub/lvq_pak/ [130.233.168.48]
cochlea.hut.fi:/pub/som_pak/
ToolDiag
ToolDiag is a feature selection program that increases the accuracy of
classifiers and reduces their complexity by providing them with a
subset containing only the most relevant features. It has interfaces
to LVQ_PAK and SNNS, and uses a data file format that is compatible
with that of LVQ_PAK. The 2-d graphics can be displayed using the
GNUPLOT plotting package. ToolDiag implements many concepts from
Devijver and Kittler's book "Pattern Recognition -- A Statistical
Approach" (Prentice Hall, 1982), including the optimal branch and
bound search strategy, together with several different selection
criteria. ToolDiag can also perform an error estimation using the
leave-one-out method and a K-nearest-neighbor classifier. It also
includes a learning module (Q*) that has the same functionality as
LVQ. ToolDiag cannot handle missing values and requires continuous or
ordered discrete numerical features. ToolDiag is implemented in C and
documentation and source code are available by anonymous ftp from
ftp.fct.unl.pt:/pub/di/packages
For more information, contact Thomas Rauber
MACTIVATION
ftp.cs.colorado.edu:/pub/cs/misc/ [128.138.243.151]
as the file Mactivation-3.3.sea.hqx.
DartNet
A Macintosh-based Neural Network Simulator with a nice graphical
interface. Available by anonymous ftp from
dartvax.dartmouth.edu:/pub/mac/dartnet.sit.hqx [129.170.16.4]
or by email from bharucha@dartmouth.edu. New network architectures
and learning algorithms can be added to the system by writing small
XCMD-like CODE resources called nDEF's ("Network Definitions"). For
more information, send email to Sean P. Nolan,
NevProp is a C implementation of general purpose backpropagation
software, based on Quickprop 1.0 by Scott Fahlman, as translated from
Common Lisp into C by Terry Regier. It runs on Unix, Macintosh, and
DOS. The quickprop algorithm itself has not changed substantially, but
it now includes options to force gradient descent (per-epoch or
per-pattern), generalization & stopped training, c index, and interface
enhancements. It is available by anonymous ftp from
unssun.scs.unr.edu:/pub/goodman/nevpropdir/ [134.197.10.128]
as the file npxxx.shar (replace xxx with the version number) or
from the CMU Simulator Collection. For further information, contact
Phil Goodman
TCS (Tasmanian Connectionist Simulator) is a neural network
simulation package written in Borland C++ for Windows available by
anonymous ftp from
ftp.psychol.utas.edu.au:/pub/tcs [131.217.35.98]
For further information, write to Zoltan Schreter Dept. Psychology
University of Tasmania Hobart, Tasmania AUSTRALIA,
The HYPERPLANE ANIMATOR is a program that allows convenient graphical
display of the training data and weights in a back-propagation neural
network. As learning progresses and the weights in a neural net
alter, the hyperplane positions move. At the end of the training they
are in positions that roughly divide training data into partitions,
each of which contains only one class of data. Observations of
hyperplane movement can yield valuable insights into neural network
learning. The Animator, developed by Lori Pratt and Steve Nicodemus
of the Colorado School of Mines, uses the Motif toolkit on an IBM
RS6000 with X-Windows. The system currently animates only hyperplanes
representing input-to-hidden weights. The animator is available by
anonymous ftp from
mines.colorado.edu:/pub/software/hyperplane-animator/ [138.67.1.3]
as the file hyperplane-animator.tar. An openwindows version of the
animator is available by anonymous ftp from
cs.rutgers.edu:/pub/hyperplane.animator
For more information, write to lpratt@mines.colorado.edu.
SUZY is a simple neural net classifier system for PCs written in C++
and Turbo Vision. RBFs are used to implement the classifier system
with a class-based algorithm being applied to find the centres and
radii of the RBS units. The program is not intended for any serious
applications and is quite slow, but may be of interest to some people.
It is available by anonymous ftp from
rhino.cis.vutbr.cz:/pub/software/ai/suzy.tar.Z [147.229.3.10]
For further information, contact tgrove@psycho.fme.vutbr.cz.
MBP (Matrix Back Propagation) is an efficient implementation of the
back-propagation algorithm for current-generation workstations. The
algorithm includes a per-epoch adaptive technique for gradient
descent. All the computations are done through matrix multiplications
and make use of highly optimized C code. The goal is to reach almost
peak-performances on RISCs with superscalar capabilities and fast
caches. On some machines (and with large networks) a 30-40x speed-up
can be measured respect to conventional implementations.
The software is available by anonymous ftp from
risc6000.dibe.unige.it:/pub/ [130.251.89.154]
as MBPv1.1.tar.Z (unix version) and MBPv11.zip (DOS version). The
documentation is included in the distribution as the postscript file
mbpv11.ps. For more information, contact Davide Anguita
THE BRAIN is a neural network (backpropagation) simulator for MSDOS
systems. It is simple enough to be used by non-technical people,
yet sophisticated enough for serious research work. It is available
by anonymous ftp from
ftp.technion.ac.il:/pub/unsupported/dos/local/ [132.68.1.10]
ftp.tu.clausthal.de:/pub/msdos/misc/ [139.174.2.10]
as the file brain12.zip. For more information, write to
David Perkovic
PO Box 712, Noarlunga Center SA 5168, Australia.
Neural Systems (Biological Simulation):
BIOSIM is a biologically-oriented neural network simulator. It
implements four neuron models: a simple model only switching ion
channels on and off, the original Hodgkin-Huxley model, the SWIM model
(a modified HH model) and the Golowasch-Buchholz model (the most
enhanced model). Dendrites consist of a chain of segments without
bifurcation. It is in the public domain and runs on Unix workstations
(a less-powerful PC version is also available). BIOSIM includes a
graphical user interface and was designed for research and teaching.
It is available by anonymous ftp from
ftp.uni-kl.de:/pub/bio/neurobio [131.246.9.95]
For more information, write to Stefan Bergdoll
GENESIS (GEneral NEural SImulation System) is a general purpose
simulation platform which supports the simulation of neural systems
ranging from complex models of single neurons to simulations of large
networks made up of more abstract neuronal components. Most current
GENESIS applications involve realistic simulations of biological
neural systems. Although the software can also model more abstract
networks, other simulators are more suitable for backpropagation and
similar connectionist modeling. GENESIS and its graphical front-end
XODUS are written in C and run on SUN and DEC graphics work stations
under UNIX (Sun version 4.0 and up, Ultrix 3.1, 4.0 and up), and
X-windows (versions X11R3, X11R4, and X11R5). The current version of
GENESIS has also been used with Silicon Graphics (Irix 4.0.1 and up)
and the HP 700 series (HPUX). The distribution includes full source
code and documentation for both GENESIS and XODUS as well as fourteen
demonstration and tutorial simulations. Documentation for these
simulations is included, along with three papers that describe the
general organization of the simulator. GENESIS is available by
anonymous ftp from genesis.cns.caltech.edu (131.215.137.64). Before
using ftp, you must telnet to genesis.cns.caltech.edu and login as the
user "genesis" (no password required) to register. If you answer all
the questions asked of you an 'ftp' account will automatically be
created for you. You can then 'ftp' back to the machine and download
the software. Further inquiries concerning GENESIS may be addressed
to genesis@cns.caltech.edu.
Probabilistic Reasoning:
BELIEF is a Common Lisp implementation of the Dempster and Kong fusion
and propagation algorithm for Graphical Belief Function Models and the
Lauritzen and Spiegelhalter algorithm for Graphical Probabilistic
Models. It includes code for manipulating graphical belief models such
as Bayes Nets and Relevance Diagrams (a subset of Influence Diagrams)
using both belief functions and probabilities as basic representations
of uncertainty. It is available by anonymous ftp from
ftp.stat.washington.edu [128.95.17.34]
and by email from the author, Russell Almond
Contact the author at almond@statsci.com for information about a
commercial version GRAPHICAL-BELIEF currently in the prototype stages.
IDEAL is a LISP system developed for building and evaluating influence
diagrams and Bayesian networks. It is accompanied with a graphical
user interface (CLIM-based) for constructing, editing, and solving
belief networks and influence diagrams. For more information, write
to srinivas@rpal.rockwell.com.
Planning:
NONLIN -- cs.umd.edu:/pub/nonlin (128.8.128.8)
Contact: nonlin-users-request@cs.umd.edu
nonlin-bugs@cs.umd.edu
AbTweak is a complete hierarchical, non-linear planner that extends
David Chapman's (MIT 1986) "Tweak" planner as described by
Yang (Waterloo) and Tenenberg (Rochester) in 1989. This implementation
by Steven Woods (1991 Masters Thesis) includes a complete search
strategy suited to abstraction hierarchies known as LEFT-WEDGE (Woods 1991).
This planner and related work predates that of SNLP. AbTweak has a
WWW homepage containing source & related papers accessible on
http://logos.uwaterloo.ca/sgwoods/
AbTweak is also available by anonymous FTP from
logos.uwaterloo.ca:/pub/abtweak/
For more information send mail to Qiang Yang
RHETORICAL -- ftp.cs.rochester.edu:/pub/packages/knowledge-tools
Contact: Brad Miller
SNLP -- cs.washington.edu:/pub/snlp.tar.Z
Contact: weld@cs.washington.edu
Nonlinear planner.
IDM -- sauquoit.gsfc.nasa.gov (128.183.101.29)
Contact: idm-users@chelmsford.gsfc.nasa.gov
STRIPS-like planning.
PRODIGY -- Contact: prodigy@cs.cmu.edu
Integrated Planning and Learning System
SOAR -- ftp.cs.cmu.edu:
/afs/cs.cmu.edu/project/soar/public/Soar5/ -- Lisp Version
/afs/cs.cmu.edu/project/soar/public/Soar6/ -- C Version
Contact: soar-request@cs.cmu.edu
Integrated Agent Architecture.
Supports learning through chunking.
----------------------------------------------------------------
Subject: [5-2b] FTP and Other Resources: Qualitative Reasoning --
Theorem Proving
Qualitative Reasoning/Qualitative Physics:
QSIM -- cs.utexas.edu:/pub/qsim
Contact: Ben Kuipers